/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations false --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check true -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 01:27:16,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 01:27:16,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 01:27:16,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 01:27:16,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 01:27:16,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 01:27:16,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 01:27:16,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 01:27:16,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 01:27:16,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 01:27:16,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 01:27:16,626 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 01:27:16,627 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 01:27:16,627 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 01:27:16,627 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 01:27:16,627 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 01:27:16,627 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 01:27:16,628 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 01:27:16,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 01:27:16,628 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 01:27:16,631 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 01:27:16,631 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 01:27:16,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 01:27:16,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 01:27:16,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 01:27:16,632 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 01:27:16,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 01:27:16,633 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 01:27:16,633 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 01:27:16,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 01:27:16,633 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 01:27:16,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 01:27:16,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 01:27:16,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 01:27:16,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 01:27:16,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 01:27:16,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 01:27:16,635 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 01:27:16,638 INFO L153 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> true [2024-02-10 01:27:16,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 01:27:17,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 01:27:17,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 01:27:17,019 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-10 01:27:17,019 INFO L274 PluginConnector]: CDTParser initialized [2024-02-10 01:27:17,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-02-10 01:27:18,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-10 01:27:18,815 INFO L384 CDTParser]: Found 1 translation units. [2024-02-10 01:27:18,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-02-10 01:27:18,845 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73d9c89fe/f554a618067743a39d838e729c022e2c/FLAGc0bdeb8cb [2024-02-10 01:27:19,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73d9c89fe/f554a618067743a39d838e729c022e2c [2024-02-10 01:27:19,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 01:27:19,123 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-10 01:27:19,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-10 01:27:19,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-10 01:27:19,136 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-10 01:27:19,147 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 01:27:19" (1/1) ... [2024-02-10 01:27:19,148 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49d9865d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:27:19, skipping insertion in model container [2024-02-10 01:27:19,148 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.02 01:27:19" (1/1) ... [2024-02-10 01:27:19,175 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-10 01:27:19,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 01:27:19,486 INFO L202 MainTranslator]: Completed pre-run [2024-02-10 01:27:19,538 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-10 01:27:19,549 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 01:27:19,549 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-10 01:27:19,557 INFO L206 MainTranslator]: Completed translation [2024-02-10 01:27:19,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:27:19 WrapperNode [2024-02-10 01:27:19,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-10 01:27:19,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 01:27:19,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 01:27:19,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 01:27:19,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:27:19" (1/1) ... [2024-02-10 01:27:19,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:27:19" (1/1) ... [2024-02-10 01:27:19,633 INFO L138 Inliner]: procedures = 22, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 134 [2024-02-10 01:27:19,646 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 01:27:19,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 01:27:19,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 01:27:19,647 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 01:27:19,655 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:27:19" (1/1) ... [2024-02-10 01:27:19,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:27:19" (1/1) ... [2024-02-10 01:27:19,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:27:19" (1/1) ... [2024-02-10 01:27:19,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:27:19" (1/1) ... [2024-02-10 01:27:19,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:27:19" (1/1) ... [2024-02-10 01:27:19,683 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:27:19" (1/1) ... [2024-02-10 01:27:19,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:27:19" (1/1) ... [2024-02-10 01:27:19,694 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:27:19" (1/1) ... [2024-02-10 01:27:19,697 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 01:27:19,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 01:27:19,710 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 01:27:19,710 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 01:27:19,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:27:19" (1/1) ... [2024-02-10 01:27:19,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:19,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:19,764 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) [2024-02-10 01:27:19,796 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 [2024-02-10 01:27:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-10 01:27:19,832 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-10 01:27:19,832 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-10 01:27:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-10 01:27:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-10 01:27:19,833 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-10 01:27:19,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-10 01:27:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-10 01:27:19,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-10 01:27:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-10 01:27:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-10 01:27:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-10 01:27:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-10 01:27:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-10 01:27:19,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 01:27:19,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 01:27:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-10 01:27:19,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-10 01:27:19,837 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 01:27:19,979 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 01:27:19,980 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 01:27:20,374 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 01:27:20,525 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 01:27:20,525 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-10 01:27:20,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:27:20 BoogieIcfgContainer [2024-02-10 01:27:20,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 01:27:20,532 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 01:27:20,532 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 01:27:20,535 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 01:27:20,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:27:20,536 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.02 01:27:19" (1/3) ... [2024-02-10 01:27:20,538 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f8e6ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:27:20, skipping insertion in model container [2024-02-10 01:27:20,538 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:27:20,539 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.02 01:27:19" (2/3) ... [2024-02-10 01:27:20,552 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f8e6ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 01:27:20, skipping insertion in model container [2024-02-10 01:27:20,552 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 01:27:20,553 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 01:27:20" (3/3) ... [2024-02-10 01:27:20,554 INFO L332 chiAutomizerObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2024-02-10 01:27:20,681 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-10 01:27:20,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 133 transitions, 294 flow [2024-02-10 01:27:20,837 INFO L124 PetriNetUnfolderBase]: 10/125 cut-off events. [2024-02-10 01:27:20,837 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-10 01:27:20,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 125 events. 10/125 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2024-02-10 01:27:20,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 133 transitions, 294 flow [2024-02-10 01:27:20,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 125 transitions, 274 flow [2024-02-10 01:27:20,855 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 01:27:20,855 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 01:27:20,855 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 01:27:20,855 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 01:27:20,855 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 01:27:20,855 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 01:27:20,855 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 01:27:20,855 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 01:27:20,855 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:27:20,856 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 128 places, 125 transitions, 274 flow [2024-02-10 01:27:21,028 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 3964 states, 3963 states have (on average 5.042896795357053) internal successors, (19985), 3963 states have internal predecessors, (19985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:27:21,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3964 states, 3963 states have (on average 5.042896795357053) internal successors, (19985), 3963 states have internal predecessors, (19985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:27:21,263 INFO L131 ngComponentsAnalysis]: Automaton has 1105 accepting balls. 3220 [2024-02-10 01:27:21,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:27:21,264 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:27:21,274 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 01:27:21,274 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:27:21,274 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 128 places, 125 transitions, 274 flow [2024-02-10 01:27:21,364 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 3964 states, 3963 states have (on average 5.042896795357053) internal successors, (19985), 3963 states have internal predecessors, (19985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:27:21,380 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3964 states, 3963 states have (on average 5.042896795357053) internal successors, (19985), 3963 states have internal predecessors, (19985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:27:21,529 INFO L131 ngComponentsAnalysis]: Automaton has 1105 accepting balls. 3220 [2024-02-10 01:27:21,529 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:27:21,529 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:27:21,538 INFO L748 eck$LassoCheckResult]: Stem: Black: 8065#[$Ultimate##0]don't care [272] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 8068#[L-1]don't care [277] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 8070#[L21]don't care [326] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 8072#[L21-1]don't care [352] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 8074#[L21-2]don't care [283] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 8076#[L21-3]don't care [317] L21-3-->L21-4: Formula: (and (= 43 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 8078#[L21-4]don't care [298] L21-4-->L37: Formula: (= v_~i1~0_5 0) InVars {} OutVars{~i1~0=v_~i1~0_5} AuxVars[] AssignedVars[~i1~0] 8080#[L37]don't care [292] L37-->L37-1: Formula: (= v_~i2~0_5 0) InVars {} OutVars{~i2~0=v_~i2~0_5} AuxVars[] AssignedVars[~i2~0] 8082#[L37-1]don't care [293] L37-1-->L37-2: Formula: (= 0 v_~N1~0_3) InVars {} OutVars{~N1~0=v_~N1~0_3} AuxVars[] AssignedVars[~N1~0] 8084#[L37-2]don't care [254] L37-2-->L37-3: Formula: (= 0 v_~N2~0_3) InVars {} OutVars{~N2~0=v_~N2~0_3} AuxVars[] AssignedVars[~N2~0] 8086#[L37-3]don't care [273] L37-3-->L37-4: Formula: (= v_~counter~0_11 0) InVars {} OutVars{~counter~0=v_~counter~0_11} AuxVars[] AssignedVars[~counter~0] 8088#[L37-4]don't care [345] L37-4-->L37-5: Formula: (= v_~j1~0_5 0) InVars {} OutVars{~j1~0=v_~j1~0_5} AuxVars[] AssignedVars[~j1~0] 8090#[L37-5]don't care [309] L37-5-->L37-6: Formula: (= v_~j2~0_5 0) InVars {} OutVars{~j2~0=v_~j2~0_5} AuxVars[] AssignedVars[~j2~0] 8092#[L37-6]don't care [301] L37-6-->L37-7: Formula: (= 0 v_~M1~0_3) InVars {} OutVars{~M1~0=v_~M1~0_3} AuxVars[] AssignedVars[~M1~0] 8094#[L37-7]don't care [318] L37-7-->L-1-1: Formula: (= 0 v_~M2~0_3) InVars {} OutVars{~M2~0=v_~M2~0_3} AuxVars[] AssignedVars[~M2~0] 8096#[L-1-1]don't care [359] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 8098#[L-1-2]don't care [361] L-1-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem23#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre15#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~pre19#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet20#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, ULTIMATE.start_main_#t~mem24#1] 8100#[L86]don't care [249] L86-->L86-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 8102#[L86-1]don't care [307] L86-1-->L86-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 8104#[L86-2]don't care [372] L86-2-->L86-3: Formula: (and (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (store |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1) |v_#valid_8|) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_7|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 8106#[L86-3]don't care [286] L86-3-->L86-4: Formula: (and (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 1) |v_#valid_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_2| 0)) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2|) 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_2|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_2|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] 8108#[L86-4]don't care [264] L86-4-->L88: 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] 8110#[L88]don't care [325] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~N1~0_4) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~N1~0=v_~N1~0_4} AuxVars[] AssignedVars[~N1~0] 8112#[L88-1]don't care [351] L88-1-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] 8114#[L89]don't care [304] L89-->L89-1: 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] 8116#[L89-1]don't care [285] L89-1-->L89-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~N2~0_4) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ~N2~0=v_~N2~0_4} AuxVars[] AssignedVars[~N2~0] 8118#[L89-2]don't care [312] L89-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] 8120#[L90]don't care [356] L90-->L90-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 8122#[L90-1]don't care [262] L90-1-->L90-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~M1~0_4) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~M1~0=v_~M1~0_4} AuxVars[] AssignedVars[~M1~0] 8124#[L90-2]don't care [274] L90-2-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] 8126#[L91]don't care [263] L91-->L91-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] 8128#[L91-1]don't care [275] L91-1-->L91-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet12#1_3| v_~M2~0_4) InVars {ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|} OutVars{~M2~0=v_~M2~0_4, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|} AuxVars[] AssignedVars[~M2~0] 8130#[L91-2]don't care [302] L91-2-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] 8132#[L92]don't care [346] L92-->L92-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~M1~0_5 v_~N1~0_5) (= v_~M2~0_5 v_~N1~0_5) (= v_~N1~0_5 v_~N2~0_5)) 1 0)) InVars {~M1~0=v_~M1~0_5, ~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5, ~M2~0=v_~M2~0_5} OutVars{~M1~0=v_~M1~0_5, ~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5, ~M2~0=v_~M2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 8134#[L92-1]don't care [338] L92-1-->L33: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 8136#[L33]don't care [260] L33-->L34: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 8138#[L34]don't care [271] L34-->L33-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 8142#[L33-1]don't care [288] L33-1-->L92-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 8144#[L92-2]don't care [296] L92-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 8146#[L95]don't care [320] L95-->L95-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] 8148#[L95-1]don't care [334] L95-1-->L95-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 8150#[L95-2]don't care [335] L95-2-->L95-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre13#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 8152#[L95-3]don't care [402] L95-3-->L44: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_7|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_4|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, 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_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] 8154#[L95-4, L44]don't care [2024-02-10 01:27:21,540 INFO L750 eck$LassoCheckResult]: Loop: 8154#[L95-4, L44]don't care [373] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[] 8158#[L95-4, L41]don't care [376] L41-->L44: Formula: (and (= (+ v_~counter~0_52 1) v_~counter~0_51) (= v_~i1~0_14 (+ v_~i1~0_15 1))) InVars {~counter~0=v_~counter~0_52, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_51, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0] 8154#[L95-4, L44]don't care [2024-02-10 01:27:21,549 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:27:21,549 INFO L85 PathProgramCache]: Analyzing trace with hash 946216358, now seen corresponding path program 1 times [2024-02-10 01:27:21,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:27:21,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936895604] [2024-02-10 01:27:21,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:27:21,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:27:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:27:21,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:27:21,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:27:21,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:27:21,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:27:21,721 INFO L85 PathProgramCache]: Analyzing trace with hash 12900, now seen corresponding path program 1 times [2024-02-10 01:27:21,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:27:21,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575151596] [2024-02-10 01:27:21,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:27:21,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:27:21,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:27:21,729 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:27:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:27:21,733 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:27:21,734 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:27:21,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1219134775, now seen corresponding path program 1 times [2024-02-10 01:27:21,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:27:21,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60954079] [2024-02-10 01:27:21,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:27:21,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:27:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:27:21,774 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:27:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:27:21,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:27:21,916 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:27:21,917 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:27:21,917 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:27:21,917 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:27:21,917 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 01:27:21,923 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:21,923 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:27:21,923 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:27:21,924 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-proofs-counter-add-4-semi-Q67.wvr.c_BEv2_Iteration1_Loop [2024-02-10 01:27:21,924 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:27:21,924 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:27:21,970 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:21,990 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,022 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,050 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,054 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,073 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,225 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:27:22,226 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 01:27:22,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:22,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:22,254 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) [2024-02-10 01:27:22,256 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 [2024-02-10 01:27:22,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:27:22,258 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:27:22,284 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 01:27:22,285 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: [] [2024-02-10 01:27:22,290 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 [2024-02-10 01:27:22,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:22,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:22,420 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) [2024-02-10 01:27:22,422 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 [2024-02-10 01:27:22,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:27:22,437 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:27:22,461 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 [2024-02-10 01:27:22,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:22,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:22,485 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) [2024-02-10 01:27:22,548 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 [2024-02-10 01:27:22,552 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 01:27:22,552 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:27:22,581 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 01:27:22,581 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~counter~0=0} Honda state: {~counter~0=0} Generalized eigenvectors: [{~counter~0=4}, {~counter~0=-3}, {~counter~0=0}] Lambdas: [1, 1, 0] Nus: [0, 1] [2024-02-10 01:27:22,593 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 [2024-02-10 01:27:22,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:22,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:22,595 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) [2024-02-10 01:27:22,603 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 [2024-02-10 01:27:22,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:27:22,620 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:27:22,655 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 01:27:22,655 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread1.base_1=-1} Honda state: {v_rep#funAddr~thread1.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-10 01:27:22,667 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 [2024-02-10 01:27:22,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:22,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:22,671 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) [2024-02-10 01:27:22,676 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:27:22,676 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:27:22,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-02-10 01:27:22,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:22,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:22,700 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) [2024-02-10 01:27:22,701 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 [2024-02-10 01:27:22,707 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 [2024-02-10 01:27:22,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 01:27:22,707 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:27:22,849 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 01:27:22,858 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 [2024-02-10 01:27:22,858 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:27:22,858 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:27:22,859 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:27:22,859 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:27:22,859 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:27:22,859 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:22,859 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:27:22,859 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:27:22,859 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-proofs-counter-add-4-semi-Q67.wvr.c_BEv2_Iteration1_Loop [2024-02-10 01:27:22,859 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:27:22,859 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:27:22,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,877 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,880 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,889 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,904 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:22,916 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:23,038 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:27:23,042 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:27:23,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:23,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:23,056 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) [2024-02-10 01:27:23,073 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 [2024-02-10 01:27:23,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:27:23,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:27:23,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:27:23,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:27:23,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:27:23,089 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:27:23,089 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:27:23,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:27:23,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-02-10 01:27:23,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:23,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:23,145 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) [2024-02-10 01:27:23,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:27:23,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:27:23,168 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:27:23,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:27:23,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:27:23,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:27:23,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:27:23,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:27:23,171 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 [2024-02-10 01:27:23,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:27:23,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-02-10 01:27:23,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:23,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:23,221 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) [2024-02-10 01:27:23,222 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 [2024-02-10 01:27:23,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:27:23,245 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:27:23,245 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:27:23,245 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:27:23,245 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:27:23,247 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:27:23,247 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:27:23,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:27:23,268 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 [2024-02-10 01:27:23,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:23,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:23,269 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) [2024-02-10 01:27:23,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:27:23,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:27:23,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:27:23,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:27:23,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:27:23,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:27:23,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:27:23,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:27:23,287 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 [2024-02-10 01:27:23,300 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:27:23,304 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 01:27:23,304 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:27:23,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:23,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:23,316 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) [2024-02-10 01:27:23,337 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 [2024-02-10 01:27:23,337 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:27:23,338 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 01:27:23,338 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:27:23,338 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~i1~0, ~N1~0) = -1*~i1~0 + 1*~N1~0 Supporting invariants [] [2024-02-10 01:27:23,345 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 [2024-02-10 01:27:23,347 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:27:23,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:27:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:27:23,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:27:23,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:27:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:27:23,485 WARN L260 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:27:23,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:27:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:27:23,529 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-02-10 01:27:23,530 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:27:23,706 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 9 states and 1659 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 01:27:23,707 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:27:23,708 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:27:23,740 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:27:23,740 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:27:23,757 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 [2024-02-10 01:27:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:27:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2024-02-10 01:27:23,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 656 transitions. Stem has 43 letters. Loop has 2 letters. [2024-02-10 01:27:23,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:27:23,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 656 transitions. Stem has 45 letters. Loop has 2 letters. [2024-02-10 01:27:23,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:27:23,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 656 transitions. Stem has 43 letters. Loop has 4 letters. [2024-02-10 01:27:23,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:27:23,764 INFO L428 stractBuchiCegarLoop]: Abstraction has has 146 places, 3110 transitions, 13052 flow [2024-02-10 01:27:23,764 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 01:27:23,765 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:27:23,765 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 146 places, 3110 transitions, 13052 flow [2024-02-10 01:27:23,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-02-10 01:27:25,918 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 16450 states, 16439 states have (on average 5.9610681914958334) internal successors, (97994), 16449 states have internal predecessors, (97994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:27:25,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16450 states, 16439 states have (on average 5.9610681914958334) internal successors, (97994), 16449 states have internal predecessors, (97994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:27:26,268 INFO L131 ngComponentsAnalysis]: Automaton has 2230 accepting balls. 5696 [2024-02-10 01:27:26,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:27:26,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:27:26,272 INFO L748 eck$LassoCheckResult]: Stem: Black: 16163#[$Ultimate##0]don't care [272] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] Black: 16166#[L-1]don't care [277] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] Black: 16171#[L21]don't care [326] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] Black: 16179#[L21-1]don't care [352] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] Black: 16187#[L21-2]don't care [283] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] Black: 16195#[L21-3]don't care [317] L21-3-->L21-4: Formula: (and (= 43 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] Black: 16203#[L21-4]don't care [298] L21-4-->L37: Formula: (= v_~i1~0_5 0) InVars {} OutVars{~i1~0=v_~i1~0_5} AuxVars[] AssignedVars[~i1~0] Black: 16211#[L37]don't care [292] L37-->L37-1: Formula: (= v_~i2~0_5 0) InVars {} OutVars{~i2~0=v_~i2~0_5} AuxVars[] AssignedVars[~i2~0] Black: 16219#[L37-1]don't care [293] L37-1-->L37-2: Formula: (= 0 v_~N1~0_3) InVars {} OutVars{~N1~0=v_~N1~0_3} AuxVars[] AssignedVars[~N1~0] Black: 16227#[L37-2]don't care [254] L37-2-->L37-3: Formula: (= 0 v_~N2~0_3) InVars {} OutVars{~N2~0=v_~N2~0_3} AuxVars[] AssignedVars[~N2~0] Black: 16235#[L37-3]don't care [273] L37-3-->L37-4: Formula: (= v_~counter~0_11 0) InVars {} OutVars{~counter~0=v_~counter~0_11} AuxVars[] AssignedVars[~counter~0] Black: 16243#[L37-4]don't care [345] L37-4-->L37-5: Formula: (= v_~j1~0_5 0) InVars {} OutVars{~j1~0=v_~j1~0_5} AuxVars[] AssignedVars[~j1~0] Black: 16251#[L37-5]don't care [309] L37-5-->L37-6: Formula: (= v_~j2~0_5 0) InVars {} OutVars{~j2~0=v_~j2~0_5} AuxVars[] AssignedVars[~j2~0] Black: 16259#[L37-6]don't care [301] L37-6-->L37-7: Formula: (= 0 v_~M1~0_3) InVars {} OutVars{~M1~0=v_~M1~0_3} AuxVars[] AssignedVars[~M1~0] Black: 16267#[L37-7]don't care [318] L37-7-->L-1-1: Formula: (= 0 v_~M2~0_3) InVars {} OutVars{~M2~0=v_~M2~0_3} AuxVars[] AssignedVars[~M2~0] Black: 16275#[L-1-1]don't care [359] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] Black: 16283#[L-1-2]don't care [361] L-1-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem23#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre15#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~pre19#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet20#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, ULTIMATE.start_main_#t~mem24#1] Black: 16291#[L86]don't care [249] L86-->L86-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] Black: 16299#[L86-1]don't care [307] L86-1-->L86-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] Black: 16307#[L86-2]don't care [372] L86-2-->L86-3: Formula: (and (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (store |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1) |v_#valid_8|) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_7|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] Black: 16315#[L86-3]don't care [286] L86-3-->L86-4: Formula: (and (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 1) |v_#valid_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_2| 0)) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2|) 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_2|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_2|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] Black: 16323#[L86-4]don't care [264] L86-4-->L88: 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] Black: 16331#[L88]don't care [325] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~N1~0_4) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~N1~0=v_~N1~0_4} AuxVars[] AssignedVars[~N1~0] Black: 16339#[L88-1]don't care [351] L88-1-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] Black: 16347#[L89]don't care [304] L89-->L89-1: 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] Black: 16355#[L89-1]don't care [285] L89-1-->L89-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~N2~0_4) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ~N2~0=v_~N2~0_4} AuxVars[] AssignedVars[~N2~0] Black: 16363#[L89-2]don't care [312] L89-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] Black: 16371#[L90]don't care [356] L90-->L90-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] Black: 16379#[L90-1]don't care [262] L90-1-->L90-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~M1~0_4) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~M1~0=v_~M1~0_4} AuxVars[] AssignedVars[~M1~0] Black: 16387#[L90-2]don't care [274] L90-2-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] Black: 16395#[L91]don't care [263] L91-->L91-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] Black: 16403#[L91-1]don't care [275] L91-1-->L91-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet12#1_3| v_~M2~0_4) InVars {ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|} OutVars{~M2~0=v_~M2~0_4, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|} AuxVars[] AssignedVars[~M2~0] Black: 16411#[L91-2]don't care [302] L91-2-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] Black: 16419#[L92]don't care [346] L92-->L92-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~M1~0_5 v_~N1~0_5) (= v_~M2~0_5 v_~N1~0_5) (= v_~N1~0_5 v_~N2~0_5)) 1 0)) InVars {~M1~0=v_~M1~0_5, ~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5, ~M2~0=v_~M2~0_5} OutVars{~M1~0=v_~M1~0_5, ~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5, ~M2~0=v_~M2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] Black: 16427#[L92-1]don't care [338] L92-1-->L33: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] Black: 16435#[L33]don't care [260] L33-->L34: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] Black: 16443#[L34]don't care [271] L34-->L33-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] Black: 16451#[L33-1]don't care [288] L33-1-->L92-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] Black: 16467#[L92-2]don't care [296] L92-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] Black: 16478#[L95]don't care [320] L95-->L95-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] Black: 16489#[L95-1]don't care [334] L95-1-->L95-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] Black: 16500#[L95-2]don't care [335] L95-2-->L95-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre13#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] Black: 16511#[L95-3]don't care [402] L95-3-->L44: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_7|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_4|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, 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_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] Black: 16522#[L95-4, L44]don't care [280] L95-4-->L95-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] Black: 16541#[L95-5, L44]don't care [248] L95-5-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] Black: 16579#[L96, L44]don't care [347] L96-->L96-1: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1] Black: 16637#[L96-1, L44]don't care [303] L96-1-->L96-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] Black: 16695#[L96-2, L44]don't care [261] L96-2-->L96-3: Formula: (and (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre15#1_3|)) |v_#memory_int_5|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_12| |v_ULTIMATE.start_main_~#t2~0#1.base_3|))) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_12|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] Black: 16753#[L96-3, L44]don't care [408] L96-3-->L56: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar2_2 0) (= v_thread2Thread1of1ForFork3_thidvar1_2 0) (= v_thread2Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_7|)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|} 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|, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_4|, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_2, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_4|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|, 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_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base] 16814#[L56, L96-4, L44]don't care [2024-02-10 01:27:26,272 INFO L750 eck$LassoCheckResult]: Loop: 16814#[L56, L96-4, L44]don't care [379] L56-->L52: Formula: (< v_~i2~0_4 v_~N2~0_2) InVars {~i2~0=v_~i2~0_4, ~N2~0=v_~N2~0_2} OutVars{~i2~0=v_~i2~0_4, ~N2~0=v_~N2~0_2} AuxVars[] AssignedVars[] Black: 16887#[L52, L96-4, L44]don't care [382] L52-->L56: Formula: (and (= (+ v_~i2~0_29 1) v_~i2~0_28) (= (+ v_~counter~0_77 1) v_~counter~0_78) (not (= (ite (< 0 v_~counter~0_78) 1 0) 0))) InVars {~counter~0=v_~counter~0_78, ~i2~0=v_~i2~0_29} OutVars{~counter~0=v_~counter~0_77, 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_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~i2~0=v_~i2~0_28, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1] 16814#[L56, L96-4, L44]don't care [2024-02-10 01:27:26,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:27:26,273 INFO L85 PathProgramCache]: Analyzing trace with hash 570215277, now seen corresponding path program 1 times [2024-02-10 01:27:26,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:27:26,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374398441] [2024-02-10 01:27:26,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:27:26,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:27:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:27:26,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:27:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:27:26,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:27:26,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:27:26,360 INFO L85 PathProgramCache]: Analyzing trace with hash 13092, now seen corresponding path program 1 times [2024-02-10 01:27:26,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:27:26,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761091538] [2024-02-10 01:27:26,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:27:26,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:27:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:27:26,363 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:27:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:27:26,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:27:26,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:27:26,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1778920560, now seen corresponding path program 1 times [2024-02-10 01:27:26,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:27:26,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795427987] [2024-02-10 01:27:26,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:27:26,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:27:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:27:26,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:27:26,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-10 01:27:26,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795427987] [2024-02-10 01:27:26,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795427987] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-10 01:27:26,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-10 01:27:26,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-10 01:27:26,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874082862] [2024-02-10 01:27:26,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-10 01:27:26,494 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:27:26,494 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:27:26,494 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:27:26,494 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:27:26,494 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 01:27:26,494 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:26,494 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:27:26,494 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:27:26,494 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-proofs-counter-add-4-semi-Q67.wvr.c_BEv2_Iteration2_Loop [2024-02-10 01:27:26,494 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:27:26,494 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:27:26,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,501 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,507 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,509 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,511 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,515 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,522 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,525 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,608 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:27:26,608 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 01:27:26,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:26,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:26,626 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) [2024-02-10 01:27:26,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:27:26,631 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:27:26,639 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 [2024-02-10 01:27:26,670 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 [2024-02-10 01:27:26,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:26,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:26,685 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) [2024-02-10 01:27:26,728 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 [2024-02-10 01:27:26,729 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 01:27:26,730 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:27:26,764 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 01:27:26,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2024-02-10 01:27:26,789 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:27:26,789 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:27:26,789 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:27:26,789 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:27:26,789 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:27:26,789 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:26,789 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:27:26,790 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:27:26,790 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-proofs-counter-add-4-semi-Q67.wvr.c_BEv2_Iteration2_Loop [2024-02-10 01:27:26,790 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:27:26,790 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:27:26,791 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,823 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:27:26,905 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:27:26,905 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:27:26,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:26,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:26,907 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) [2024-02-10 01:27:26,964 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 [2024-02-10 01:27:26,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:27:26,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:27:26,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:27:26,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:27:26,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:27:26,975 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:27:26,975 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:27:27,018 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:27:27,022 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 [2024-02-10 01:27:27,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:27,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:27,049 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) [2024-02-10 01:27:27,064 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 [2024-02-10 01:27:27,065 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:27:27,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:27:27,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:27:27,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:27:27,073 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:27:27,073 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:27:27,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:27:27,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:27:27,087 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:27:27,090 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 01:27:27,090 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:27:27,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:27:27,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:27:27,092 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) [2024-02-10 01:27:27,097 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 [2024-02-10 01:27:27,097 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:27:27,097 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 01:27:27,097 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:27:27,098 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter~0) = 1*~counter~0 Supporting invariants [] [2024-02-10 01:27:27,104 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 [2024-02-10 01:27:27,105 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:27:27,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:27:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:27:27,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:27:27,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:27:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:27:27,220 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:27:27,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:27:27,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:27:27,222 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-02-10 01:27:27,222 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:27:27,294 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 7 states and 1278 transitions.5 powerset states2 rank states. The highest rank that occured is 1 [2024-02-10 01:27:27,294 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:27:27,294 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:27:27,456 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 [2024-02-10 01:27:27,648 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:27:27,648 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:27:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-02-10 01:27:27,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:27:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 526 transitions. [2024-02-10 01:27:27,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 526 transitions. Stem has 49 letters. Loop has 2 letters. [2024-02-10 01:27:27,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:27:27,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 526 transitions. Stem has 51 letters. Loop has 2 letters. [2024-02-10 01:27:27,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:27:27,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 526 transitions. Stem has 49 letters. Loop has 4 letters. [2024-02-10 01:27:27,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:27:27,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-10 01:27:27,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-10 01:27:27,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-10 01:27:27,689 INFO L175 Difference]: Start difference. First operand has 160 places, 60500 transitions, 374928 flow. Second operand 3 states and 399 transitions. [2024-02-10 01:27:27,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 60500 transitions, 374928 flow. Second operand 3 states and 399 transitions. [2024-02-10 01:27:27,690 INFO L120 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 133 [2024-02-10 01:27:27,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-10 01:30:31,583 INFO L124 PetriNetUnfolderBase]: 471946/553674 cut-off events. [2024-02-10 01:30:31,584 INFO L125 PetriNetUnfolderBase]: For 30847/30847 co-relation queries the response was YES. [2024-02-10 01:30:32,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1703415 conditions, 553674 events. 471946/553674 cut-off events. For 30847/30847 co-relation queries the response was YES. Maximal size of possible extension queue 8755. Compared 2374860 event pairs, 36723 based on Foata normal form. 15224/280533 useless extension candidates. Maximal degree in co-relation 1518578. Up to 221152 conditions per place. [2024-02-10 01:30:35,223 INFO L140 encePairwiseOnDemand]: 121/133 looper letters, 94 selfloop transitions, 27 changer transitions 43/3016 dead transitions. [2024-02-10 01:30:35,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 3016 transitions, 19013 flow [2024-02-10 01:30:35,244 INFO L231 Difference]: Finished difference. Result has 163 places, 2973 transitions, 18652 flow [2024-02-10 01:30:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-10 01:30:35,246 INFO L428 stractBuchiCegarLoop]: Abstraction has has 163 places, 2973 transitions, 18652 flow [2024-02-10 01:30:35,246 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 01:30:35,246 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:30:35,246 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 163 places, 2973 transitions, 18652 flow [2024-02-10 01:30:54,314 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 81688 states, 81467 states have (on average 6.795487743503505) internal successors, (553608), 81687 states have internal predecessors, (553608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:30:54,535 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 81688 states, 81467 states have (on average 6.795487743503505) internal successors, (553608), 81687 states have internal predecessors, (553608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:30:56,923 INFO L131 ngComponentsAnalysis]: Automaton has 2230 accepting balls. 5696 [2024-02-10 01:30:56,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 01:30:56,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 01:30:56,929 INFO L748 eck$LassoCheckResult]: Stem: Black: 61749#[$Ultimate##0]don't care [272] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] Black: 61752#[L-1]don't care [277] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] Black: 61763#[L21]don't care [326] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] Black: 61782#[L21-1]don't care [352] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] Black: 61804#[L21-2]don't care [283] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] Black: 61826#[L21-3]don't care [317] L21-3-->L21-4: Formula: (and (= 43 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] Black: 61848#[L21-4]don't care [298] L21-4-->L37: Formula: (= v_~i1~0_5 0) InVars {} OutVars{~i1~0=v_~i1~0_5} AuxVars[] AssignedVars[~i1~0] Black: 61870#[L37]don't care [292] L37-->L37-1: Formula: (= v_~i2~0_5 0) InVars {} OutVars{~i2~0=v_~i2~0_5} AuxVars[] AssignedVars[~i2~0] Black: 61892#[L37-1]don't care [293] L37-1-->L37-2: Formula: (= 0 v_~N1~0_3) InVars {} OutVars{~N1~0=v_~N1~0_3} AuxVars[] AssignedVars[~N1~0] Black: 61914#[L37-2]don't care [254] L37-2-->L37-3: Formula: (= 0 v_~N2~0_3) InVars {} OutVars{~N2~0=v_~N2~0_3} AuxVars[] AssignedVars[~N2~0] Black: 61936#[L37-3]don't care [273] L37-3-->L37-4: Formula: (= v_~counter~0_11 0) InVars {} OutVars{~counter~0=v_~counter~0_11} AuxVars[] AssignedVars[~counter~0] Black: 61958#[L37-4]don't care [345] L37-4-->L37-5: Formula: (= v_~j1~0_5 0) InVars {} OutVars{~j1~0=v_~j1~0_5} AuxVars[] AssignedVars[~j1~0] Black: 61980#[L37-5]don't care [309] L37-5-->L37-6: Formula: (= v_~j2~0_5 0) InVars {} OutVars{~j2~0=v_~j2~0_5} AuxVars[] AssignedVars[~j2~0] Black: 62002#[L37-6]don't care [301] L37-6-->L37-7: Formula: (= 0 v_~M1~0_3) InVars {} OutVars{~M1~0=v_~M1~0_3} AuxVars[] AssignedVars[~M1~0] Black: 62024#[L37-7]don't care [318] L37-7-->L-1-1: Formula: (= 0 v_~M2~0_3) InVars {} OutVars{~M2~0=v_~M2~0_3} AuxVars[] AssignedVars[~M2~0] Black: 62046#[L-1-1]don't care [359] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] Black: 62068#[L-1-2]don't care [361] L-1-2-->L86: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|, ULTIMATE.start_main_#t~mem21#1=|v_ULTIMATE.start_main_#t~mem21#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_1|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_1|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~mem23#1=|v_ULTIMATE.start_main_#t~mem23#1_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_1|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|, ULTIMATE.start_main_#t~mem24#1=|v_ULTIMATE.start_main_#t~mem24#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~mem23#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_#t~pre15#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~pre19#1, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet20#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, ULTIMATE.start_main_#t~mem24#1] Black: 62090#[L86]don't care [249] L86-->L86-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] Black: 62112#[L86-1]don't care [307] L86-1-->L86-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] Black: 62134#[L86-2]don't care [372] L86-2-->L86-3: Formula: (and (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (store |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1) |v_#valid_8|) (= (store |v_#length_8| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4) |v_#length_7|) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_8|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_7|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] Black: 62156#[L86-3]don't care [286] L86-3-->L86-4: Formula: (and (= (store |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 1) |v_#valid_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t4~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#t4~0#1.offset_2| 0) (not (= |v_ULTIMATE.start_main_~#t4~0#1.base_2| 0)) (= (select |v_#valid_11| |v_ULTIMATE.start_main_~#t4~0#1.base_2|) 0) (< |v_#StackHeapBarrier_5| |v_ULTIMATE.start_main_~#t4~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_10|, #valid=|v_#valid_11|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t4~0#1.offset=|v_ULTIMATE.start_main_~#t4~0#1.offset_2|, ULTIMATE.start_main_~#t4~0#1.base=|v_ULTIMATE.start_main_~#t4~0#1.base_2|, #valid=|v_#valid_10|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t4~0#1.offset, ULTIMATE.start_main_~#t4~0#1.base] Black: 62178#[L86-4]don't care [264] L86-4-->L88: 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] Black: 62200#[L88]don't care [325] L88-->L88-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| v_~N1~0_4) InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, ~N1~0=v_~N1~0_4} AuxVars[] AssignedVars[~N1~0] Black: 62222#[L88-1]don't care [351] L88-1-->L89: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet9#1] Black: 62244#[L89]don't care [304] L89-->L89-1: 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] Black: 62266#[L89-1]don't care [285] L89-1-->L89-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet10#1_3| v_~N2~0_4) InVars {ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_3|, ~N2~0=v_~N2~0_4} AuxVars[] AssignedVars[~N2~0] Black: 62288#[L89-2]don't care [312] L89-2-->L90: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] Black: 62310#[L90]don't care [356] L90-->L90-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] Black: 62332#[L90-1]don't care [262] L90-1-->L90-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~M1~0_4) InVars {ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_3|, ~M1~0=v_~M1~0_4} AuxVars[] AssignedVars[~M1~0] Black: 62354#[L90-2]don't care [274] L90-2-->L91: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1] Black: 62376#[L91]don't care [263] L91-->L91-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] Black: 62398#[L91-1]don't care [275] L91-1-->L91-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet12#1_3| v_~M2~0_4) InVars {ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|} OutVars{~M2~0=v_~M2~0_4, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|} AuxVars[] AssignedVars[~M2~0] Black: 62420#[L91-2]don't care [302] L91-2-->L92: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet12#1] Black: 62442#[L92]don't care [346] L92-->L92-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (= v_~M1~0_5 v_~N1~0_5) (= v_~M2~0_5 v_~N1~0_5) (= v_~N1~0_5 v_~N2~0_5)) 1 0)) InVars {~M1~0=v_~M1~0_5, ~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5, ~M2~0=v_~M2~0_5} OutVars{~M1~0=v_~M1~0_5, ~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5, ~M2~0=v_~M2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] Black: 62464#[L92-1]don't care [338] L92-1-->L33: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] Black: 62486#[L33]don't care [260] L33-->L34: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] Black: 62508#[L34]don't care [271] L34-->L33-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] Black: 62532#[L33-1]don't care [288] L33-1-->L92-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] Black: 62556#[L92-2]don't care [296] L92-2-->L95: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] Black: 62578#[L95]don't care [320] L95-->L95-1: Formula: (= |v_ULTIMATE.start_main_#t~pre13#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] Black: 62600#[L95-1]don't care [334] L95-1-->L95-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] Black: 62622#[L95-2]don't care [335] L95-2-->L95-3: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_11| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (select |v_#valid_12| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre13#1_3|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_4|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_3|, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_3|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] Black: 62641#[L95-3]don't care [402] L95-3-->L44: Formula: (and (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre13#1_7|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_7|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_4|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, 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_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] Black: 62651#[L95-4, L44]don't care [373] L44-->L41: Formula: (< v_~i1~0_2 v_~N1~0_2) InVars {~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} OutVars{~i1~0=v_~i1~0_2, ~N1~0=v_~N1~0_2} AuxVars[] AssignedVars[] Black: 62657#[L95-4, L41]don't care [280] L95-4-->L95-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre13#1=|v_ULTIMATE.start_main_#t~pre13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre13#1] Black: 62690#[L95-5, L41]don't care [248] L95-5-->L96: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] Black: 62772#[L96, L41]don't care [347] L96-->L96-1: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1] Black: 62927#[L96-1, L41]don't care [303] L96-1-->L96-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] Black: 63146#[L96-2, L41]don't care [261] L96-2-->L96-3: Formula: (and (= (select |v_#valid_13| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre15#1_3|)) |v_#memory_int_5|) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_12| |v_ULTIMATE.start_main_~#t2~0#1.base_3|))) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_5|, #length=|v_#length_12|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] Black: 63421#[L96-3, L41]don't care [408] L96-3-->L56: Formula: (and (= v_thread2Thread1of1ForFork3_thidvar2_2 0) (= v_thread2Thread1of1ForFork3_thidvar1_2 0) (= v_thread2Thread1of1ForFork3_thidvar0_2 |v_ULTIMATE.start_main_#t~pre15#1_7|)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|} 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|, thread2Thread1of1ForFork3_thidvar0=v_thread2Thread1of1ForFork3_thidvar0_2, thread2Thread1of1ForFork3_thidvar1=v_thread2Thread1of1ForFork3_thidvar1_2, thread2Thread1of1ForFork3_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_4|, thread2Thread1of1ForFork3_thidvar2=v_thread2Thread1of1ForFork3_thidvar2_2, thread2Thread1of1ForFork3_#res#1.offset=|v_thread2Thread1of1ForFork3_#res#1.offset_4|, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_7|, 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_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork3_#res#1.base] Black: 63662#[L96-4, L56, L41]don't care [376] L41-->L44: Formula: (and (= (+ v_~counter~0_52 1) v_~counter~0_51) (= v_~i1~0_14 (+ v_~i1~0_15 1))) InVars {~counter~0=v_~counter~0_52, ~i1~0=v_~i1~0_15} OutVars{~counter~0=v_~counter~0_51, ~i1~0=v_~i1~0_14, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, ~i1~0] Black: 63929#[L56, L44, L96-4]don't care [322] L96-4-->L96-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1] 64407#[L56, L96-5, L44]don't care [2024-02-10 01:30:56,929 INFO L750 eck$LassoCheckResult]: Loop: 64407#[L56, L96-5, L44]don't care [379] L56-->L52: Formula: (< v_~i2~0_4 v_~N2~0_2) InVars {~i2~0=v_~i2~0_4, ~N2~0=v_~N2~0_2} OutVars{~i2~0=v_~i2~0_4, ~N2~0=v_~N2~0_2} AuxVars[] AssignedVars[] Black: 65189#[L52, L96-5, L44]don't care [382] L52-->L56: Formula: (and (= (+ v_~i2~0_29 1) v_~i2~0_28) (= (+ v_~counter~0_77 1) v_~counter~0_78) (not (= (ite (< 0 v_~counter~0_78) 1 0) 0))) InVars {~counter~0=v_~counter~0_78, ~i2~0=v_~i2~0_29} OutVars{~counter~0=v_~counter~0_77, 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_#t~post3#1=|v_thread2Thread1of1ForFork3_#t~post3#1_1|, ~i2~0=v_~i2~0_28, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork3_#t~post4#1, thread2Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork3_#t~post3#1, ~i2~0, thread2Thread1of1ForFork3_assume_abort_if_not_#in~cond#1] 64407#[L56, L96-5, L44]don't care [2024-02-10 01:30:56,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:30:56,929 INFO L85 PathProgramCache]: Analyzing trace with hash -635546400, now seen corresponding path program 1 times [2024-02-10 01:30:56,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:30:56,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880815935] [2024-02-10 01:30:56,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:30:56,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:30:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:30:56,970 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:30:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:30:56,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:30:56,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:30:56,998 INFO L85 PathProgramCache]: Analyzing trace with hash 13092, now seen corresponding path program 2 times [2024-02-10 01:30:56,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:30:56,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744076841] [2024-02-10 01:30:56,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:30:56,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:30:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:30:57,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:30:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:30:57,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:30:57,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:30:57,009 INFO L85 PathProgramCache]: Analyzing trace with hash -874722237, now seen corresponding path program 1 times [2024-02-10 01:30:57,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 01:30:57,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581016754] [2024-02-10 01:30:57,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 01:30:57,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 01:30:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:30:57,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 01:30:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 01:30:57,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 01:30:57,095 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:30:57,095 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:30:57,095 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:30:57,095 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:30:57,095 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-10 01:30:57,095 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:30:57,095 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:30:57,095 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:30:57,095 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-proofs-counter-add-4-semi-Q67.wvr.c_BEv2_Iteration3_Loop [2024-02-10 01:30:57,096 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:30:57,096 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:30:57,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,103 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,106 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,108 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,117 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,121 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,125 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,222 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:30:57,222 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-10 01:30:57,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:30:57,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:30:57,236 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) [2024-02-10 01:30:57,238 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 [2024-02-10 01:30:57,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:30:57,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:30:57,274 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 01:30:57,274 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: [] [2024-02-10 01:30:57,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-02-10 01:30:57,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:30:57,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:30:57,281 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) [2024-02-10 01:30:57,286 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:30:57,286 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:30:57,293 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 [2024-02-10 01:30:57,298 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-10 01:30:57,299 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: [] [2024-02-10 01:30:57,302 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 [2024-02-10 01:30:57,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:30:57,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:30:57,303 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) [2024-02-10 01:30:57,305 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 [2024-02-10 01:30:57,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-10 01:30:57,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:30:57,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-02-10 01:30:57,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:30:57,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:30:57,318 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) [2024-02-10 01:30:57,319 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 [2024-02-10 01:30:57,320 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-10 01:30:57,320 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-10 01:30:57,335 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-10 01:30:57,341 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 [2024-02-10 01:30:57,341 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 01:30:57,341 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 01:30:57,341 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 01:30:57,341 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 01:30:57,341 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 01:30:57,341 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:30:57,341 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 01:30:57,341 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 01:30:57,341 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-proofs-counter-add-4-semi-Q67.wvr.c_BEv2_Iteration3_Loop [2024-02-10 01:30:57,341 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 01:30:57,341 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 01:30:57,343 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,347 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,349 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,352 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,359 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,367 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,369 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,370 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,373 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 01:30:57,468 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 01:30:57,468 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 01:30:57,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:30:57,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:30:57,486 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) [2024-02-10 01:30:57,488 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 [2024-02-10 01:30:57,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:30:57,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:30:57,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:30:57,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:30:57,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:30:57,498 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:30:57,498 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:30:57,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:30:57,535 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 [2024-02-10 01:30:57,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:30:57,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:30:57,546 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) [2024-02-10 01:30:57,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:30:57,570 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 [2024-02-10 01:30:57,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:30:57,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:30:57,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:30:57,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:30:57,572 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:30:57,572 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:30:57,584 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:30:57,595 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 [2024-02-10 01:30:57,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:30:57,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:30:57,597 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) [2024-02-10 01:30:57,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:30:57,610 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 [2024-02-10 01:30:57,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:30:57,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:30:57,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:30:57,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:30:57,618 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:30:57,618 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:30:57,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:30:57,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-02-10 01:30:57,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:30:57,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:30:57,626 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) [2024-02-10 01:30:57,626 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 [2024-02-10 01:30:57,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:30:57,636 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:30:57,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:30:57,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:30:57,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:30:57,636 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:30:57,637 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:30:57,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:30:57,645 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:30:57,651 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 [2024-02-10 01:30:57,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:30:57,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:30:57,654 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) [2024-02-10 01:30:57,656 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 [2024-02-10 01:30:57,800 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:30:57,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:30:57,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:30:57,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:30:57,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:30:57,822 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 01:30:57,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 01:30:57,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 01:30:57,863 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 [2024-02-10 01:30:57,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:30:57,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:30:57,876 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) [2024-02-10 01:30:57,912 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 [2024-02-10 01:30:57,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 01:30:57,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 01:30:57,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 01:30:57,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 01:30:57,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 01:30:57,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 01:30:57,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 01:30:57,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 01:30:57,931 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 01:30:57,933 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 01:30:57,933 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 01:30:57,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 01:30:57,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 01:30:57,946 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) [2024-02-10 01:30:57,952 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 01:30:57,953 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-10 01:30:57,953 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 01:30:57,953 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~counter~0) = 1*~counter~0 Supporting invariants [] [2024-02-10 01:30:57,977 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 [2024-02-10 01:30:57,977 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 [2024-02-10 01:30:57,979 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-10 01:30:57,989 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 01:30:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:30:58,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 01:30:58,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:30:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 01:30:58,086 WARN L260 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 01:30:58,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 01:30:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 01:30:58,089 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2024-02-10 01:30:58,089 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:30:58,127 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 7 states and 1278 transitions.5 powerset states2 rank states. The highest rank that occured is 1 [2024-02-10 01:30:58,127 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 01:30:58,127 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-10 01:30:58,361 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-10 01:30:58,362 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 01:30:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-02-10 01:30:58,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 01:30:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 526 transitions. [2024-02-10 01:30:58,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 526 transitions. Stem has 52 letters. Loop has 2 letters. [2024-02-10 01:30:58,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:30:58,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 526 transitions. Stem has 54 letters. Loop has 2 letters. [2024-02-10 01:30:58,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:30:58,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 526 transitions. Stem has 52 letters. Loop has 4 letters. [2024-02-10 01:30:58,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 01:30:58,366 INFO L428 stractBuchiCegarLoop]: Abstraction has has 177 places, 58518 transitions, 483590 flow [2024-02-10 01:30:58,366 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-10 01:30:58,366 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 01:30:58,366 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 177 places, 58518 transitions, 483590 flow [2024-02-10 01:30:59,519 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 Received shutdown request... [2024-02-10 01:31:08,477 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-10 01:31:08,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 01:31:08 BoogieIcfgContainer [2024-02-10 01:31:08,482 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 01:31:08,483 INFO L158 Benchmark]: Toolchain (without parser) took 229360.26ms. Allocated memory was 226.5MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 155.5MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-02-10 01:31:08,483 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 155.2MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 01:31:08,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.97ms. Allocated memory is still 226.5MB. Free memory was 155.3MB in the beginning and 144.0MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-02-10 01:31:08,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.08ms. Allocated memory is still 226.5MB. Free memory was 144.0MB in the beginning and 142.2MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 01:31:08,484 INFO L158 Benchmark]: Boogie Preprocessor took 51.27ms. Allocated memory is still 226.5MB. Free memory was 142.2MB in the beginning and 140.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 01:31:08,484 INFO L158 Benchmark]: RCFGBuilder took 818.04ms. Allocated memory is still 226.5MB. Free memory was 140.6MB in the beginning and 191.2MB in the end (delta: -50.6MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. [2024-02-10 01:31:08,484 INFO L158 Benchmark]: BuchiAutomizer took 227950.79ms. Allocated memory was 226.5MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 190.7MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2024-02-10 01:31:08,487 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2024-02-10 01:31:08,487 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.09ms. Allocated memory is still 155.2MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.97ms. Allocated memory is still 226.5MB. Free memory was 155.3MB in the beginning and 144.0MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 85.08ms. Allocated memory is still 226.5MB. Free memory was 144.0MB in the beginning and 142.2MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.27ms. Allocated memory is still 226.5MB. Free memory was 142.2MB in the beginning and 140.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 818.04ms. Allocated memory is still 226.5MB. Free memory was 140.6MB in the beginning and 191.2MB in the end (delta: -50.6MB). Peak memory consumption was 27.0MB. Max. memory is 8.0GB. * BuchiAutomizer took 227950.79ms. Allocated memory was 226.5MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 190.7MB in the beginning and 5.5GB in the end (delta: -5.3GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic) and one module whose termination is unknown.One deterministic module has affine ranking function ((-1 * i1) + N1) and consists of 5 locations. One deterministic module has affine ranking function counter and consists of 4 locations. One deterministic module has affine ranking function counter and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 483590 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 227.7s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 3.7s. Construction of modules took 0.1s. Büchi inclusion checks took 188.7s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 944 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 941 mSDsluCounter, 1677 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 660 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 213 IncrementalHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1017 mSDtfsCounter, 213 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax438 hnf100 lsp14 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 70ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.1s - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing BuchiPetriNet2FiniteAutomaton. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown