/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-noLbe.epf -i ../../../trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 11:55:50,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 11:55:50,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 11:55:50,426 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 11:55:50,427 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 11:55:50,429 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 11:55:50,437 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 11:55:50,442 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 11:55:50,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 11:55:50,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 11:55:50,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 11:55:50,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 11:55:50,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 11:55:50,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 11:55:50,474 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 11:55:50,480 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 11:55:50,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 11:55:50,483 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 11:55:50,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 11:55:50,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 11:55:50,499 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 11:55:50,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 11:55:50,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 11:55:50,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 11:55:50,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 11:55:50,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 11:55:50,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 11:55:50,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 11:55:50,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 11:55:50,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 11:55:50,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 11:55:50,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 11:55:50,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 11:55:50,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 11:55:50,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 11:55:50,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 11:55:50,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 11:55:50,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 11:55:50,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 11:55:50,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 11:55:50,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 11:55:50,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 11:55:50,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2022-07-22 11:55:50,593 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 11:55:50,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 11:55:50,595 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 11:55:50,595 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 11:55:50,597 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 11:55:50,597 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 11:55:50,597 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 11:55:50,597 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 11:55:50,597 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 11:55:50,599 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 11:55:50,599 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 11:55:50,599 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 11:55:50,600 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 11:55:50,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 11:55:50,600 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 11:55:50,600 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 11:55:50,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 11:55:50,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 11:55:50,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 11:55:50,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 11:55:50,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 11:55:50,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 11:55:50,602 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 11:55:50,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 11:55:50,602 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 11:55:50,603 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 11:55:50,603 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 11:55:50,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 11:55:50,604 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 11:55:50,604 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 11:55:50,604 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 11:55:50,605 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 11:55:50,606 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 11:55:50,607 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 11:55:50,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 11:55:51,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 11:55:51,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 11:55:51,037 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 11:55:51,038 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 11:55:51,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c [2022-07-22 11:55:51,124 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f67d5f2b/237badb3ef1543c39f9baca0ba33a6df/FLAGc3accb5c1 [2022-07-22 11:55:51,747 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 11:55:51,748 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c [2022-07-22 11:55:51,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f67d5f2b/237badb3ef1543c39f9baca0ba33a6df/FLAGc3accb5c1 [2022-07-22 11:55:52,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f67d5f2b/237badb3ef1543c39f9baca0ba33a6df [2022-07-22 11:55:52,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 11:55:52,136 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 11:55:52,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 11:55:52,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 11:55:52,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 11:55:52,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:55:52" (1/1) ... [2022-07-22 11:55:52,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2825f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:55:52, skipping insertion in model container [2022-07-22 11:55:52,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 11:55:52" (1/1) ... [2022-07-22 11:55:52,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 11:55:52,174 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 11:55:52,432 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c[2507,2520] [2022-07-22 11:55:52,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:55:52,445 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 11:55:52,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c[2507,2520] [2022-07-22 11:55:52,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 11:55:52,503 INFO L208 MainTranslator]: Completed translation [2022-07-22 11:55:52,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:55:52 WrapperNode [2022-07-22 11:55:52,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 11:55:52,506 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 11:55:52,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 11:55:52,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 11:55:52,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:55:52" (1/1) ... [2022-07-22 11:55:52,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:55:52" (1/1) ... [2022-07-22 11:55:52,558 INFO L137 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 118 [2022-07-22 11:55:52,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 11:55:52,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 11:55:52,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 11:55:52,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 11:55:52,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:55:52" (1/1) ... [2022-07-22 11:55:52,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:55:52" (1/1) ... [2022-07-22 11:55:52,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:55:52" (1/1) ... [2022-07-22 11:55:52,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:55:52" (1/1) ... [2022-07-22 11:55:52,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:55:52" (1/1) ... [2022-07-22 11:55:52,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:55:52" (1/1) ... [2022-07-22 11:55:52,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:55:52" (1/1) ... [2022-07-22 11:55:52,599 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 11:55:52,600 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 11:55:52,600 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 11:55:52,600 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 11:55:52,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:55:52" (1/1) ... [2022-07-22 11:55:52,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:55:52,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:55:52,663 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 11:55:52,679 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 11:55:52,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 11:55:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 11:55:52,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 11:55:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 11:55:52,754 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 11:55:52,754 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-22 11:55:52,754 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-22 11:55:52,756 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-07-22 11:55:52,757 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-07-22 11:55:52,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 11:55:52,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 11:55:52,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 11:55:52,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-07-22 11:55:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-07-22 11:55:52,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 11:55:52,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 11:55:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 11:55:52,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 11:55:52,761 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 11:55:52,930 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 11:55:52,932 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 11:55:53,301 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 11:55:53,394 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 11:55:53,394 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 11:55:53,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:55:53 BoogieIcfgContainer [2022-07-22 11:55:53,398 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 11:55:53,399 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 11:55:53,399 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 11:55:53,404 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 11:55:53,405 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:55:53,405 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 11:55:52" (1/3) ... [2022-07-22 11:55:53,406 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60f4a7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:55:53, skipping insertion in model container [2022-07-22 11:55:53,406 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:55:53,406 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 11:55:52" (2/3) ... [2022-07-22 11:55:53,407 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60f4a7c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 11:55:53, skipping insertion in model container [2022-07-22 11:55:53,407 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 11:55:53,407 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 11:55:53" (3/3) ... [2022-07-22 11:55:53,409 INFO L322 chiAutomizerObserver]: Analyzing ICFG popl20-difference-det.wvr.c [2022-07-22 11:55:53,531 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-22 11:55:53,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 129 transitions, 290 flow [2022-07-22 11:55:53,660 INFO L129 PetriNetUnfolder]: 9/121 cut-off events. [2022-07-22 11:55:53,660 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-07-22 11:55:53,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 121 events. 9/121 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2022-07-22 11:55:53,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 129 transitions, 290 flow [2022-07-22 11:55:53,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 121 transitions, 266 flow [2022-07-22 11:55:53,700 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 11:55:53,701 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 11:55:53,701 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 11:55:53,701 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 11:55:53,701 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 11:55:53,701 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 11:55:53,701 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 11:55:53,702 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 11:55:53,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 11:55:58,099 INFO L131 ngComponentsAnalysis]: Automaton has 2115 accepting balls. 31835 [2022-07-22 11:55:58,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:55:58,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:55:58,111 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:55:58,111 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:55:58,112 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 11:55:58,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 33664 states, but on-demand construction may add more states [2022-07-22 11:55:59,523 INFO L131 ngComponentsAnalysis]: Automaton has 2115 accepting balls. 31835 [2022-07-22 11:55:59,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:55:59,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:55:59,526 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:55:59,526 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:55:59,534 INFO L748 eck$LassoCheckResult]: Stem: 132#[ULTIMATE.startENTRY]don't care [325] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 135#[L-1]don't care [257] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 137#[L-1-1]don't care [332] L-1-1-->L-1-2: Formula: (= (select |v_#valid_19| 0) 0) InVars {#valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|} AuxVars[] AssignedVars[] 139#[L-1-2]don't care [334] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 141#[L21]don't care [298] L21-->L21-1: Formula: (and (= (select |v_#valid_20| 1) 1) (= 2 (select |v_#length_11| 1))) InVars {#length=|v_#length_11|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 143#[L21-1]don't care [321] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_13| 1) 0)) InVars {#memory_int=|v_#memory_int_13|} OutVars{#memory_int=|v_#memory_int_13|} AuxVars[] AssignedVars[] 145#[L21-2]don't care [261] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_14| 1) 1) 0) InVars {#memory_int=|v_#memory_int_14|} OutVars{#memory_int=|v_#memory_int_14|} AuxVars[] AssignedVars[] 147#[L21-3]don't care [293] L21-3-->L21-4: Formula: (and (= (select |v_#length_12| 2) 28) (= (select |v_#valid_21| 2) 1)) InVars {#length=|v_#length_12|, #valid=|v_#valid_21|} OutVars{#length=|v_#length_12|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[] 149#[L21-4]don't care [275] L21-4-->L38: Formula: (= v_~M~0_6 0) InVars {} OutVars{~M~0=v_~M~0_6} AuxVars[] AssignedVars[~M~0] 151#[L38]don't care [276] L38-->L38-1: Formula: (= v_~N~0_6 0) InVars {} OutVars{~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 153#[L38-1]don't care [294] L38-1-->L38-2: Formula: (= v_~counter1~0_7 0) InVars {} OutVars{~counter1~0=v_~counter1~0_7} AuxVars[] AssignedVars[~counter1~0] 155#[L38-2]don't care [331] L38-2-->L-1-3: Formula: (= v_~counter2~0_7 0) InVars {} OutVars{~counter2~0=v_~counter2~0_7} AuxVars[] AssignedVars[~counter2~0] 157#[L-1-3]don't care [336] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 159#[L-1-4]don't care [259] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 161#[L-1-5]don't care [235] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 163#[L-1-6]don't care [314] L-1-6-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_4|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_3|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_3|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_6|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_~#t2~0#1.base] 165#[L83]don't care [240] L83-->L83-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_22|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_13|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (select |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, #valid=|v_#valid_23|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_22|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 167#[L83-1]don't care [278] L83-1-->L83-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_15|) (= (store |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_24|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, #valid=|v_#valid_25|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 169#[L83-2]don't care [316] L83-2-->L83-3: Formula: (and (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0)) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_18|, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 171#[L83-3]don't care [320] L83-3-->L83-4: Formula: (and (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_1| 0)) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 4) |v_#length_1|) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_1| 0) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) 0) (= (store |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 1) |v_#valid_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 173#[L83-4]don't care [277] L83-4-->L85: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_1| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[~M~0] 175#[L85]don't care [254] L85-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 177#[L86]don't care [219] L86-->L86-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_1| v_~N~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 179#[L86-1]don't care [286] L86-1-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 181#[L89]don't care [283] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 183#[L89-1]don't care [265] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 185#[L89-2]don't care [291] L89-2-->L89-3: Formula: (and (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre11#1_2|)) |v_#memory_int_1|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|))) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 187#[L89-3]don't care [385] L89-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 189#[L89-4, thread1ENTRY]don't care [340] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 191#[L89-4, L41-4]don't care [2022-07-22 11:55:59,535 INFO L750 eck$LassoCheckResult]: Loop: 191#[L89-4, L41-4]don't care [343] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~M~0_2) InVars {~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[] 197#[L89-4, L42]don't care [345] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~counter1~0] 207#[L89-4, L44]don't care [347] L44-->L41-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_thread1Thread1of1ForFork1_~i~0_7) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 221#[L89-4, L41-2]don't care [348] L41-2-->L41-3: Formula: (= v_thread1Thread1of1ForFork1_~i~0_9 (+ |v_thread1Thread1of1ForFork1_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 237#[L89-4, L41-3]don't care [349] L41-3-->L41-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 191#[L89-4, L41-4]don't care [2022-07-22 11:55:59,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:55:59,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2061309396, now seen corresponding path program 1 times [2022-07-22 11:55:59,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:55:59,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951062062] [2022-07-22 11:55:59,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:55:59,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:55:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:55:59,774 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:55:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:55:59,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:55:59,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:55:59,903 INFO L85 PathProgramCache]: Analyzing trace with hash 356019353, now seen corresponding path program 1 times [2022-07-22 11:55:59,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:55:59,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41177656] [2022-07-22 11:55:59,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:55:59,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:55:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:55:59,926 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:55:59,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:55:59,942 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:55:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:55:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash 441385638, now seen corresponding path program 1 times [2022-07-22 11:55:59,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:55:59,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489354482] [2022-07-22 11:55:59,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:55:59,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:55:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:55:59,985 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:56:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:00,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:56:00,116 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:56:00,116 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:56:00,116 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:56:00,117 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:56:00,117 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 11:56:00,117 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:00,117 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:56:00,117 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:56:00,117 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration1_Loop [2022-07-22 11:56:00,118 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:56:00,118 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:56:00,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,289 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:56:00,290 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 11:56:00,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:00,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:00,298 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 11:56:00,303 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 11:56:00,304 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:56:00,304 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:56:00,333 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:56:00,334 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.offset_1=3} Honda state: {v_rep#funAddr~thread4.offset_1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 11:56:00,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 11:56:00,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:00,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:00,382 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 11:56:00,391 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:56:00,392 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:56:00,406 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 11:56:00,455 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 11:56:00,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:00,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:00,457 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 11:56:00,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 11:56:00,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:56:00,480 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 11:56:00,703 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 11:56:00,709 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 11:56:00,710 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:56:00,710 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:56:00,710 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:56:00,710 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:56:00,710 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:56:00,710 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:00,710 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:56:00,711 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:56:00,711 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration1_Loop [2022-07-22 11:56:00,711 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:56:00,711 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:56:00,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,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 11:56:00,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,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 11:56:00,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:00,844 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:56:00,850 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:56:00,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:00,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:00,856 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 11:56:00,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:56:00,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:56:00,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:56:00,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:56:00,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:56:00,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:56:00,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:56:00,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:56:00,877 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 11:56:00,878 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:56:00,889 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 11:56:00,889 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 11:56:00,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:00,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:00,893 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 11:56:00,897 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:56:00,898 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 11:56:00,899 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:56:00,900 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~M~0, thread1Thread1of1ForFork1_~i~0) = 1*~M~0 - 1*thread1Thread1of1ForFork1_~i~0 Supporting invariants [] [2022-07-22 11:56:00,899 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 11:56:00,934 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 11:56:00,938 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 11:56:00,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:01,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:56:01,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:56:01,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:56:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:56:01,109 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:56:01,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:56:01,222 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 11:56:01,267 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:56:01,271 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 33664 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:01,552 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 11:56:04,906 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 33664 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 103085 states and 514643 transitions. Complement of second has 8 states. [2022-07-22 11:56:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 11:56:04,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:04,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 283 transitions. [2022-07-22 11:56:04,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 283 transitions. Stem has 29 letters. Loop has 5 letters. [2022-07-22 11:56:04,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:56:04,923 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 11:56:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:56:04,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:56:04,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:56:05,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:56:05,029 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:56:05,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:56:05,095 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 11:56:05,096 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:56:05,096 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 33664 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:08,340 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 33664 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 106541 states and 540982 transitions. Complement of second has 10 states. [2022-07-22 11:56:08,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 11:56:08,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:08,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 335 transitions. [2022-07-22 11:56:08,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 335 transitions. Stem has 29 letters. Loop has 5 letters. [2022-07-22 11:56:08,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:56:08,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 335 transitions. Stem has 34 letters. Loop has 5 letters. [2022-07-22 11:56:08,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:56:08,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 335 transitions. Stem has 29 letters. Loop has 10 letters. [2022-07-22 11:56:08,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:56:08,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106541 states and 540982 transitions. [2022-07-22 11:56:12,708 INFO L131 ngComponentsAnalysis]: Automaton has 3330 accepting balls. 44150 [2022-07-22 11:56:15,030 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106541 states to 77545 states and 387026 transitions. [2022-07-22 11:56:15,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50071 [2022-07-22 11:56:15,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60240 [2022-07-22 11:56:15,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77545 states and 387026 transitions. [2022-07-22 11:56:15,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 11:56:15,383 INFO L220 hiAutomatonCegarLoop]: Abstraction has 77545 states and 387026 transitions. [2022-07-22 11:56:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77545 states and 387026 transitions. [2022-07-22 11:56:19,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77545 to 67378. [2022-07-22 11:56:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67378 states, 67378 states have (on average 4.918237406868711) internal successors, (331381), 67377 states have internal predecessors, (331381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67378 states to 67378 states and 331381 transitions. [2022-07-22 11:56:21,010 INFO L242 hiAutomatonCegarLoop]: Abstraction has 67378 states and 331381 transitions. [2022-07-22 11:56:21,010 INFO L425 stractBuchiCegarLoop]: Abstraction has 67378 states and 331381 transitions. [2022-07-22 11:56:21,010 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 11:56:21,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67378 states and 331381 transitions. [2022-07-22 11:56:22,179 INFO L131 ngComponentsAnalysis]: Automaton has 3330 accepting balls. 44150 [2022-07-22 11:56:22,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:56:22,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:56:22,182 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:56:22,182 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:56:22,188 INFO L748 eck$LassoCheckResult]: Stem: 392902#[ULTIMATE.startENTRY]don't care [325] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 390182#[L-1]don't care [257] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 284920#[L-1-1]don't care [332] L-1-1-->L-1-2: Formula: (= (select |v_#valid_19| 0) 0) InVars {#valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|} AuxVars[] AssignedVars[] 284922#[L-1-2]don't care [334] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 303836#[L21]don't care [298] L21-->L21-1: Formula: (and (= (select |v_#valid_20| 1) 1) (= 2 (select |v_#length_11| 1))) InVars {#length=|v_#length_11|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 303838#[L21-1]don't care [321] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_13| 1) 0)) InVars {#memory_int=|v_#memory_int_13|} OutVars{#memory_int=|v_#memory_int_13|} AuxVars[] AssignedVars[] 390536#[L21-2]don't care [261] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_14| 1) 1) 0) InVars {#memory_int=|v_#memory_int_14|} OutVars{#memory_int=|v_#memory_int_14|} AuxVars[] AssignedVars[] 349024#[L21-3]don't care [293] L21-3-->L21-4: Formula: (and (= (select |v_#length_12| 2) 28) (= (select |v_#valid_21| 2) 1)) InVars {#length=|v_#length_12|, #valid=|v_#valid_21|} OutVars{#length=|v_#length_12|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[] 349026#[L21-4]don't care [275] L21-4-->L38: Formula: (= v_~M~0_6 0) InVars {} OutVars{~M~0=v_~M~0_6} AuxVars[] AssignedVars[~M~0] 385014#[L38]don't care [276] L38-->L38-1: Formula: (= v_~N~0_6 0) InVars {} OutVars{~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 385016#[L38-1]don't care [294] L38-1-->L38-2: Formula: (= v_~counter1~0_7 0) InVars {} OutVars{~counter1~0=v_~counter1~0_7} AuxVars[] AssignedVars[~counter1~0] 390124#[L38-2]don't care [331] L38-2-->L-1-3: Formula: (= v_~counter2~0_7 0) InVars {} OutVars{~counter2~0=v_~counter2~0_7} AuxVars[] AssignedVars[~counter2~0] 385610#[L-1-3]don't care [336] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 385612#[L-1-4]don't care [259] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 326148#[L-1-5]don't care [235] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 308824#[L-1-6]don't care [314] L-1-6-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_4|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_3|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_3|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_6|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_~#t2~0#1.base] 308826#[L83]don't care [240] L83-->L83-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_22|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_13|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (select |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, #valid=|v_#valid_23|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_22|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 347730#[L83-1]don't care [278] L83-1-->L83-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_15|) (= (store |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_24|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, #valid=|v_#valid_25|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 386210#[L83-2]don't care [316] L83-2-->L83-3: Formula: (and (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0)) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_18|, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 386212#[L83-3]don't care [320] L83-3-->L83-4: Formula: (and (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_1| 0)) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 4) |v_#length_1|) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_1| 0) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) 0) (= (store |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 1) |v_#valid_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 353598#[L83-4]don't care [277] L83-4-->L85: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_1| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[~M~0] 353600#[L85]don't care [254] L85-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 386910#[L86]don't care [219] L86-->L86-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_1| v_~N~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 393168#[L86-1]don't care [286] L86-1-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 367672#[L89]don't care [283] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 367674#[L89-1]don't care [265] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 392032#[L89-2]don't care [291] L89-2-->L89-3: Formula: (and (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre11#1_2|)) |v_#memory_int_1|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|))) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 374600#[L89-3]don't care [385] L89-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 340462#[L89-4, thread1ENTRY]don't care [340] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 340464#[L89-4, L41-4]don't care [317] L89-4-->L89-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 360718#[L41-4, L89-5]don't care [2022-07-22 11:56:22,188 INFO L750 eck$LassoCheckResult]: Loop: 360718#[L41-4, L89-5]don't care [343] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~M~0_2) InVars {~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[] 398590#[L42, L89-5]don't care [345] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~counter1~0] 398592#[L44, L89-5]don't care [347] L44-->L41-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_thread1Thread1of1ForFork1_~i~0_7) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 399586#[L89-5, L41-2]don't care [348] L41-2-->L41-3: Formula: (= v_thread1Thread1of1ForFork1_~i~0_9 (+ |v_thread1Thread1of1ForFork1_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 399834#[L41-3, L89-5]don't care [349] L41-3-->L41-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 360718#[L41-4, L89-5]don't care [2022-07-22 11:56:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:22,189 INFO L85 PathProgramCache]: Analyzing trace with hash -523917847, now seen corresponding path program 1 times [2022-07-22 11:56:22,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:56:22,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065448967] [2022-07-22 11:56:22,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:56:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:56:22,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:22,244 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:56:22,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:22,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:56:22,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:22,273 INFO L85 PathProgramCache]: Analyzing trace with hash 356019353, now seen corresponding path program 2 times [2022-07-22 11:56:22,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:56:22,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006576133] [2022-07-22 11:56:22,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:56:22,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:56:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:22,280 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:56:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:22,285 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:56:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash 51787697, now seen corresponding path program 1 times [2022-07-22 11:56:22,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:56:22,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447511553] [2022-07-22 11:56:22,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:56:22,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:56:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:22,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:56:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:22,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:56:22,391 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:56:22,391 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:56:22,391 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:56:22,391 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:56:22,391 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 11:56:22,391 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:22,392 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:56:22,392 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:56:22,392 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration2_Loop [2022-07-22 11:56:22,392 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:56:22,392 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:56:22,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,507 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:56:22,507 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 11:56:22,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:22,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:22,509 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 11:56:22,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:56:22,517 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:56:22,527 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 11:56:22,575 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 11:56:22,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:22,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:22,577 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 11:56:22,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 11:56:22,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:56:22,599 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 11:56:22,757 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 11:56:22,759 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 11:56:22,759 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:56:22,760 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:56:22,760 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:56:22,760 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:56:22,760 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:56:22,760 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:22,760 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:56:22,760 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:56:22,760 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration2_Loop [2022-07-22 11:56:22,761 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:56:22,761 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:56:22,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 11:56:22,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,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 11:56:22,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,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 11:56:22,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:22,882 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:56:22,883 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:56:22,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:22,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:22,889 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 11:56:22,905 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 11:56:22,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:56:22,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:56:22,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:56:22,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:56:22,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:56:22,916 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:56:22,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:56:22,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:56:22,968 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 11:56:22,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:22,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:22,970 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 11:56:22,972 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 11:56:22,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:56:22,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:56:22,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:56:22,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:56:22,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:56:22,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:56:22,984 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:56:23,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:56:23,036 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 11:56:23,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:23,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:23,039 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 11:56:23,045 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 11:56:23,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:56:23,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:56:23,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:56:23,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:56:23,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:56:23,056 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:56:23,056 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:56:23,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:56:23,094 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 11:56:23,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:23,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:23,096 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 11:56:23,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:56:23,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:56:23,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:56:23,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:56:23,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:56:23,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:56:23,120 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:56:23,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:56:23,123 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 11:56:23,130 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:56:23,136 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 11:56:23,137 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 11:56:23,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:23,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:23,138 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 11:56:23,145 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:56:23,145 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 11:56:23,145 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:56:23,145 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0, ~M~0) = -1*thread1Thread1of1ForFork1_~i~0 + 1*~M~0 Supporting invariants [] [2022-07-22 11:56:23,157 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 11:56:23,182 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 11:56:23,184 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 11:56:23,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:56:23,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:56:23,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:56:23,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:56:23,255 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:56:23,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:56:23,298 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 11:56:23,299 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:56:23,300 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67378 states and 331381 transitions. cyclomatic complexity: 268018 Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:24,072 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 11:56:25,564 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67378 states and 331381 transitions. cyclomatic complexity: 268018. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 122650 states and 599824 transitions. Complement of second has 8 states. [2022-07-22 11:56:25,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 11:56:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 214 transitions. [2022-07-22 11:56:25,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 214 transitions. Stem has 30 letters. Loop has 5 letters. [2022-07-22 11:56:25,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:56:25,567 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 11:56:25,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:56:25,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:56:25,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:56:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:56:25,640 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:56:25,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:56:25,683 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 11:56:25,684 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:56:25,684 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67378 states and 331381 transitions. cyclomatic complexity: 268018 Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:28,807 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67378 states and 331381 transitions. cyclomatic complexity: 268018. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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 132917 states and 658337 transitions. Complement of second has 10 states. [2022-07-22 11:56:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 11:56:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 265 transitions. [2022-07-22 11:56:28,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 265 transitions. Stem has 30 letters. Loop has 5 letters. [2022-07-22 11:56:28,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:56:28,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 265 transitions. Stem has 35 letters. Loop has 5 letters. [2022-07-22 11:56:28,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:56:28,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 265 transitions. Stem has 30 letters. Loop has 10 letters. [2022-07-22 11:56:28,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:56:28,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132917 states and 658337 transitions. [2022-07-22 11:56:32,335 INFO L131 ngComponentsAnalysis]: Automaton has 4545 accepting balls. 56465 [2022-07-22 11:56:35,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132917 states to 108273 states and 532033 transitions. [2022-07-22 11:56:35,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63485 [2022-07-22 11:56:35,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73663 [2022-07-22 11:56:35,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108273 states and 532033 transitions. [2022-07-22 11:56:35,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 11:56:35,377 INFO L220 hiAutomatonCegarLoop]: Abstraction has 108273 states and 532033 transitions. [2022-07-22 11:56:36,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108273 states and 532033 transitions. [2022-07-22 11:56:39,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108273 to 67373. [2022-07-22 11:56:39,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67373 states, 67373 states have (on average 4.918424294598727) internal successors, (331369), 67372 states have internal predecessors, (331369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67373 states to 67373 states and 331369 transitions. [2022-07-22 11:56:41,097 INFO L242 hiAutomatonCegarLoop]: Abstraction has 67373 states and 331369 transitions. [2022-07-22 11:56:41,097 INFO L425 stractBuchiCegarLoop]: Abstraction has 67373 states and 331369 transitions. [2022-07-22 11:56:41,097 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 11:56:41,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67373 states and 331369 transitions. [2022-07-22 11:56:41,836 INFO L131 ngComponentsAnalysis]: Automaton has 3329 accepting balls. 44145 [2022-07-22 11:56:41,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:56:41,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:56:41,839 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:56:41,839 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:56:41,840 INFO L748 eck$LassoCheckResult]: Stem: 773962#[ULTIMATE.startENTRY]don't care [325] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 772342#[L-1]don't care [257] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 675462#[L-1-1]don't care [332] L-1-1-->L-1-2: Formula: (= (select |v_#valid_19| 0) 0) InVars {#valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|} AuxVars[] AssignedVars[] 675464#[L-1-2]don't care [334] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 694138#[L21]don't care [298] L21-->L21-1: Formula: (and (= (select |v_#valid_20| 1) 1) (= 2 (select |v_#length_11| 1))) InVars {#length=|v_#length_11|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 694140#[L21-1]don't care [321] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_13| 1) 0)) InVars {#memory_int=|v_#memory_int_13|} OutVars{#memory_int=|v_#memory_int_13|} AuxVars[] AssignedVars[] 772568#[L21-2]don't care [261] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_14| 1) 1) 0) InVars {#memory_int=|v_#memory_int_14|} OutVars{#memory_int=|v_#memory_int_14|} AuxVars[] AssignedVars[] 737278#[L21-3]don't care [293] L21-3-->L21-4: Formula: (and (= (select |v_#length_12| 2) 28) (= (select |v_#valid_21| 2) 1)) InVars {#length=|v_#length_12|, #valid=|v_#valid_21|} OutVars{#length=|v_#length_12|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[] 737280#[L21-4]don't care [275] L21-4-->L38: Formula: (= v_~M~0_6 0) InVars {} OutVars{~M~0=v_~M~0_6} AuxVars[] AssignedVars[~M~0] 768456#[L38]don't care [276] L38-->L38-1: Formula: (= v_~N~0_6 0) InVars {} OutVars{~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 768458#[L38-1]don't care [294] L38-1-->L38-2: Formula: (= v_~counter1~0_7 0) InVars {} OutVars{~counter1~0=v_~counter1~0_7} AuxVars[] AssignedVars[~counter1~0] 772296#[L38-2]don't care [331] L38-2-->L-1-3: Formula: (= v_~counter2~0_7 0) InVars {} OutVars{~counter2~0=v_~counter2~0_7} AuxVars[] AssignedVars[~counter2~0] 768886#[L-1-3]don't care [336] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 768888#[L-1-4]don't care [259] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 715726#[L-1-5]don't care [235] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 699010#[L-1-6]don't care [314] L-1-6-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_4|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_3|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_3|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_6|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_~#t2~0#1.base] 699012#[L83]don't care [240] L83-->L83-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_22|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_13|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (select |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, #valid=|v_#valid_23|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_22|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 736106#[L83-1]don't care [278] L83-1-->L83-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_15|) (= (store |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_24|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, #valid=|v_#valid_25|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 769346#[L83-2]don't care [316] L83-2-->L83-3: Formula: (and (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0)) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_18|, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 769348#[L83-3]don't care [320] L83-3-->L83-4: Formula: (and (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_1| 0)) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 4) |v_#length_1|) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_1| 0) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) 0) (= (store |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 1) |v_#valid_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 741484#[L83-4]don't care [277] L83-4-->L85: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_1| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[~M~0] 741486#[L85]don't care [254] L85-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 769900#[L86]don't care [219] L86-->L86-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_1| v_~N~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 774112#[L86-1]don't care [286] L86-1-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 754220#[L89]don't care [283] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 754222#[L89-1]don't care [265] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 773454#[L89-2]don't care [291] L89-2-->L89-3: Formula: (and (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre11#1_2|)) |v_#memory_int_1|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|))) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 760266#[L89-3]don't care [385] L89-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 729308#[L89-4, thread1ENTRY]don't care [340] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 729310#[L89-4, L41-4]don't care [317] L89-4-->L89-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 721718#[L41-4, L89-5]don't care [330] L89-5-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] 721726#[L41-4, L90]don't care [2022-07-22 11:56:41,840 INFO L750 eck$LassoCheckResult]: Loop: 721726#[L41-4, L90]don't care [343] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~M~0_2) InVars {~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[] 784008#[L42, L90]don't care [345] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~counter1~0] 784006#[L44, L90]don't care [347] L44-->L41-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_thread1Thread1of1ForFork1_~i~0_7) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 784002#[L90, L41-2]don't care [348] L41-2-->L41-3: Formula: (= v_thread1Thread1of1ForFork1_~i~0_9 (+ |v_thread1Thread1of1ForFork1_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 784004#[L41-3, L90]don't care [349] L41-3-->L41-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 721726#[L41-4, L90]don't care [2022-07-22 11:56:41,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:41,841 INFO L85 PathProgramCache]: Analyzing trace with hash 938416257, now seen corresponding path program 1 times [2022-07-22 11:56:41,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:56:41,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923349456] [2022-07-22 11:56:41,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:56:41,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:56:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:41,868 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:56:41,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:41,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:56:41,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:41,892 INFO L85 PathProgramCache]: Analyzing trace with hash 356019353, now seen corresponding path program 3 times [2022-07-22 11:56:41,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:56:41,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080910330] [2022-07-22 11:56:41,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:56:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:56:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:41,898 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:56:41,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:41,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:56:41,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:41,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1231332377, now seen corresponding path program 1 times [2022-07-22 11:56:41,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:56:41,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782049545] [2022-07-22 11:56:41,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:56:41,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:56:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:41,926 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:56:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:56:41,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:56:41,966 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:56:41,966 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:56:41,967 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:56:41,967 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:56:41,967 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 11:56:41,967 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:41,967 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:56:41,967 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:56:41,967 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration3_Loop [2022-07-22 11:56:41,967 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:56:41,967 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:56:41,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 11:56:41,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:41,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:41,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 11:56:41,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:41,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:41,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:41,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:41,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:41,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:41,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:41,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:42,069 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:56:42,069 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 11:56:42,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:42,071 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 11:56:42,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:56:42,076 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:56:42,077 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 11:56:42,098 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:56:42,099 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 11:56:42,135 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 11:56:42,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:42,136 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 11:56:42,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:56:42,146 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:56:42,161 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 11:56:42,164 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:56:42,164 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 11:56:42,199 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 11:56:42,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:42,201 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 11:56:42,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:56:42,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:56:42,219 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 11:56:42,224 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:56:42,225 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.base_5=-1} Honda state: {v_rep#funAddr~thread4.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 11:56:42,260 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 11:56:42,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:42,262 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 11:56:42,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:56:42,265 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:56:42,265 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 11:56:42,278 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:56:42,278 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_5=-1} Honda state: {v_rep#funAddr~thread2.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 11:56:42,300 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 11:56:42,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:42,302 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 11:56:42,304 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 11:56:42,305 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:56:42,305 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:56:42,318 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:56:42,318 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.base_5=-1} Honda state: {v_rep#funAddr~thread3.base_5=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 11:56:42,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-07-22 11:56:42,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:42,342 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 11:56:42,348 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 11:56:42,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:56:42,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:56:42,381 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 11:56:42,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:42,383 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 11:56:42,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 11:56:42,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:56:42,391 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 11:56:42,556 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 11:56:42,559 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 11:56:42,559 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:56:42,559 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:56:42,559 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:56:42,559 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:56:42,560 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:56:42,560 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,560 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:56:42,560 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:56:42,560 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration3_Loop [2022-07-22 11:56:42,560 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:56:42,560 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:56:42,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:42,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:42,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:42,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:42,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 11:56:42,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 11:56:42,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 11:56:42,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 11:56:42,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:42,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:42,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:42,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:56:42,677 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:56:42,678 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:56:42,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:42,679 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 11:56:42,682 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 11:56:42,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:56:42,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:56:42,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:56:42,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:56:42,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:56:42,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:56:42,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:56:42,696 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:56:42,718 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 11:56:42,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:42,721 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 11:56:42,722 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 11:56:42,723 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:56:42,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:56:42,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:56:42,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:56:42,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:56:42,732 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:56:42,732 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:56:42,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:56:42,771 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 11:56:42,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:42,772 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 11:56:42,773 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 11:56:42,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:56:42,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:56:42,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:56:42,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:56:42,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:56:42,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:56:42,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:56:42,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:56:42,829 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 11:56:42,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:42,830 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 11:56:42,831 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 11:56:42,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:56:42,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:56:42,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:56:42,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:56:42,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:56:42,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:56:42,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:56:42,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:56:42,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-22 11:56:42,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:42,869 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 11:56:42,870 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 11:56:42,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:56:42,880 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:56:42,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:56:42,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:56:42,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:56:42,885 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:56:42,885 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:56:42,909 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:56:42,943 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 11:56:42,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:42,944 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 11:56:42,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:56:42,954 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 11:56:42,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:56:42,955 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:56:42,955 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:56:42,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:56:42,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:56:42,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:56:42,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:56:42,958 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:56:42,961 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 11:56:42,961 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 11:56:42,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:56:42,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:56:42,962 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 11:56:42,963 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 11:56:42,964 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:56:42,964 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 11:56:42,964 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:56:42,964 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0, ~M~0) = -1*thread1Thread1of1ForFork1_~i~0 + 1*~M~0 Supporting invariants [] [2022-07-22 11:56:42,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-22 11:56:42,989 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 11:56:43,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:56:43,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:56:43,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:56:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:56:43,059 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:56:43,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:56:43,103 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 11:56:43,104 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:56:43,104 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67373 states and 331369 transitions. cyclomatic complexity: 268010 Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:43,608 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 11:56:45,945 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67373 states and 331369 transitions. cyclomatic complexity: 268010. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 122633 states and 599788 transitions. Complement of second has 8 states. [2022-07-22 11:56:45,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 11:56:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 212 transitions. [2022-07-22 11:56:45,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 212 transitions. Stem has 31 letters. Loop has 5 letters. [2022-07-22 11:56:45,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:56:45,950 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 11:56:45,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:56:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:56:46,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:56:46,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:56:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:56:46,048 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:56:46,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:56:46,092 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 11:56:46,093 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:56:46,093 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67373 states and 331369 transitions. cyclomatic complexity: 268010 Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:49,412 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67373 states and 331369 transitions. cyclomatic complexity: 268010. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 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 132897 states and 658292 transitions. Complement of second has 10 states. [2022-07-22 11:56:49,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 11:56:49,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:56:49,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 262 transitions. [2022-07-22 11:56:49,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 262 transitions. Stem has 31 letters. Loop has 5 letters. [2022-07-22 11:56:49,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:56:49,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 262 transitions. Stem has 36 letters. Loop has 5 letters. [2022-07-22 11:56:49,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:56:49,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 262 transitions. Stem has 31 letters. Loop has 10 letters. [2022-07-22 11:56:49,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:56:49,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132897 states and 658292 transitions. [2022-07-22 11:56:54,601 INFO L131 ngComponentsAnalysis]: Automaton has 4544 accepting balls. 56460 [2022-07-22 11:56:56,823 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132897 states to 108256 states and 531994 transitions. [2022-07-22 11:56:56,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63476 [2022-07-22 11:56:57,155 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73651 [2022-07-22 11:56:57,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108256 states and 531994 transitions. [2022-07-22 11:56:57,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 11:56:57,155 INFO L220 hiAutomatonCegarLoop]: Abstraction has 108256 states and 531994 transitions. [2022-07-22 11:56:57,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108256 states and 531994 transitions. [2022-07-22 11:57:00,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108256 to 67368. [2022-07-22 11:57:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67368 states, 67368 states have (on average 4.918611210070063) internal successors, (331357), 67367 states have internal predecessors, (331357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67368 states to 67368 states and 331357 transitions. [2022-07-22 11:57:02,033 INFO L242 hiAutomatonCegarLoop]: Abstraction has 67368 states and 331357 transitions. [2022-07-22 11:57:02,033 INFO L425 stractBuchiCegarLoop]: Abstraction has 67368 states and 331357 transitions. [2022-07-22 11:57:02,033 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 11:57:02,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67368 states and 331357 transitions. [2022-07-22 11:57:02,751 INFO L131 ngComponentsAnalysis]: Automaton has 3328 accepting balls. 44140 [2022-07-22 11:57:02,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:57:02,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:57:02,754 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:57:02,754 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:57:02,755 INFO L748 eck$LassoCheckResult]: Stem: 1164497#[ULTIMATE.startENTRY]don't care [325] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1162877#[L-1]don't care [257] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 1065997#[L-1-1]don't care [332] L-1-1-->L-1-2: Formula: (= (select |v_#valid_19| 0) 0) InVars {#valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|} AuxVars[] AssignedVars[] 1065999#[L-1-2]don't care [334] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 1084673#[L21]don't care [298] L21-->L21-1: Formula: (and (= (select |v_#valid_20| 1) 1) (= 2 (select |v_#length_11| 1))) InVars {#length=|v_#length_11|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 1084675#[L21-1]don't care [321] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_13| 1) 0)) InVars {#memory_int=|v_#memory_int_13|} OutVars{#memory_int=|v_#memory_int_13|} AuxVars[] AssignedVars[] 1163103#[L21-2]don't care [261] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_14| 1) 1) 0) InVars {#memory_int=|v_#memory_int_14|} OutVars{#memory_int=|v_#memory_int_14|} AuxVars[] AssignedVars[] 1127813#[L21-3]don't care [293] L21-3-->L21-4: Formula: (and (= (select |v_#length_12| 2) 28) (= (select |v_#valid_21| 2) 1)) InVars {#length=|v_#length_12|, #valid=|v_#valid_21|} OutVars{#length=|v_#length_12|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[] 1127815#[L21-4]don't care [275] L21-4-->L38: Formula: (= v_~M~0_6 0) InVars {} OutVars{~M~0=v_~M~0_6} AuxVars[] AssignedVars[~M~0] 1158991#[L38]don't care [276] L38-->L38-1: Formula: (= v_~N~0_6 0) InVars {} OutVars{~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 1158993#[L38-1]don't care [294] L38-1-->L38-2: Formula: (= v_~counter1~0_7 0) InVars {} OutVars{~counter1~0=v_~counter1~0_7} AuxVars[] AssignedVars[~counter1~0] 1162831#[L38-2]don't care [331] L38-2-->L-1-3: Formula: (= v_~counter2~0_7 0) InVars {} OutVars{~counter2~0=v_~counter2~0_7} AuxVars[] AssignedVars[~counter2~0] 1159421#[L-1-3]don't care [336] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1159423#[L-1-4]don't care [259] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1106261#[L-1-5]don't care [235] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 1089545#[L-1-6]don't care [314] L-1-6-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_4|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_3|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_3|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_6|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_~#t2~0#1.base] 1089547#[L83]don't care [240] L83-->L83-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_22|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_13|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (select |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, #valid=|v_#valid_23|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_22|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 1126641#[L83-1]don't care [278] L83-1-->L83-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_15|) (= (store |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_24|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, #valid=|v_#valid_25|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 1159881#[L83-2]don't care [316] L83-2-->L83-3: Formula: (and (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0)) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_18|, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 1159883#[L83-3]don't care [320] L83-3-->L83-4: Formula: (and (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_1| 0)) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 4) |v_#length_1|) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_1| 0) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) 0) (= (store |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 1) |v_#valid_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 1132019#[L83-4]don't care [277] L83-4-->L85: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_1| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[~M~0] 1132021#[L85]don't care [254] L85-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 1160435#[L86]don't care [219] L86-->L86-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_1| v_~N~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 1164647#[L86-1]don't care [286] L86-1-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 1144755#[L89]don't care [283] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 1144757#[L89-1]don't care [265] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 1163989#[L89-2]don't care [291] L89-2-->L89-3: Formula: (and (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre11#1_2|)) |v_#memory_int_1|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|))) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 1150801#[L89-3]don't care [385] L89-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1119843#[L89-4, thread1ENTRY]don't care [340] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 1119845#[L89-4, L41-4]don't care [317] L89-4-->L89-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 1112253#[L41-4, L89-5]don't care [330] L89-5-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] 1112261#[L41-4, L90]don't care [329] L90-->L90-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 1166363#[L41-4, L90-1]don't care [2022-07-22 11:57:02,755 INFO L750 eck$LassoCheckResult]: Loop: 1166363#[L41-4, L90-1]don't care [343] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~M~0_2) InVars {~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[] 1177545#[L42, L90-1]don't care [345] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~counter1~0] 1177547#[L90-1, L44]don't care [347] L44-->L41-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_thread1Thread1of1ForFork1_~i~0_7) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 1177551#[L90-1, L41-2]don't care [348] L41-2-->L41-3: Formula: (= v_thread1Thread1of1ForFork1_~i~0_9 (+ |v_thread1Thread1of1ForFork1_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 1177567#[L41-3, L90-1]don't care [349] L41-3-->L41-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 1166363#[L41-4, L90-1]don't care [2022-07-22 11:57:02,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:02,756 INFO L85 PathProgramCache]: Analyzing trace with hash -973866776, now seen corresponding path program 1 times [2022-07-22 11:57:02,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:02,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514565685] [2022-07-22 11:57:02,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:02,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:02,802 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:02,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:02,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:02,823 INFO L85 PathProgramCache]: Analyzing trace with hash 356019353, now seen corresponding path program 4 times [2022-07-22 11:57:02,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:02,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179730973] [2022-07-22 11:57:02,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:02,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:02,828 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:02,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:02,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:02,833 INFO L85 PathProgramCache]: Analyzing trace with hash -886117358, now seen corresponding path program 1 times [2022-07-22 11:57:02,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:02,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992275943] [2022-07-22 11:57:02,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:02,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:02,851 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:02,884 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:02,902 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:57:02,903 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:57:02,903 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:57:02,903 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:57:02,903 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 11:57:02,903 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:02,903 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:57:02,903 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:57:02,903 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration4_Loop [2022-07-22 11:57:02,903 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:57:02,903 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:57:02,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,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 11:57:02,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 11:57:02,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,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 11:57:02,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,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 11:57:02,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 11:57:02,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:02,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 11:57:02,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,004 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:57:03,005 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 11:57:03,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,006 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 11:57:03,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:03,011 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:03,027 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 11:57:03,031 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:03,031 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 11:57:03,062 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 11:57:03,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,064 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 11:57:03,067 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 11:57:03,068 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:03,068 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:03,082 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:03,082 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.base_7=-1} Honda state: {v_rep#funAddr~thread3.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 11:57:03,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-22 11:57:03,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,105 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 11:57:03,106 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 11:57:03,107 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:03,107 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:03,120 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:03,121 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.base_7=-1} Honda state: {v_rep#funAddr~thread4.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 11:57:03,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:03,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,146 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 11:57:03,149 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 11:57:03,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:03,149 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:03,162 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:03,162 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 11:57:03,185 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 11:57:03,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,186 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 11:57:03,187 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 11:57:03,187 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:03,188 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:03,202 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:03,202 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.offset_7=3} Honda state: {v_rep#funAddr~thread4.offset_7=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 11:57:03,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-22 11:57:03,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,226 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 11:57:03,228 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 11:57:03,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:03,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:03,261 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 11:57:03,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,263 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 11:57:03,263 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 11:57:03,264 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 11:57:03,264 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:03,409 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 11:57:03,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:03,412 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:57:03,412 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:57:03,412 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:57:03,412 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:57:03,412 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:57:03,412 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,412 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:57:03,412 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:57:03,412 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration4_Loop [2022-07-22 11:57:03,412 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:57:03,413 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:57:03,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:03,527 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:57:03,527 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:57:03,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,529 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 11:57:03,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:03,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:03,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:03,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:03,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:03,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:03,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:03,560 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 11:57:03,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:03,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:03,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,610 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 11:57:03,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:03,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:03,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:03,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:03,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:03,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:03,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:03,627 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 11:57:03,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:03,672 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 11:57:03,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,673 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 11:57:03,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:03,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:03,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:03,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:03,687 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:03,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:03,689 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:03,693 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 11:57:03,700 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:03,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:03,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,733 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 11:57:03,733 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 11:57:03,734 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:03,741 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:03,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:03,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:03,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:03,743 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:03,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:03,747 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:03,769 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 11:57:03,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,770 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 11:57:03,771 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 11:57:03,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:03,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:03,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:03,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:03,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:03,780 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:03,780 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:03,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:03,820 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 11:57:03,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,821 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 11:57:03,823 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 11:57:03,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:03,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:03,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:03,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:03,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:03,834 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:03,834 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:03,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:03,861 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 11:57:03,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,862 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 11:57:03,865 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 11:57:03,865 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:03,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:03,872 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:03,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:03,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:03,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:03,873 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:03,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:03,875 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:57:03,879 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 11:57:03,879 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 11:57:03,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:03,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:03,880 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 11:57:03,881 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 11:57:03,882 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:57:03,882 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 11:57:03,882 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:57:03,882 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0, ~M~0) = -1*thread1Thread1of1ForFork1_~i~0 + 1*~M~0 Supporting invariants [] [2022-07-22 11:57:03,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-22 11:57:03,906 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 11:57:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:03,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:57:03,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:03,989 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:57:03,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:04,038 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 11:57:04,039 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:57:04,039 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67368 states and 331357 transitions. cyclomatic complexity: 268002 Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:04,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:06,271 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67368 states and 331357 transitions. cyclomatic complexity: 268002. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 122616 states and 599752 transitions. Complement of second has 8 states. [2022-07-22 11:57:06,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 11:57:06,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 210 transitions. [2022-07-22 11:57:06,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 210 transitions. Stem has 32 letters. Loop has 5 letters. [2022-07-22 11:57:06,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:06,274 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 11:57:06,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:06,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:57:06,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:06,354 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:57:06,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:06,901 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 11:57:06,904 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:57:06,904 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67368 states and 331357 transitions. cyclomatic complexity: 268002 Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:09,579 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67368 states and 331357 transitions. cyclomatic complexity: 268002. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 132877 states and 658247 transitions. Complement of second has 10 states. [2022-07-22 11:57:09,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 11:57:09,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 259 transitions. [2022-07-22 11:57:09,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 259 transitions. Stem has 32 letters. Loop has 5 letters. [2022-07-22 11:57:09,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:09,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 259 transitions. Stem has 37 letters. Loop has 5 letters. [2022-07-22 11:57:09,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:09,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 259 transitions. Stem has 32 letters. Loop has 10 letters. [2022-07-22 11:57:09,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:09,582 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132877 states and 658247 transitions. [2022-07-22 11:57:12,945 INFO L131 ngComponentsAnalysis]: Automaton has 4543 accepting balls. 56455 [2022-07-22 11:57:15,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132877 states to 108239 states and 531955 transitions. [2022-07-22 11:57:15,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63467 [2022-07-22 11:57:15,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73639 [2022-07-22 11:57:15,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108239 states and 531955 transitions. [2022-07-22 11:57:15,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 11:57:15,816 INFO L220 hiAutomatonCegarLoop]: Abstraction has 108239 states and 531955 transitions. [2022-07-22 11:57:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108239 states and 531955 transitions. [2022-07-22 11:57:18,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108239 to 67363. [2022-07-22 11:57:18,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67363 states, 67363 states have (on average 4.918798153288898) internal successors, (331345), 67362 states have internal predecessors, (331345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67363 states to 67363 states and 331345 transitions. [2022-07-22 11:57:20,644 INFO L242 hiAutomatonCegarLoop]: Abstraction has 67363 states and 331345 transitions. [2022-07-22 11:57:20,644 INFO L425 stractBuchiCegarLoop]: Abstraction has 67363 states and 331345 transitions. [2022-07-22 11:57:20,644 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 11:57:20,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67363 states and 331345 transitions. [2022-07-22 11:57:21,718 INFO L131 ngComponentsAnalysis]: Automaton has 3327 accepting balls. 44135 [2022-07-22 11:57:21,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:57:21,719 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:57:21,723 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:57:21,723 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:57:21,725 INFO L748 eck$LassoCheckResult]: Stem: 1554991#[ULTIMATE.startENTRY]don't care [325] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1553371#[L-1]don't care [257] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 1456491#[L-1-1]don't care [332] L-1-1-->L-1-2: Formula: (= (select |v_#valid_19| 0) 0) InVars {#valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|} AuxVars[] AssignedVars[] 1456493#[L-1-2]don't care [334] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 1475167#[L21]don't care [298] L21-->L21-1: Formula: (and (= (select |v_#valid_20| 1) 1) (= 2 (select |v_#length_11| 1))) InVars {#length=|v_#length_11|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 1475169#[L21-1]don't care [321] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_13| 1) 0)) InVars {#memory_int=|v_#memory_int_13|} OutVars{#memory_int=|v_#memory_int_13|} AuxVars[] AssignedVars[] 1553597#[L21-2]don't care [261] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_14| 1) 1) 0) InVars {#memory_int=|v_#memory_int_14|} OutVars{#memory_int=|v_#memory_int_14|} AuxVars[] AssignedVars[] 1518307#[L21-3]don't care [293] L21-3-->L21-4: Formula: (and (= (select |v_#length_12| 2) 28) (= (select |v_#valid_21| 2) 1)) InVars {#length=|v_#length_12|, #valid=|v_#valid_21|} OutVars{#length=|v_#length_12|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[] 1518309#[L21-4]don't care [275] L21-4-->L38: Formula: (= v_~M~0_6 0) InVars {} OutVars{~M~0=v_~M~0_6} AuxVars[] AssignedVars[~M~0] 1549485#[L38]don't care [276] L38-->L38-1: Formula: (= v_~N~0_6 0) InVars {} OutVars{~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 1549487#[L38-1]don't care [294] L38-1-->L38-2: Formula: (= v_~counter1~0_7 0) InVars {} OutVars{~counter1~0=v_~counter1~0_7} AuxVars[] AssignedVars[~counter1~0] 1553325#[L38-2]don't care [331] L38-2-->L-1-3: Formula: (= v_~counter2~0_7 0) InVars {} OutVars{~counter2~0=v_~counter2~0_7} AuxVars[] AssignedVars[~counter2~0] 1549915#[L-1-3]don't care [336] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1549917#[L-1-4]don't care [259] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1496755#[L-1-5]don't care [235] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 1480039#[L-1-6]don't care [314] L-1-6-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_4|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_3|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_3|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_6|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_~#t2~0#1.base] 1480041#[L83]don't care [240] L83-->L83-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_22|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_13|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (select |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, #valid=|v_#valid_23|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_22|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 1517135#[L83-1]don't care [278] L83-1-->L83-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_15|) (= (store |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_24|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, #valid=|v_#valid_25|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 1550375#[L83-2]don't care [316] L83-2-->L83-3: Formula: (and (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0)) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_18|, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 1550377#[L83-3]don't care [320] L83-3-->L83-4: Formula: (and (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_1| 0)) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 4) |v_#length_1|) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_1| 0) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) 0) (= (store |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 1) |v_#valid_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 1522513#[L83-4]don't care [277] L83-4-->L85: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_1| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[~M~0] 1522515#[L85]don't care [254] L85-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 1550929#[L86]don't care [219] L86-->L86-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_1| v_~N~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 1555141#[L86-1]don't care [286] L86-1-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 1535249#[L89]don't care [283] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 1535251#[L89-1]don't care [265] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 1554483#[L89-2]don't care [291] L89-2-->L89-3: Formula: (and (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre11#1_2|)) |v_#memory_int_1|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|))) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 1541295#[L89-3]don't care [385] L89-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1510337#[L89-4, thread1ENTRY]don't care [340] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 1510339#[L89-4, L41-4]don't care [317] L89-4-->L89-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 1502747#[L41-4, L89-5]don't care [330] L89-5-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] 1502755#[L41-4, L90]don't care [329] L90-->L90-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 1548313#[L41-4, L90-1]don't care [241] L90-1-->L90-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 1548315#[L90-2, L41-4]don't care [2022-07-22 11:57:21,725 INFO L750 eck$LassoCheckResult]: Loop: 1548315#[L90-2, L41-4]don't care [343] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~M~0_2) InVars {~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[] 1561203#[L90-2, L42]don't care [345] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~counter1~0] 1561205#[L90-2, L44]don't care [347] L44-->L41-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_thread1Thread1of1ForFork1_~i~0_7) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 1564961#[L90-2, L41-2]don't care [348] L41-2-->L41-3: Formula: (= v_thread1Thread1of1ForFork1_~i~0_9 (+ |v_thread1Thread1of1ForFork1_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 1564963#[L90-2, L41-3]don't care [349] L41-3-->L41-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 1548315#[L90-2, L41-4]don't care [2022-07-22 11:57:21,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:21,726 INFO L85 PathProgramCache]: Analyzing trace with hash -125098743, now seen corresponding path program 1 times [2022-07-22 11:57:21,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:21,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532587310] [2022-07-22 11:57:21,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:21,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:21,801 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:21,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:21,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash 356019353, now seen corresponding path program 5 times [2022-07-22 11:57:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:21,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241225027] [2022-07-22 11:57:21,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:21,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:21,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:21,859 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:21,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:21,860 INFO L85 PathProgramCache]: Analyzing trace with hash -326947695, now seen corresponding path program 1 times [2022-07-22 11:57:21,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:21,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578488103] [2022-07-22 11:57:21,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:21,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:21,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:21,896 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:21,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:21,958 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:57:21,958 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:57:21,958 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:57:21,958 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:57:21,958 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 11:57:21,959 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:21,959 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:57:21,959 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:57:21,959 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration5_Loop [2022-07-22 11:57:21,959 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:57:21,959 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:57:21,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 11:57:21,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 11:57:21,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 11:57:21,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:21,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:21,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:21,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:21,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:21,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:21,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:21,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:21,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:22,092 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:57:22,096 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 11:57:22,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:22,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:22,098 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 11:57:22,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:22,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:22,116 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 11:57:22,119 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:22,119 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.offset_9=2} Honda state: {v_rep#funAddr~thread3.offset_9=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 11:57:22,157 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 11:57:22,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:22,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:22,158 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 11:57:22,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:22,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:22,175 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 11:57:22,178 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:22,178 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 11:57:22,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:22,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:22,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:22,214 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 11:57:22,217 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:22,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:22,231 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 11:57:22,236 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:22,236 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread3.base_9=-1} Honda state: {v_rep#funAddr~thread3.base_9=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 11:57:22,271 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 11:57:22,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:22,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:22,273 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 11:57:22,275 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:22,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:22,285 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 11:57:22,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:22,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:22,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:22,341 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 11:57:22,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 11:57:22,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:22,358 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 11:57:22,372 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:22,372 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~counter1~0=0} Honda state: {~counter1~0=0} Generalized eigenvectors: [{~counter1~0=1}, {~counter1~0=3}, {~counter1~0=-3}] Lambdas: [1, 1, 1] Nus: [0, 0] [2022-07-22 11:57:22,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:22,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:22,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:22,409 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 11:57:22,412 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:22,412 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:22,422 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 11:57:22,445 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:22,445 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {thread1Thread1of1ForFork1_#t~post2=0} Honda state: {thread1Thread1of1ForFork1_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 11:57:22,481 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 11:57:22,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:22,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:22,483 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 11:57:22,485 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:22,485 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:22,499 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 11:57:22,504 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:22,504 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.base_9=-1} Honda state: {v_rep#funAddr~thread4.base_9=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 11:57:22,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:22,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:22,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:22,541 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 11:57:22,547 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:22,547 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:22,557 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 11:57:22,567 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:22,567 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 11:57:22,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:22,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:22,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:22,603 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 11:57:22,605 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:22,605 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:22,620 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 11:57:22,625 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:22,625 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread4.offset_9=3} Honda state: {v_rep#funAddr~thread4.offset_9=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 11:57:22,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:22,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:22,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:22,661 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 11:57:22,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:22,664 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:22,677 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 11:57:22,690 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:22,690 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_9=1} Honda state: {v_rep#funAddr~thread2.offset_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 11:57:22,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:22,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:22,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:22,727 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 11:57:22,729 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:22,729 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:22,745 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 11:57:22,748 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:22,748 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 11:57:22,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:22,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:22,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:22,786 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 11:57:22,788 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:22,788 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:22,799 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 11:57:22,844 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 11:57:22,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:22,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:22,845 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 11:57:22,847 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 11:57:22,847 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:22,862 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 11:57:23,072 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 11:57:23,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:23,076 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:57:23,076 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:57:23,076 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:57:23,076 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:57:23,076 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:57:23,076 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:23,076 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:57:23,077 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:57:23,077 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration5_Loop [2022-07-22 11:57:23,077 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:57:23,077 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:57:23,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:23,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:23,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:23,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:23,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:23,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:23,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:23,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:23,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:23,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:23,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:23,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:23,178 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:57:23,178 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:57:23,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:23,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:23,470 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 11:57:23,503 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:23,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:23,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:23,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:23,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:23,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:23,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:23,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:23,514 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 11:57:23,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:23,586 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 11:57:23,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:23,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:23,588 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 11:57:23,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:23,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:23,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:23,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:23,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:23,599 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:23,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:23,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:23,601 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 11:57:23,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:23,643 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 11:57:23,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:23,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:23,645 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 11:57:23,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 11:57:23,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:23,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:23,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:23,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:23,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:23,656 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:23,656 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:23,658 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 11:57:23,670 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:23,705 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 11:57:23,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:23,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:23,706 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 11:57:23,708 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:23,717 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:23,717 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:23,717 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:23,717 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:23,719 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:23,719 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:23,717 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 11:57:23,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:23,767 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 11:57:23,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:23,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:23,768 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 11:57:23,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:23,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:23,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:23,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:23,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:23,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:23,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:23,780 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 11:57:23,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:23,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:23,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:23,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:23,834 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 11:57:23,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:23,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:23,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:23,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:23,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:23,850 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:23,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:23,853 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 11:57:23,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:23,900 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 11:57:23,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:23,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:23,902 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 11:57:23,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:23,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:23,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:23,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:23,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:23,914 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:23,914 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:23,918 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 11:57:23,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:23,961 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 11:57:23,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:23,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:23,962 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 11:57:23,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:23,972 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 11:57:23,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:23,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:23,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:23,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:23,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:23,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:23,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:24,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:24,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:24,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:24,027 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 11:57:24,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:24,036 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 11:57:24,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:24,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:24,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:24,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:24,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:24,039 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:24,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:24,054 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:57:24,059 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 11:57:24,059 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 11:57:24,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:24,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:24,062 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 11:57:24,064 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:57:24,065 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 11:57:24,065 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:57:24,065 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0, ~M~0) = -1*thread1Thread1of1ForFork1_~i~0 + 1*~M~0 Supporting invariants [] [2022-07-22 11:57:24,079 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 11:57:24,100 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 11:57:24,101 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 11:57:24,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:24,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:57:24,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:24,193 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:57:24,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:24,254 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 11:57:24,255 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:57:24,255 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67363 states and 331345 transitions. cyclomatic complexity: 267994 Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:25,766 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 11:57:27,317 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67363 states and 331345 transitions. cyclomatic complexity: 267994. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 122599 states and 599716 transitions. Complement of second has 8 states. [2022-07-22 11:57:27,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 11:57:27,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:27,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 208 transitions. [2022-07-22 11:57:27,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 208 transitions. Stem has 33 letters. Loop has 5 letters. [2022-07-22 11:57:27,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:27,319 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 11:57:27,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:27,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:57:27,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:27,389 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:57:27,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:27,431 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 11:57:27,432 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:57:27,432 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67363 states and 331345 transitions. cyclomatic complexity: 267994 Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:30,852 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67363 states and 331345 transitions. cyclomatic complexity: 267994. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 132857 states and 658202 transitions. Complement of second has 10 states. [2022-07-22 11:57:30,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 11:57:30,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:30,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 256 transitions. [2022-07-22 11:57:30,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 256 transitions. Stem has 33 letters. Loop has 5 letters. [2022-07-22 11:57:30,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:30,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 256 transitions. Stem has 38 letters. Loop has 5 letters. [2022-07-22 11:57:30,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:30,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 256 transitions. Stem has 33 letters. Loop has 10 letters. [2022-07-22 11:57:30,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:30,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132857 states and 658202 transitions. [2022-07-22 11:57:35,969 INFO L131 ngComponentsAnalysis]: Automaton has 4542 accepting balls. 56450 [2022-07-22 11:57:38,497 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132857 states to 108222 states and 531916 transitions. [2022-07-22 11:57:38,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63458 [2022-07-22 11:57:38,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73627 [2022-07-22 11:57:38,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108222 states and 531916 transitions. [2022-07-22 11:57:38,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 11:57:38,825 INFO L220 hiAutomatonCegarLoop]: Abstraction has 108222 states and 531916 transitions. [2022-07-22 11:57:39,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108222 states and 531916 transitions. [2022-07-22 11:57:42,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108222 to 67358. [2022-07-22 11:57:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67358 states, 67358 states have (on average 4.918985124261409) internal successors, (331333), 67357 states have internal predecessors, (331333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67358 states to 67358 states and 331333 transitions. [2022-07-22 11:57:42,765 INFO L242 hiAutomatonCegarLoop]: Abstraction has 67358 states and 331333 transitions. [2022-07-22 11:57:42,765 INFO L425 stractBuchiCegarLoop]: Abstraction has 67358 states and 331333 transitions. [2022-07-22 11:57:42,765 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 11:57:42,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67358 states and 331333 transitions. [2022-07-22 11:57:44,044 INFO L131 ngComponentsAnalysis]: Automaton has 3326 accepting balls. 44130 [2022-07-22 11:57:44,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:57:44,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:57:44,047 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:57:44,048 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:57:44,049 INFO L748 eck$LassoCheckResult]: Stem: 1945444#[ULTIMATE.startENTRY]don't care [325] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1943824#[L-1]don't care [257] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 1846944#[L-1-1]don't care [332] L-1-1-->L-1-2: Formula: (= (select |v_#valid_19| 0) 0) InVars {#valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|} AuxVars[] AssignedVars[] 1846946#[L-1-2]don't care [334] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 1865620#[L21]don't care [298] L21-->L21-1: Formula: (and (= (select |v_#valid_20| 1) 1) (= 2 (select |v_#length_11| 1))) InVars {#length=|v_#length_11|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 1865622#[L21-1]don't care [321] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_13| 1) 0)) InVars {#memory_int=|v_#memory_int_13|} OutVars{#memory_int=|v_#memory_int_13|} AuxVars[] AssignedVars[] 1944050#[L21-2]don't care [261] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_14| 1) 1) 0) InVars {#memory_int=|v_#memory_int_14|} OutVars{#memory_int=|v_#memory_int_14|} AuxVars[] AssignedVars[] 1908760#[L21-3]don't care [293] L21-3-->L21-4: Formula: (and (= (select |v_#length_12| 2) 28) (= (select |v_#valid_21| 2) 1)) InVars {#length=|v_#length_12|, #valid=|v_#valid_21|} OutVars{#length=|v_#length_12|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[] 1908762#[L21-4]don't care [275] L21-4-->L38: Formula: (= v_~M~0_6 0) InVars {} OutVars{~M~0=v_~M~0_6} AuxVars[] AssignedVars[~M~0] 1939938#[L38]don't care [276] L38-->L38-1: Formula: (= v_~N~0_6 0) InVars {} OutVars{~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 1939940#[L38-1]don't care [294] L38-1-->L38-2: Formula: (= v_~counter1~0_7 0) InVars {} OutVars{~counter1~0=v_~counter1~0_7} AuxVars[] AssignedVars[~counter1~0] 1943774#[L38-2]don't care [331] L38-2-->L-1-3: Formula: (= v_~counter2~0_7 0) InVars {} OutVars{~counter2~0=v_~counter2~0_7} AuxVars[] AssignedVars[~counter2~0] 1940368#[L-1-3]don't care [336] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1940370#[L-1-4]don't care [259] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 1887208#[L-1-5]don't care [235] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 1870492#[L-1-6]don't care [314] L-1-6-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_4|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_3|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_3|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_6|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_~#t2~0#1.base] 1870494#[L83]don't care [240] L83-->L83-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_22|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_13|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (select |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, #valid=|v_#valid_23|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_22|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 1907578#[L83-1]don't care [278] L83-1-->L83-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_15|) (= (store |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_24|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, #valid=|v_#valid_25|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 1940828#[L83-2]don't care [316] L83-2-->L83-3: Formula: (and (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0)) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_18|, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 1940830#[L83-3]don't care [320] L83-3-->L83-4: Formula: (and (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_1| 0)) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 4) |v_#length_1|) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_1| 0) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) 0) (= (store |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 1) |v_#valid_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 1912966#[L83-4]don't care [277] L83-4-->L85: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_1| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[~M~0] 1912968#[L85]don't care [254] L85-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 1941382#[L86]don't care [219] L86-->L86-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_1| v_~N~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 1945594#[L86-1]don't care [286] L86-1-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 1925698#[L89]don't care [283] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 1925700#[L89-1]don't care [265] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 1944936#[L89-2]don't care [291] L89-2-->L89-3: Formula: (and (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre11#1_2|)) |v_#memory_int_1|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|))) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 1931744#[L89-3]don't care [385] L89-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 1900790#[L89-4, thread1ENTRY]don't care [340] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 1900792#[L89-4, L41-4]don't care [317] L89-4-->L89-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 1893200#[L41-4, L89-5]don't care [330] L89-5-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] 1893208#[L41-4, L90]don't care [329] L90-->L90-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 1938766#[L41-4, L90-1]don't care [241] L90-1-->L90-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 1938768#[L90-2, L41-4]don't care [247] L90-2-->L90-3: Formula: (and (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre13#1_2|)) |v_#memory_int_3|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_4|, #memory_int=|v_#memory_int_4|, #length=|v_#length_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_4|, #memory_int=|v_#memory_int_3|, #length=|v_#length_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] 1945694#[L90-3, L41-4]don't care [2022-07-22 11:57:44,049 INFO L750 eck$LassoCheckResult]: Loop: 1945694#[L90-3, L41-4]don't care [343] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~M~0_2) InVars {~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[] 1952798#[L90-3, L42]don't care [345] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~counter1~0] 1952800#[L90-3, L44]don't care [347] L44-->L41-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_thread1Thread1of1ForFork1_~i~0_7) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 1952862#[L90-3, L41-2]don't care [348] L41-2-->L41-3: Formula: (= v_thread1Thread1of1ForFork1_~i~0_9 (+ |v_thread1Thread1of1ForFork1_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 1953396#[L41-3, L90-3]don't care [349] L41-3-->L41-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 1945694#[L90-3, L41-4]don't care [2022-07-22 11:57:44,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:44,049 INFO L85 PathProgramCache]: Analyzing trace with hash 416906510, now seen corresponding path program 1 times [2022-07-22 11:57:44,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:44,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681255473] [2022-07-22 11:57:44,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:44,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:44,091 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:44,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:44,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:44,119 INFO L85 PathProgramCache]: Analyzing trace with hash 356019353, now seen corresponding path program 6 times [2022-07-22 11:57:44,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:44,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831434288] [2022-07-22 11:57:44,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:44,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:44,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:44,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:44,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:44,128 INFO L85 PathProgramCache]: Analyzing trace with hash -782420, now seen corresponding path program 1 times [2022-07-22 11:57:44,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:57:44,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751911606] [2022-07-22 11:57:44,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:57:44,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:57:44,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:44,147 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:57:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:57:44,164 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:57:44,185 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:57:44,185 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:57:44,185 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:57:44,185 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:57:44,185 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 11:57:44,186 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:44,186 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:57:44,186 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:57:44,186 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration6_Loop [2022-07-22 11:57:44,186 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:57:44,186 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:57:44,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,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 11:57:44,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 11:57:44,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,289 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:57:44,289 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 11:57:44,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:44,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:44,291 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 11:57:44,299 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:44,299 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:44,308 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 11:57:44,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-22 11:57:44,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:44,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:44,334 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 11:57:44,335 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 11:57:44,336 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 11:57:44,336 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:44,358 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:44,358 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~counter1~0=0} Honda state: {~counter1~0=0} Generalized eigenvectors: [{~counter1~0=1}, {~counter1~0=3}, {~counter1~0=-3}] Lambdas: [1, 1, 1] Nus: [0, 0] [2022-07-22 11:57:44,380 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 11:57:44,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:44,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:44,381 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 11:57:44,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:44,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:44,386 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 11:57:44,397 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:44,397 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 11:57:44,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-22 11:57:44,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:44,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:44,421 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 11:57:44,422 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 11:57:44,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:44,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:44,436 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 11:57:44,436 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.base_11=-1} Honda state: {v_rep#funAddr~thread2.base_11=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 11:57:44,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-07-22 11:57:44,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:44,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:44,470 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 11:57:44,473 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:57:44,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:44,484 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 11:57:44,527 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 11:57:44,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:44,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:44,529 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 11:57:44,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 11:57:44,531 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:57:44,547 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 11:57:44,693 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 11:57:44,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-22 11:57:44,696 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:57:44,696 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:57:44,696 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:57:44,696 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:57:44,696 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:57:44,696 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:44,696 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:57:44,696 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:57:44,696 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration6_Loop [2022-07-22 11:57:44,696 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:57:44,696 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:57:44,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,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 11:57:44,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,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 11:57:44,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:57:44,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 11:57:44,804 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:57:44,805 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:57:44,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:44,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:44,806 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 11:57:44,808 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 11:57:44,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:44,815 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:44,815 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:44,815 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:44,815 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:44,815 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:44,816 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:44,816 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:44,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:44,840 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 11:57:44,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:44,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:44,841 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 11:57:44,842 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 11:57:44,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:44,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:44,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:44,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:44,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:44,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:44,853 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:44,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:44,880 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 11:57:44,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:44,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:44,881 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 11:57:44,883 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 11:57:44,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:44,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:44,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:44,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:44,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:44,894 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:44,894 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:44,913 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:44,945 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 11:57:44,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:44,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:44,946 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 11:57:44,946 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 11:57:44,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:44,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:44,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:44,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:44,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:44,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:57:44,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:57:44,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:57:44,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2022-07-22 11:57:44,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:44,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:44,982 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 11:57:44,983 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 11:57:44,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:57:44,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:57:44,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:57:44,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:57:44,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:57:44,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:57:44,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:57:44,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:57:44,993 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:57:44,997 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 11:57:44,997 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 11:57:44,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:57:44,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:57:44,998 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 11:57:44,999 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 11:57:44,999 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:57:44,999 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 11:57:44,999 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:57:45,000 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~M~0, thread1Thread1of1ForFork1_~i~0) = 1*~M~0 - 1*thread1Thread1of1ForFork1_~i~0 Supporting invariants [] [2022-07-22 11:57:45,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-22 11:57:45,025 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 11:57:45,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:45,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:57:45,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:45,102 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:57:45,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:45,147 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 11:57:45,147 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:57:45,147 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67358 states and 331333 transitions. cyclomatic complexity: 267986 Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:45,742 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 11:57:47,781 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67358 states and 331333 transitions. cyclomatic complexity: 267986. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 122582 states and 599687 transitions. Complement of second has 8 states. [2022-07-22 11:57:47,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 11:57:47,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:47,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 206 transitions. [2022-07-22 11:57:47,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 206 transitions. Stem has 34 letters. Loop has 5 letters. [2022-07-22 11:57:47,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:47,784 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 11:57:47,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:57:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:47,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:57:47,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:57:47,861 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:57:47,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:57:47,913 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 11:57:47,914 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:57:47,914 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67358 states and 331333 transitions. cyclomatic complexity: 267986 Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:52,339 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67358 states and 331333 transitions. cyclomatic complexity: 267986. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 132837 states and 658163 transitions. Complement of second has 10 states. [2022-07-22 11:57:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 11:57:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:57:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 253 transitions. [2022-07-22 11:57:52,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 253 transitions. Stem has 34 letters. Loop has 5 letters. [2022-07-22 11:57:52,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:52,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 253 transitions. Stem has 39 letters. Loop has 5 letters. [2022-07-22 11:57:52,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:52,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 253 transitions. Stem has 34 letters. Loop has 10 letters. [2022-07-22 11:57:52,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:57:52,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132837 states and 658163 transitions. [2022-07-22 11:57:56,355 INFO L131 ngComponentsAnalysis]: Automaton has 4541 accepting balls. 56445 [2022-07-22 11:57:59,275 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132837 states to 108205 states and 531883 transitions. [2022-07-22 11:57:59,276 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63449 [2022-07-22 11:57:59,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73615 [2022-07-22 11:57:59,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108205 states and 531883 transitions. [2022-07-22 11:57:59,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 11:57:59,592 INFO L220 hiAutomatonCegarLoop]: Abstraction has 108205 states and 531883 transitions. [2022-07-22 11:57:59,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108205 states and 531883 transitions. [2022-07-22 11:58:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108205 to 67353. [2022-07-22 11:58:02,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67353 states, 67353 states have (on average 4.919172122993779) internal successors, (331321), 67352 states have internal predecessors, (331321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:58:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67353 states to 67353 states and 331321 transitions. [2022-07-22 11:58:03,391 INFO L242 hiAutomatonCegarLoop]: Abstraction has 67353 states and 331321 transitions. [2022-07-22 11:58:03,391 INFO L425 stractBuchiCegarLoop]: Abstraction has 67353 states and 331321 transitions. [2022-07-22 11:58:03,391 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 11:58:03,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67353 states and 331321 transitions. [2022-07-22 11:58:04,512 INFO L131 ngComponentsAnalysis]: Automaton has 3325 accepting balls. 44125 [2022-07-22 11:58:04,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:58:04,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:58:04,514 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:58:04,514 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:58:04,515 INFO L748 eck$LassoCheckResult]: Stem: 2335856#[ULTIMATE.startENTRY]don't care [325] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2334236#[L-1]don't care [257] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 2237356#[L-1-1]don't care [332] L-1-1-->L-1-2: Formula: (= (select |v_#valid_19| 0) 0) InVars {#valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|} AuxVars[] AssignedVars[] 2237358#[L-1-2]don't care [334] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 2256032#[L21]don't care [298] L21-->L21-1: Formula: (and (= (select |v_#valid_20| 1) 1) (= 2 (select |v_#length_11| 1))) InVars {#length=|v_#length_11|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 2256034#[L21-1]don't care [321] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_13| 1) 0)) InVars {#memory_int=|v_#memory_int_13|} OutVars{#memory_int=|v_#memory_int_13|} AuxVars[] AssignedVars[] 2334462#[L21-2]don't care [261] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_14| 1) 1) 0) InVars {#memory_int=|v_#memory_int_14|} OutVars{#memory_int=|v_#memory_int_14|} AuxVars[] AssignedVars[] 2299172#[L21-3]don't care [293] L21-3-->L21-4: Formula: (and (= (select |v_#length_12| 2) 28) (= (select |v_#valid_21| 2) 1)) InVars {#length=|v_#length_12|, #valid=|v_#valid_21|} OutVars{#length=|v_#length_12|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[] 2299174#[L21-4]don't care [275] L21-4-->L38: Formula: (= v_~M~0_6 0) InVars {} OutVars{~M~0=v_~M~0_6} AuxVars[] AssignedVars[~M~0] 2330350#[L38]don't care [276] L38-->L38-1: Formula: (= v_~N~0_6 0) InVars {} OutVars{~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 2330352#[L38-1]don't care [294] L38-1-->L38-2: Formula: (= v_~counter1~0_7 0) InVars {} OutVars{~counter1~0=v_~counter1~0_7} AuxVars[] AssignedVars[~counter1~0] 2334190#[L38-2]don't care [331] L38-2-->L-1-3: Formula: (= v_~counter2~0_7 0) InVars {} OutVars{~counter2~0=v_~counter2~0_7} AuxVars[] AssignedVars[~counter2~0] 2330780#[L-1-3]don't care [336] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2330782#[L-1-4]don't care [259] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2277620#[L-1-5]don't care [235] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 2260904#[L-1-6]don't care [314] L-1-6-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_4|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_3|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_3|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_6|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_~#t2~0#1.base] 2260906#[L83]don't care [240] L83-->L83-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_22|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_13|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (select |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, #valid=|v_#valid_23|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_22|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 2298000#[L83-1]don't care [278] L83-1-->L83-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_15|) (= (store |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_24|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, #valid=|v_#valid_25|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 2331240#[L83-2]don't care [316] L83-2-->L83-3: Formula: (and (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0)) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_18|, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 2331242#[L83-3]don't care [320] L83-3-->L83-4: Formula: (and (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_1| 0)) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 4) |v_#length_1|) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_1| 0) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) 0) (= (store |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 1) |v_#valid_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 2303374#[L83-4]don't care [277] L83-4-->L85: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_1| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[~M~0] 2303376#[L85]don't care [254] L85-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 2331794#[L86]don't care [219] L86-->L86-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_1| v_~N~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 2336006#[L86-1]don't care [286] L86-1-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 2316110#[L89]don't care [283] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 2316112#[L89-1]don't care [265] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 2335348#[L89-2]don't care [291] L89-2-->L89-3: Formula: (and (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre11#1_2|)) |v_#memory_int_1|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|))) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 2322160#[L89-3]don't care [385] L89-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 2291202#[L89-4, thread1ENTRY]don't care [340] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 2291204#[L89-4, L41-4]don't care [317] L89-4-->L89-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 2283628#[L41-4, L89-5]don't care [330] L89-5-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] 2283636#[L41-4, L90]don't care [329] L90-->L90-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 2329178#[L41-4, L90-1]don't care [241] L90-1-->L90-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 2329180#[L90-2, L41-4]don't care [247] L90-2-->L90-3: Formula: (and (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre13#1_2|)) |v_#memory_int_3|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_4|, #memory_int=|v_#memory_int_4|, #length=|v_#length_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_4|, #memory_int=|v_#memory_int_3|, #length=|v_#length_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] 2334186#[L90-3, L41-4]don't care [391] L90-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar2_2 0) (= v_thread2Thread1of1ForFork3_thidvar1_2 0) (= v_thread2Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_4|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_8|, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_2, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_4|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_12|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_#t~post3#1, thread2Thread1of1ForFork3_thidvar2, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base] 2334188#[L41-4, L90-4, thread2ENTRY]don't care [2022-07-22 11:58:04,518 INFO L750 eck$LassoCheckResult]: Loop: 2334188#[L41-4, L90-4, thread2ENTRY]don't care [343] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork1_~i~0_5 v_~M~0_2) InVars {~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} OutVars{~M~0=v_~M~0_2, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_5} AuxVars[] AssignedVars[] 2341678#[thread2ENTRY, L42, L90-4]don't care [345] L42-->L44: Formula: (= (+ v_~counter1~0_13 1) v_~counter1~0_12) InVars {~counter1~0=v_~counter1~0_13} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~counter1~0=v_~counter1~0_12} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~counter1~0] 2341672#[L44, L90-4, thread2ENTRY]don't care [347] L44-->L41-2: Formula: (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_thread1Thread1of1ForFork1_~i~0_7) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_7, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 2341674#[L41-2, L90-4, thread2ENTRY]don't care [348] L41-2-->L41-3: Formula: (= v_thread1Thread1of1ForFork1_~i~0_9 (+ |v_thread1Thread1of1ForFork1_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_9, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] 2348930#[L41-3, L90-4, thread2ENTRY]don't care [349] L41-3-->L41-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1] 2334188#[L41-4, L90-4, thread2ENTRY]don't care [2022-07-22 11:58:04,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:04,518 INFO L85 PathProgramCache]: Analyzing trace with hash 39200313, now seen corresponding path program 1 times [2022-07-22 11:58:04,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:58:04,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378886740] [2022-07-22 11:58:04,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:58:04,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:58:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:04,541 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:58:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:04,556 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:58:04,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:04,557 INFO L85 PathProgramCache]: Analyzing trace with hash 356019353, now seen corresponding path program 7 times [2022-07-22 11:58:04,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:58:04,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879103474] [2022-07-22 11:58:04,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:58:04,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:58:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:04,561 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:58:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:04,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:58:04,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:04,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1348036961, now seen corresponding path program 1 times [2022-07-22 11:58:04,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:58:04,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531484065] [2022-07-22 11:58:04,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:58:04,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:58:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:04,581 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:58:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:04,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:58:04,621 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:58:04,622 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:58:04,622 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:58:04,622 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:58:04,622 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 11:58:04,622 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:04,622 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:58:04,622 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:58:04,622 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration7_Loop [2022-07-22 11:58:04,622 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:58:04,622 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:58:04,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,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 11:58:04,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,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 11:58:04,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,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 11:58:04,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,727 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:58:04,727 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 11:58:04,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:04,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:04,733 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 11:58:04,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:58:04,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:58:04,754 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 11:58:04,797 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 11:58:04,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:04,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:04,798 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 11:58:04,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 11:58:04,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:58:04,814 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 11:58:04,943 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 11:58:04,946 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 11:58:04,946 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:58:04,946 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:58:04,946 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:58:04,946 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:58:04,946 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:58:04,946 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:04,946 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:58:04,946 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:58:04,947 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration7_Loop [2022-07-22 11:58:04,947 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:58:04,947 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:58:04,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,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 11:58:04,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 11:58:04,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:04,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 11:58:04,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 11:58:05,055 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:58:05,055 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:58:05,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:05,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:05,057 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 11:58:05,058 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 11:58:05,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:58:05,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:58:05,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:58:05,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:58:05,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:58:05,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 11:58:05,067 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 11:58:05,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 11:58:05,093 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 11:58:05,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:05,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:05,095 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 11:58:05,097 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 11:58:05,097 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:58:05,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:58:05,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:58:05,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:58:05,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:58:05,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:58:05,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:58:05,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:58:05,106 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:58:05,114 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 11:58:05,114 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 11:58:05,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:05,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:05,116 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 11:58:05,117 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 11:58:05,117 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:58:05,117 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 11:58:05,118 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:58:05,118 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~M~0, thread1Thread1of1ForFork1_~i~0) = 1*~M~0 - 1*thread1Thread1of1ForFork1_~i~0 Supporting invariants [] [2022-07-22 11:58:05,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-07-22 11:58:05,140 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 11:58:05,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:58:05,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:58:05,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:58:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:58:05,216 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:58:05,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:58:05,259 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 11:58:05,260 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:58:05,260 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67353 states and 331321 transitions. cyclomatic complexity: 267978 Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:58:06,662 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 11:58:08,053 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67353 states and 331321 transitions. cyclomatic complexity: 267978. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 122573 states and 599701 transitions. Complement of second has 8 states. [2022-07-22 11:58:08,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 11:58:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:58:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2022-07-22 11:58:08,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 204 transitions. Stem has 35 letters. Loop has 5 letters. [2022-07-22 11:58:08,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:58:08,055 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 11:58:08,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:58:08,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:58:08,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:58:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:58:08,126 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:58:08,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:58:08,165 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 11:58:08,166 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:58:08,166 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67353 states and 331321 transitions. cyclomatic complexity: 267978 Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:58:10,818 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67353 states and 331321 transitions. cyclomatic complexity: 267978. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 132824 states and 658156 transitions. Complement of second has 10 states. [2022-07-22 11:58:10,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 11:58:10,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:58:10,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 250 transitions. [2022-07-22 11:58:10,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 250 transitions. Stem has 35 letters. Loop has 5 letters. [2022-07-22 11:58:10,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:58:10,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 250 transitions. Stem has 40 letters. Loop has 5 letters. [2022-07-22 11:58:10,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:58:10,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 250 transitions. Stem has 35 letters. Loop has 10 letters. [2022-07-22 11:58:10,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:58:10,820 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132824 states and 658156 transitions. [2022-07-22 11:58:14,962 INFO L131 ngComponentsAnalysis]: Automaton has 4540 accepting balls. 56440 [2022-07-22 11:58:17,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132824 states to 108195 states and 531882 transitions. [2022-07-22 11:58:17,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63440 [2022-07-22 11:58:18,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73610 [2022-07-22 11:58:18,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108195 states and 531882 transitions. [2022-07-22 11:58:18,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 11:58:18,349 INFO L220 hiAutomatonCegarLoop]: Abstraction has 108195 states and 531882 transitions. [2022-07-22 11:58:18,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108195 states and 531882 transitions. [2022-07-22 11:58:22,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108195 to 67348. [2022-07-22 11:58:22,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67348 states, 67348 states have (on average 4.91928490823781) internal successors, (331304), 67347 states have internal predecessors, (331304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:58:23,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67348 states to 67348 states and 331304 transitions. [2022-07-22 11:58:23,715 INFO L242 hiAutomatonCegarLoop]: Abstraction has 67348 states and 331304 transitions. [2022-07-22 11:58:23,716 INFO L425 stractBuchiCegarLoop]: Abstraction has 67348 states and 331304 transitions. [2022-07-22 11:58:23,716 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 11:58:23,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67348 states and 331304 transitions. [2022-07-22 11:58:25,457 INFO L131 ngComponentsAnalysis]: Automaton has 3324 accepting balls. 44120 [2022-07-22 11:58:25,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 11:58:25,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 11:58:25,463 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 11:58:25,463 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 11:58:25,466 INFO L748 eck$LassoCheckResult]: Stem: 2726240#[ULTIMATE.startENTRY]don't care [325] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2724622#[L-1]don't care [257] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 2627742#[L-1-1]don't care [332] L-1-1-->L-1-2: Formula: (= (select |v_#valid_19| 0) 0) InVars {#valid=|v_#valid_19|} OutVars{#valid=|v_#valid_19|} AuxVars[] AssignedVars[] 2627744#[L-1-2]don't care [334] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_2|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|} AuxVars[] AssignedVars[] 2646418#[L21]don't care [298] L21-->L21-1: Formula: (and (= (select |v_#valid_20| 1) 1) (= 2 (select |v_#length_11| 1))) InVars {#length=|v_#length_11|, #valid=|v_#valid_20|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_20|} AuxVars[] AssignedVars[] 2646420#[L21-1]don't care [321] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_13| 1) 0)) InVars {#memory_int=|v_#memory_int_13|} OutVars{#memory_int=|v_#memory_int_13|} AuxVars[] AssignedVars[] 2724848#[L21-2]don't care [261] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_14| 1) 1) 0) InVars {#memory_int=|v_#memory_int_14|} OutVars{#memory_int=|v_#memory_int_14|} AuxVars[] AssignedVars[] 2689558#[L21-3]don't care [293] L21-3-->L21-4: Formula: (and (= (select |v_#length_12| 2) 28) (= (select |v_#valid_21| 2) 1)) InVars {#length=|v_#length_12|, #valid=|v_#valid_21|} OutVars{#length=|v_#length_12|, #valid=|v_#valid_21|} AuxVars[] AssignedVars[] 2689560#[L21-4]don't care [275] L21-4-->L38: Formula: (= v_~M~0_6 0) InVars {} OutVars{~M~0=v_~M~0_6} AuxVars[] AssignedVars[~M~0] 2720736#[L38]don't care [276] L38-->L38-1: Formula: (= v_~N~0_6 0) InVars {} OutVars{~N~0=v_~N~0_6} AuxVars[] AssignedVars[~N~0] 2720738#[L38-1]don't care [294] L38-1-->L38-2: Formula: (= v_~counter1~0_7 0) InVars {} OutVars{~counter1~0=v_~counter1~0_7} AuxVars[] AssignedVars[~counter1~0] 2724572#[L38-2]don't care [331] L38-2-->L-1-3: Formula: (= v_~counter2~0_7 0) InVars {} OutVars{~counter2~0=v_~counter2~0_7} AuxVars[] AssignedVars[~counter2~0] 2721166#[L-1-3]don't care [336] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2721168#[L-1-4]don't care [259] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] 2668006#[L-1-5]don't care [235] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 2651290#[L-1-6]don't care [314] L-1-6-->L83: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_4|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_4|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|, ULTIMATE.start_main_#t~mem19#1=|v_ULTIMATE.start_main_#t~mem19#1_3|, ULTIMATE.start_main_#t~mem20#1=|v_ULTIMATE.start_main_#t~mem20#1_3|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_6|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_6|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_#t~mem21#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~mem19#1, ULTIMATE.start_main_#t~mem20#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base, ULTIMATE.start_main_#t~mem22#1, ULTIMATE.start_main_~#t2~0#1.base] 2651292#[L83]don't care [240] L83-->L83-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_6| 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_6| 0)) (= (store |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 1) |v_#valid_22|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1~0#1.base_6| 4) |v_#length_13|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) (= (select |v_#valid_23| |v_ULTIMATE.start_main_~#t1~0#1.base_6|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_14|, #valid=|v_#valid_23|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_6|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_6|, #valid=|v_#valid_22|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 2688386#[L83-1]don't care [278] L83-1-->L83-2: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_6| 0)) (= (select |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) 0) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t2~0#1.base_6|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 4) |v_#length_15|) (= (store |v_#valid_25| |v_ULTIMATE.start_main_~#t2~0#1.base_6| 1) |v_#valid_24|) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_6|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_16|, #valid=|v_#valid_25|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_6|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_6|, #valid=|v_#valid_24|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 2721626#[L83-2]don't care [316] L83-2-->L83-3: Formula: (and (= |v_ULTIMATE.start_main_~#t3~0#1.offset_6| 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_6| 0)) (= |v_#valid_26| (store |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 1)) (= (select |v_#valid_27| |v_ULTIMATE.start_main_~#t3~0#1.base_6|) 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t3~0#1.base_6| 4) |v_#length_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_18|, #valid=|v_#valid_27|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_6|, #StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_6|, #valid=|v_#valid_26|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 2721628#[L83-3]don't care [320] L83-3-->L83-4: Formula: (and (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_1| 0)) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 4) |v_#length_1|) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_1| 0) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1|) 0) (= (store |v_#valid_2| |v_ULTIMATE.start_main_~#t4~0#1.base_1| 1) |v_#valid_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 2693764#[L83-4]don't care [277] L83-4-->L85: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_1| v_~M~0_5) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} OutVars{~M~0=v_~M~0_5, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|} AuxVars[] AssignedVars[~M~0] 2693766#[L85]don't care [254] L85-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 2722180#[L86]don't care [219] L86-->L86-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_1| v_~N~0_5) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ~N~0=v_~N~0_5} AuxVars[] AssignedVars[~N~0] 2726390#[L86-1]don't care [286] L86-1-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 2706500#[L89]don't care [283] L89-->L89-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 2706502#[L89-1]don't care [265] L89-1-->L89-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 2725732#[L89-2]don't care [291] L89-2-->L89-3: Formula: (and (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre11#1_2|)) |v_#memory_int_1|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_3| |v_ULTIMATE.start_main_~#t1~0#1.base_1|))) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_1|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] 2712546#[L89-3]don't care [385] L89-3-->thread1ENTRY: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_6|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 2681588#[L89-4, thread1ENTRY]don't care [317] L89-4-->L89-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1] 2681592#[L89-5, thread1ENTRY]don't care [330] L89-5-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] 2727580#[L90, thread1ENTRY]don't care [329] L90-->L90-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 2662348#[L90-1, thread1ENTRY]don't care [241] L90-1-->L90-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 2662350#[L90-2, thread1ENTRY]don't care [247] L90-2-->L90-3: Formula: (and (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre13#1_2|)) |v_#memory_int_3|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_4|, #memory_int=|v_#memory_int_4|, #length=|v_#length_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_4|, #memory_int=|v_#memory_int_3|, #length=|v_#length_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] 2723694#[L90-3, thread1ENTRY]don't care [391] L90-3-->thread2ENTRY: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar2_2 0) (= v_thread2Thread1of1ForFork3_thidvar1_2 0) (= v_thread2Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_6|)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_4|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_4|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_6|, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_8|, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_2, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_4|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_12|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork3_#res#1.base=|v_thread2Thread1of1ForFork3_#res#1.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_thidvar0, thread2Thread1of1ForFork3_thidvar1, thread2Thread1of1ForFork3_#t~post3#1, thread2Thread1of1ForFork3_thidvar2, thread2Thread1of1ForFork3_#res#1.offset, thread2Thread1of1ForFork3_~i~1#1, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base] 2721088#[thread1ENTRY, L90-4, thread2ENTRY]don't care [350] thread2ENTRY-->L51-4: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1] 2700730#[L51-4, thread1ENTRY, L90-4]don't care [2022-07-22 11:58:25,467 INFO L750 eck$LassoCheckResult]: Loop: 2700730#[L51-4, thread1ENTRY, L90-4]don't care [353] L51-4-->L52: Formula: (< |v_thread2Thread1of1ForFork3_~i~1#1_5| v_~N~0_2) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_2} OutVars{thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_5|, ~N~0=v_~N~0_2} AuxVars[] AssignedVars[] 2641498#[L52, thread1ENTRY, L90-4]don't care [355] L52-->L55: Formula: (and (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~counter1~0_39 (+ v_~counter1~0_38 1)) (= (ite (< 0 v_~counter1~0_39) 1 0) |v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (not (= |v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0))) InVars {~counter1~0=v_~counter1~0_39} OutVars{thread2Thread1of1ForFork3_#t~post4#1=|v_thread2Thread1of1ForFork3_#t~post4#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~counter1~0=v_~counter1~0_38} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, ~counter1~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1] 2641500#[L55, thread1ENTRY, L90-4]don't care [357] L55-->L51-2: Formula: (= |v_thread2Thread1of1ForFork3_#t~post3#1_1| |v_thread2Thread1of1ForFork3_~i~1#1_7|) InVars {thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_7|} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1] 2701538#[L51-2, thread1ENTRY, L90-4]don't care [358] L51-2-->L51-3: Formula: (= |v_thread2Thread1of1ForFork3_~i~1#1_9| (+ |v_thread2Thread1of1ForFork3_#t~post3#1_3| 1)) InVars {thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_3|} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_3|, thread2Thread1of1ForFork3_~i~1#1=|v_thread2Thread1of1ForFork3_~i~1#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_~i~1#1] 2700728#[L51-3, thread1ENTRY, L90-4]don't care [359] L51-3-->L51-4: Formula: true InVars {} OutVars{thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_5|} AuxVars[] AssignedVars[thread2Thread1of1ForFork3_#t~post3#1] 2700730#[L51-4, thread1ENTRY, L90-4]don't care [2022-07-22 11:58:25,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:25,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1470096153, now seen corresponding path program 1 times [2022-07-22 11:58:25,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:58:25,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873792902] [2022-07-22 11:58:25,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:58:25,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:58:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:25,512 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:58:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:25,545 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:58:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:25,548 INFO L85 PathProgramCache]: Analyzing trace with hash 365562403, now seen corresponding path program 1 times [2022-07-22 11:58:25,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:58:25,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179822949] [2022-07-22 11:58:25,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:58:25,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:58:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:25,558 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 11:58:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 11:58:25,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 11:58:25,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:25,567 INFO L85 PathProgramCache]: Analyzing trace with hash 781473291, now seen corresponding path program 1 times [2022-07-22 11:58:25,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 11:58:25,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830143586] [2022-07-22 11:58:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 11:58:25,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 11:58:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:58:25,677 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 11:58:25,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 11:58:25,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830143586] [2022-07-22 11:58:25,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830143586] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 11:58:25,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 11:58:25,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 11:58:25,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973530972] [2022-07-22 11:58:25,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 11:58:25,754 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:58:25,754 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:58:25,754 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:58:25,754 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:58:25,754 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 11:58:25,755 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:25,755 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:58:25,755 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:58:25,755 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration8_Loop [2022-07-22 11:58:25,755 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:58:25,755 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:58:25,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:25,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:25,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:25,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:25,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:25,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 11:58:25,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:25,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:25,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:25,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 11:58:25,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:25,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:25,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:25,904 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:58:25,904 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 11:58:25,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:25,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:25,925 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 11:58:25,965 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 11:58:25,965 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 11:58:25,967 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:58:26,030 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 11:58:26,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:26,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:26,031 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 11:58:26,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 11:58:26,035 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 11:58:26,050 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 11:58:26,251 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 11:58:26,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-07-22 11:58:26,254 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 11:58:26,254 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 11:58:26,254 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 11:58:26,254 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 11:58:26,254 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 11:58:26,254 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:26,255 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 11:58:26,255 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 11:58:26,255 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-difference-det.wvr.c_BEv2_Iteration8_Loop [2022-07-22 11:58:26,255 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 11:58:26,255 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 11:58:26,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:26,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:26,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:26,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 11:58:26,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 11:58:26,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 11:58:26,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:26,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:26,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:26,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:26,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:26,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:26,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 11:58:26,372 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 11:58:26,373 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 11:58:26,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:26,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:26,374 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 11:58:26,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 11:58:26,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 11:58:26,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 11:58:26,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 11:58:26,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 11:58:26,385 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 11:58:26,386 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 11:58:26,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 11:58:26,389 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 11:58:26,397 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 11:58:26,401 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 11:58:26,401 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 11:58:26,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 11:58:26,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 11:58:26,403 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 11:58:26,404 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 11:58:26,405 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 11:58:26,405 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 11:58:26,405 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, thread2Thread1of1ForFork3_~i~1#1) = 1*~N~0 - 1*thread2Thread1of1ForFork3_~i~1#1 Supporting invariants [] [2022-07-22 11:58:26,420 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 11:58:26,441 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 11:58:26,442 INFO L257 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 11:58:26,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:58:26,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:58:26,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:58:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:58:26,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:58:26,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:58:26,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 11:58:26,573 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:58:26,574 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67348 states and 331304 transitions. cyclomatic complexity: 267965 Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:58:27,576 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 11:58:31,105 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67348 states and 331304 transitions. cyclomatic complexity: 267965. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 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 187160 states and 926833 transitions. Complement of second has 8 states. [2022-07-22 11:58:31,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 11:58:31,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 11:58:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2022-07-22 11:58:31,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 250 transitions. Stem has 35 letters. Loop has 5 letters. [2022-07-22 11:58:31,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 11:58:31,106 INFO L690 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-07-22 11:58:31,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 11:58:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:58:31,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 11:58:31,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:58:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 11:58:31,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 11:58:31,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 11:58:31,223 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 11:58:31,224 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-22 11:58:31,224 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67348 states and 331304 transitions. cyclomatic complexity: 267965 Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2022-07-22 11:58:34,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 11:58:34 BoogieIcfgContainer [2022-07-22 11:58:34,051 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 11:58:34,051 INFO L158 Benchmark]: Toolchain (without parser) took 161920.17ms. Allocated memory was 152.0MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 127.0MB in the beginning and 5.3GB in the end (delta: -5.1GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-07-22 11:58:34,055 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 152.0MB. Free memory was 123.0MB in the beginning and 123.0MB in the end (delta: 81.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 11:58:34,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.26ms. Allocated memory is still 152.0MB. Free memory was 126.8MB in the beginning and 115.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-07-22 11:58:34,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.68ms. Allocated memory is still 152.0MB. Free memory was 115.9MB in the beginning and 114.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-22 11:58:34,056 INFO L158 Benchmark]: Boogie Preprocessor took 39.78ms. Allocated memory is still 152.0MB. Free memory was 114.1MB in the beginning and 112.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 11:58:34,056 INFO L158 Benchmark]: RCFGBuilder took 798.21ms. Allocated memory is still 152.0MB. Free memory was 112.6MB in the beginning and 129.6MB in the end (delta: -16.9MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2022-07-22 11:58:34,060 INFO L158 Benchmark]: BuchiAutomizer took 160651.65ms. Allocated memory was 152.0MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 129.6MB in the beginning and 5.3GB in the end (delta: -5.1GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. [2022-07-22 11:58:34,062 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-07-22 11:58:34,066 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 152.0MB. Free memory was 123.0MB in the beginning and 123.0MB in the end (delta: 81.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 367.26ms. Allocated memory is still 152.0MB. Free memory was 126.8MB in the beginning and 115.9MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.68ms. Allocated memory is still 152.0MB. Free memory was 115.9MB in the beginning and 114.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.78ms. Allocated memory is still 152.0MB. Free memory was 114.1MB in the beginning and 112.8MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 798.21ms. Allocated memory is still 152.0MB. Free memory was 112.6MB in the beginning and 129.6MB in the end (delta: -16.9MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 160651.65ms. Allocated memory was 152.0MB in the beginning and 8.0GB in the end (delta: 7.8GB). Free memory was 129.6MB in the beginning and 5.3GB in the end (delta: -5.1GB). Peak memory consumption was 3.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Decomposition not yet finished - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 160.4s and 8 iterations. TraceHistogramMax:1. Analysis of lassos took 9.6s. Construction of modules took 1.2s. Büchi inclusion checks took 51.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 34.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 255394 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 47.8s Buchi closure took 2.4s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 7, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2831 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2816 mSDsluCounter, 5970 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4381 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1588 IncrementalHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 2244 mSDtfsCounter, 1588 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT7 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax405 hnf100 lsp15 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 52ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 22 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.7s InitialAbstractionConstructionTime: 0.1s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while BuchiAutomatonCegarLoop was applying stage 1,while ReachableStatesComputation was computing reachable states (130679 states constructed, input type BuchiIntersectNwa). RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown