/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.fairness.type.for.concurrent.programs FAIRNESS_LAZY -i ../../../trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 12:01:04,817 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 12:01:04,884 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-09-17 12:01:04,908 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 12:01:04,909 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 12:01:04,909 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 12:01:04,911 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 12:01:04,911 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 12:01:04,911 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 12:01:04,915 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 12:01:04,915 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 12:01:04,915 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 12:01:04,915 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 12:01:04,916 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 12:01:04,917 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 12:01:04,917 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 12:01:04,917 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 12:01:04,917 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 12:01:04,918 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 12:01:04,918 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 12:01:04,918 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 12:01:04,918 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 12:01:04,918 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 12:01:04,918 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 12:01:04,919 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 12:01:04,919 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 12:01:04,919 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 12:01:04,919 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 12:01:04,919 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 12:01:04,919 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 12:01:04,920 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 12:01:04,920 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 12:01:04,920 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 12:01:04,921 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 12:01:04,922 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 12:01:04,922 INFO L137 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: Fairness type for concurrent programs -> FAIRNESS_LAZY [2023-09-17 12:01:05,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 12:01:05,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 12:01:05,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 12:01:05,140 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 12:01:05,140 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 12:01:05,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2023-09-17 12:01:06,310 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 12:01:06,478 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 12:01:06,478 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c [2023-09-17 12:01:06,484 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/646aa042b/64a75d5143ee4fc5ab7c79a31a787ee0/FLAG1bd14d421 [2023-09-17 12:01:06,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/646aa042b/64a75d5143ee4fc5ab7c79a31a787ee0 [2023-09-17 12:01:06,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 12:01:06,496 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 12:01:06,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 12:01:06,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 12:01:06,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 12:01:06,504 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 12:01:06" (1/1) ... [2023-09-17 12:01:06,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c132edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:01:06, skipping insertion in model container [2023-09-17 12:01:06,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 12:01:06" (1/1) ... [2023-09-17 12:01:06,510 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 12:01:06,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 12:01:06,646 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c[2958,2971] [2023-09-17 12:01:06,647 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 12:01:06,655 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 12:01:06,674 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-5.wvr.c[2958,2971] [2023-09-17 12:01:06,675 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 12:01:06,682 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 12:01:06,682 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 12:01:06,688 INFO L208 MainTranslator]: Completed translation [2023-09-17 12:01:06,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:01:06 WrapperNode [2023-09-17 12:01:06,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 12:01:06,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 12:01:06,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 12:01:06,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 12:01:06,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:01:06" (1/1) ... [2023-09-17 12:01:06,701 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:01:06" (1/1) ... [2023-09-17 12:01:06,723 INFO L138 Inliner]: procedures = 22, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137 [2023-09-17 12:01:06,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 12:01:06,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 12:01:06,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 12:01:06,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 12:01:06,734 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:01:06" (1/1) ... [2023-09-17 12:01:06,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:01:06" (1/1) ... [2023-09-17 12:01:06,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:01:06" (1/1) ... [2023-09-17 12:01:06,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:01:06" (1/1) ... [2023-09-17 12:01:06,742 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:01:06" (1/1) ... [2023-09-17 12:01:06,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:01:06" (1/1) ... [2023-09-17 12:01:06,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:01:06" (1/1) ... [2023-09-17 12:01:06,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:01:06" (1/1) ... [2023-09-17 12:01:06,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 12:01:06,751 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 12:01:06,751 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 12:01:06,751 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 12:01:06,752 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:01:06" (1/1) ... [2023-09-17 12:01:06,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:01:06,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:01:06,781 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) [2023-09-17 12:01:06,794 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 [2023-09-17 12:01:06,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 12:01:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-17 12:01:06,810 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-17 12:01:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-17 12:01:06,810 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-17 12:01:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-17 12:01:06,810 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-17 12:01:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 12:01:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 12:01:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 12:01:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-17 12:01:06,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-17 12:01:06,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 12:01:06,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 12:01:06,811 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 12:01:06,812 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-17 12:01:06,920 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 12:01:06,922 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 12:01:07,187 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 12:01:07,275 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 12:01:07,275 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-09-17 12:01:07,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 12:01:07 BoogieIcfgContainer [2023-09-17 12:01:07,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 12:01:07,278 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 12:01:07,278 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 12:01:07,289 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 12:01:07,290 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:01:07,290 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 12:01:06" (1/3) ... [2023-09-17 12:01:07,291 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13b5fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 12:01:07, skipping insertion in model container [2023-09-17 12:01:07,291 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:01:07,291 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 12:01:06" (2/3) ... [2023-09-17 12:01:07,291 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13b5fa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 12:01:07, skipping insertion in model container [2023-09-17 12:01:07,291 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 12:01:07,292 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 12:01:07" (3/3) ... [2023-09-17 12:01:07,293 INFO L332 chiAutomizerObserver]: Analyzing ICFG parallel-misc-5.wvr.c [2023-09-17 12:01:07,373 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 12:01:07,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 99 transitions, 213 flow [2023-09-17 12:01:07,461 INFO L124 PetriNetUnfolderBase]: 7/93 cut-off events. [2023-09-17 12:01:07,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 12:01:07,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 7/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 84 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-09-17 12:01:07,467 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 99 transitions, 213 flow [2023-09-17 12:01:07,481 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 93 transitions, 195 flow [2023-09-17 12:01:07,524 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 12:01:07,524 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 12:01:07,524 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 12:01:07,524 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 12:01:07,524 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 12:01:07,524 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 12:01:07,525 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 12:01:07,525 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 12:01:07,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 12:01:19,556 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 208 [2023-09-17 12:01:19,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 12:01:19,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 12:01:19,568 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:01:19,568 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:01:19,568 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 12:01:19,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand null [2023-09-17 12:01:28,176 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 208 [2023-09-17 12:01:28,176 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 12:01:28,176 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 12:01:28,186 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:01:28,186 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 12:01:28,201 INFO L748 eck$LassoCheckResult]: Stem: SleepPredicate [underlying: 102#[$Ultimate##0]don't care, sleep set: []] [230] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] SleepPredicate [underlying: 105#[L-1]don't care, sleep set: []] [238] L-1-->L-1-1: Formula: (= (select |v_#valid_10| 0) 0) InVars {#valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 107#[L-1-1]don't care, sleep set: []] [273] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 109#[L21]don't care, sleep set: []] [229] L21-->L21-1: Formula: (and (= 2 (select |v_#length_4| 1)) (= 1 (select |v_#valid_11| 1))) InVars {#length=|v_#length_4|, #valid=|v_#valid_11|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_11|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 111#[L21-1]don't care, sleep set: []] [254] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 113#[L21-2]don't care, sleep set: []] [252] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 115#[L21-3]don't care, sleep set: []] [211] L21-3-->L21-4: Formula: (and (= 22 (select |v_#length_5| 2)) (= (select |v_#valid_12| 2) 1)) InVars {#length=|v_#length_5|, #valid=|v_#valid_12|} OutVars{#length=|v_#length_5|, #valid=|v_#valid_12|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 117#[L21-4]don't care, sleep set: []] [284] L21-4-->L38: Formula: (= v_~pos~0_10 0) InVars {} OutVars{~pos~0=v_~pos~0_10} AuxVars[] AssignedVars[~pos~0] SleepPredicate [underlying: 119#[L38]don't care, sleep set: []] [285] L38-->L38-1: Formula: (= v_~c1~0_6 0) InVars {} OutVars{~c1~0=v_~c1~0_6} AuxVars[] AssignedVars[~c1~0] SleepPredicate [underlying: 121#[L38-1]don't care, sleep set: []] [213] L38-1-->L39: Formula: (= v_~c2~0_6 0) InVars {} OutVars{~c2~0=v_~c2~0_6} AuxVars[] AssignedVars[~c2~0] SleepPredicate [underlying: 123#[L39]don't care, sleep set: []] [256] L39-->L-1-2: Formula: (= v_~v_assert~0_6 0) InVars {} OutVars{~v_assert~0=v_~v_assert~0_6} AuxVars[] AssignedVars[~v_assert~0] SleepPredicate [underlying: 125#[L-1-2]don't care, sleep set: []] [274] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] SleepPredicate [underlying: 127#[L-1-3]don't care, sleep set: []] [281] L-1-3-->L102: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_4|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_4|, ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, 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_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_1|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_4|, ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_2|, 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_2|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_#t~pre15#1, ULTIMATE.start_main_#t~nondet18#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_#t~pre17#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_#t~nondet14#1, ULTIMATE.start_main_#t~pre19#1, ULTIMATE.start_main_#t~nondet16#1, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet20#1, ULTIMATE.start_main_#t~nondet13#1, ULTIMATE.start_main_~#t2~0#1.base] SleepPredicate [underlying: 129#[L102]don't care, sleep set: []] [249] L102-->L102-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) (= (store |v_#valid_14| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 1) |v_#valid_13|) (= (select |v_#valid_14| |v_ULTIMATE.start_main_~#t1~0#1.base_5|) 0) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_5| 0)) (= |v_#length_6| (store |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_5| 4)) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_7|, #valid=|v_#valid_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_5|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_5|, #valid=|v_#valid_13|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] SleepPredicate [underlying: 131#[L102-1]don't care, sleep set: []] [215] L102-1-->L102-2: Formula: (and (= (store |v_#length_9| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 4) |v_#length_8|) (= (store |v_#valid_16| |v_ULTIMATE.start_main_~#t2~0#1.base_5| 1) |v_#valid_15|) (= (select |v_#valid_16| |v_ULTIMATE.start_main_~#t2~0#1.base_5|) 0) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_5| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_5|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_5|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_9|, #valid=|v_#valid_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_5|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_5|, #valid=|v_#valid_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] SleepPredicate [underlying: 133#[L102-2]don't care, sleep set: []] [245] L102-2-->L102-3: Formula: (and (= (select |v_#valid_18| |v_ULTIMATE.start_main_~#t3~0#1.base_5|) 0) (= |v_#length_10| (store |v_#length_11| |v_ULTIMATE.start_main_~#t3~0#1.base_5| 4)) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_5| 0)) (< |v_#StackHeapBarrier_4| |v_ULTIMATE.start_main_~#t3~0#1.base_5|) (= (store |v_#valid_18| |v_ULTIMATE.start_main_~#t3~0#1.base_5| 1) |v_#valid_17|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_5| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_11|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_5|, #StackHeapBarrier=|v_#StackHeapBarrier_4|, #length=|v_#length_10|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_5|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] SleepPredicate [underlying: 135#[L102-3]don't care, sleep set: []] [269] L102-3-->L105: 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] SleepPredicate [underlying: 137#[L105]don't care, sleep set: []] [212] L105-->L105-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet11#1_3| v_~pos~0_11) 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|, ~pos~0=v_~pos~0_11} AuxVars[] AssignedVars[~pos~0] SleepPredicate [underlying: 139#[L105-1]don't care, sleep set: []] [277] L105-1-->L106: 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] SleepPredicate [underlying: 141#[L106]don't care, sleep set: []] [257] L106-->L106-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] SleepPredicate [underlying: 143#[L106-1]don't care, sleep set: []] [246] L106-1-->L106-2: Formula: (= v_~c1~0_7 |v_ULTIMATE.start_main_#t~nondet12#1_3|) InVars {ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|} OutVars{ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_3|, ~c1~0=v_~c1~0_7} AuxVars[] AssignedVars[~c1~0] SleepPredicate [underlying: 145#[L106-2]don't care, sleep set: []] [260] L106-2-->L107: 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] SleepPredicate [underlying: 147#[L107]don't care, sleep set: []] [270] L107-->L107-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] SleepPredicate [underlying: 149#[L107-1]don't care, sleep set: []] [264] L107-1-->L107-2: Formula: (= v_~c2~0_7 |v_ULTIMATE.start_main_#t~nondet13#1_3|) InVars {ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_3|, ~c2~0=v_~c2~0_7} AuxVars[] AssignedVars[~c2~0] SleepPredicate [underlying: 151#[L107-2]don't care, sleep set: []] [288] L107-2-->L108: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet13#1] SleepPredicate [underlying: 153#[L108]don't care, sleep set: []] [216] L108-->L108-1: 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] SleepPredicate [underlying: 155#[L108-1]don't care, sleep set: []] [209] L108-1-->L108-2: Formula: (= v_~v_assert~0_7 |v_ULTIMATE.start_main_#t~nondet14#1_3|) InVars {ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_3|} OutVars{~v_assert~0=v_~v_assert~0_7, ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_3|} AuxVars[] AssignedVars[~v_assert~0] SleepPredicate [underlying: 157#[L108-2]don't care, sleep set: []] [222] L108-2-->L111: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet14#1=|v_ULTIMATE.start_main_#t~nondet14#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet14#1] SleepPredicate [underlying: 159#[L111]don't care, sleep set: []] [214] L111-->L111-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| (ite (and (= v_~c2~0_8 v_~pos~0_12) (= (mod v_~v_assert~0_8 256) 1) (= v_~c1~0_8 v_~pos~0_12) (= v_~pos~0_12 0)) 1 0)) InVars {~v_assert~0=v_~v_assert~0_8, ~pos~0=v_~pos~0_12, ~c2~0=v_~c2~0_8, ~c1~0=v_~c1~0_8} OutVars{~v_assert~0=v_~v_assert~0_8, ~pos~0=v_~pos~0_12, ~c2~0=v_~c2~0_8, ~c1~0=v_~c1~0_8, 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_#in~cond#1] SleepPredicate [underlying: 161#[L111-1]don't care, sleep set: []] [247] L111-1-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] SleepPredicate [underlying: 163#[L34]don't care, sleep set: []] [227] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|, 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_~cond#1] SleepPredicate [underlying: 165#[L35]don't care, sleep set: []] [259] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_3| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_3|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 169#[L34-1]don't care, sleep set: []] [250] L34-1-->L113: Formula: (= |v_ULTIMATE.start_main_#t~pre15#1_1| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1] SleepPredicate [underlying: 171#[L113]don't care, sleep set: []] [248] L113-->L113-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] SleepPredicate [underlying: 173#[L113-1]don't care, sleep set: []] [210] L113-1-->L113-2: Formula: (and (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_1| 4) (select |v_#length_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_1|) (= (select |v_#valid_1| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) 1) (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_1|) |v_ULTIMATE.start_main_~#t1~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre15#1_2|)) |v_#memory_int_1|)) InVars {#valid=|v_#valid_1|, #memory_int=|v_#memory_int_2|, #length=|v_#length_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} OutVars{#valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_2|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|} AuxVars[] AssignedVars[#memory_int] SleepPredicate [underlying: 175#[L113-2]don't care, sleep set: []] [329] L113-2-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre15#1_6| v_thread1Thread1of1ForFork2_thidvar0_2) (= 0 v_thread1Thread1of1ForFork2_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|} OutVars{thread1Thread1of1ForFork2_thidvar1=v_thread1Thread1of1ForFork2_thidvar1_2, thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2, thread1Thread1of1ForFork2_#t~post2#1=|v_thread1Thread1of1ForFork2_#t~post2#1_4|, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_4|, ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_6|, thread1Thread1of1ForFork2_#t~post3#1=|v_thread1Thread1of1ForFork2_#t~post3#1_4|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_4|, thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_12|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_4|, thread1Thread1of1ForFork2_#res#1.offset=|v_thread1Thread1of1ForFork2_#res#1.offset_4|, thread1Thread1of1ForFork2_#res#1.base=|v_thread1Thread1of1ForFork2_#res#1.base_4|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_4|, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar1, thread1Thread1of1ForFork2_thidvar0, thread1Thread1of1ForFork2_#t~post2#1, thread1Thread1of1ForFork2_#t~post3#1, thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~nondet1#1, thread1Thread1of1ForFork2_#t~post4#1, thread1Thread1of1ForFork2_#res#1.offset, thread1Thread1of1ForFork2_#res#1.base, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork2_~cond~0#1] SleepPredicate [underlying: 177#[$Ultimate##0, L113-3]don't care, sleep set: []] [233] L113-3-->L113-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre15#1=|v_ULTIMATE.start_main_#t~pre15#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre15#1] SleepPredicate [underlying: 181#[L113-4, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [205] L113-4-->L114: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet16#1=|v_ULTIMATE.start_main_#t~nondet16#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16#1] SleepPredicate [underlying: 189#[$Ultimate##0, L114]don't care, sleep set: [thread1Thread1of1ForFork2]] [265] L114-->L114-1: Formula: (= |v_ULTIMATE.start_main_#t~pre17#1_1| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre17#1] SleepPredicate [underlying: 201#[L114-1, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [225] L114-1-->L114-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] SleepPredicate [underlying: 219#[$Ultimate##0, L114-2]don't care, sleep set: [thread1Thread1of1ForFork2]] [240] L114-2-->L114-3: Formula: (and (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (select |v_#length_2| |v_ULTIMATE.start_main_~#t2~0#1.base_1|)) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_1|) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t2~0#1.base_1|) |v_ULTIMATE.start_main_~#t2~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre17#1_2|)) |v_#memory_int_3|)) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_4|, #length=|v_#length_2|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, #valid=|v_#valid_2|, #memory_int=|v_#memory_int_3|, #length=|v_#length_2|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[#memory_int] SleepPredicate [underlying: 241#[$Ultimate##0, L114-3]don't care, sleep set: [thread1Thread1of1ForFork2]] [323] L114-3-->$Ultimate##0: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre17#1_6|) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|} OutVars{thread2Thread1of1ForFork0_#t~post10#1=|v_thread2Thread1of1ForFork0_#t~post10#1_4|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_10|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_#t~post7#1=|v_thread2Thread1of1ForFork0_#t~post7#1_4|, ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_6|, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_4|, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~nondet6#1=|v_thread2Thread1of1ForFork0_#t~nondet6#1_12|, thread2Thread1of1ForFork0_#t~post8#1=|v_thread2Thread1of1ForFork0_#t~post8#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~post10#1, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_~cond~1#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_#t~post7#1, thread2Thread1of1ForFork0_#t~post9#1, thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~nondet6#1, thread2Thread1of1ForFork0_#t~post8#1] SleepPredicate [underlying: 265#[L114-4, $Ultimate##0, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [304] $Ultimate##0-->L87: Formula: (= v_~v_assert~0_4 |v_thread2Thread1of1ForFork0_~cond~1#1_1|) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1#1] SleepPredicate [underlying: 289#[L87, L114-4, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [255] L114-4-->L114-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre17#1=|v_ULTIMATE.start_main_#t~pre17#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre17#1] SleepPredicate [underlying: 321#[L87, L114-5, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [204] L114-5-->L115: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet18#1=|v_ULTIMATE.start_main_#t~nondet18#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet18#1] SleepPredicate [underlying: 365#[L87, $Ultimate##0, L115]don't care, sleep set: [thread1Thread1of1ForFork2]] [271] L115-->L115-1: Formula: (= |v_ULTIMATE.start_main_#t~pre19#1_1| |v_#pthreadsForks_7|) InVars {#pthreadsForks=|v_#pthreadsForks_7|} OutVars{#pthreadsForks=|v_#pthreadsForks_7|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre19#1] SleepPredicate [underlying: 431#[L87, L115-1, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [275] L115-1-->L115-2: Formula: (= (+ 1 |v_#pthreadsForks_9|) |v_#pthreadsForks_8|) InVars {#pthreadsForks=|v_#pthreadsForks_9|} OutVars{#pthreadsForks=|v_#pthreadsForks_8|} AuxVars[] AssignedVars[#pthreadsForks] SleepPredicate [underlying: 529#[L87, $Ultimate##0, L115-2]don't care, sleep set: [thread1Thread1of1ForFork2]] [276] L115-2-->L115-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t3~0#1.offset_1|) (select |v_#length_3| |v_ULTIMATE.start_main_~#t3~0#1.base_1|)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t3~0#1.base_1| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t3~0#1.base_1|) |v_ULTIMATE.start_main_~#t3~0#1.offset_1| |v_ULTIMATE.start_main_#t~pre19#1_2|)) |v_#memory_int_5|) (= (select |v_#valid_3| |v_ULTIMATE.start_main_~#t3~0#1.base_1|) 1) (<= 0 |v_ULTIMATE.start_main_~#t3~0#1.offset_1|)) InVars {ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, #length=|v_#length_3|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_2|} OutVars{ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, #valid=|v_#valid_3|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, #length=|v_#length_3|, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_2|} AuxVars[] AssignedVars[#memory_int] SleepPredicate [underlying: 669#[L115-3, L87, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [326] L115-3-->$Ultimate##0: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar1_2) (= 0 v_thread3Thread1of1ForFork1_thidvar2_2) (= v_thread3Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre19#1_6|) (= 0 v_thread3Thread1of1ForFork1_thidvar3_2)) InVars {ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_4|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_2, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_4|, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_2, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_2, ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_6|, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_thidvar0, thread3Thread1of1ForFork1_#res.base, thread3Thread1of1ForFork1_thidvar3, thread3Thread1of1ForFork1_thidvar1, thread3Thread1of1ForFork1_thidvar2] SleepPredicate [underlying: 853#[$Ultimate##0, L87, $Ultimate##0, L115-4]don't care, sleep set: [thread1Thread1of1ForFork2]] [283] L115-4-->L115-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre19#1=|v_ULTIMATE.start_main_#t~pre19#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre19#1] SleepPredicate [underlying: 1083#[$Ultimate##0, L87, L115-5, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [318] $Ultimate##0-->L96: Formula: (= (ite (= (ite (<= 0 v_~pos~0_9) 1 0) 0) 0 1) v_~v_assert~0_5) InVars {~pos~0=v_~pos~0_9} OutVars{~v_assert~0=v_~v_assert~0_5, ~pos~0=v_~pos~0_9} AuxVars[] AssignedVars[~v_assert~0] SleepPredicate [underlying: 1361#[L96, L87, $Ultimate##0, L115-5]don't care, sleep set: [thread1Thread1of1ForFork2]] [319] L96-->thread3FINAL: Formula: (and (= |v_thread3Thread1of1ForFork1_#res.offset_1| 0) (= |v_thread3Thread1of1ForFork1_#res.base_1| 0)) InVars {} OutVars{thread3Thread1of1ForFork1_#res.offset=|v_thread3Thread1of1ForFork1_#res.offset_1|, thread3Thread1of1ForFork1_#res.base=|v_thread3Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_#res.offset, thread3Thread1of1ForFork1_#res.base] SleepPredicate [underlying: 1691#[L87, thread3FINAL, L115-5, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [320] thread3FINAL-->thread3EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] SleepPredicate [underlying: 2085#[thread3EXIT, L87, $Ultimate##0, L115-5]don't care, sleep set: [thread1Thread1of1ForFork2]] [223] L115-5-->L117: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet20#1=|v_ULTIMATE.start_main_#t~nondet20#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet20#1] SleepPredicate [underlying: 2561#[thread3EXIT, L117, L87, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [202] L117-->L119: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] SleepPredicate [underlying: 3145#[thread3EXIT, L87, $Ultimate##0, L119]don't care, sleep set: [thread1Thread1of1ForFork2]] [262] L119-->L102-4: Formula: (= |v_ULTIMATE.start_main_#res#1_1| 0) InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] SleepPredicate [underlying: 3853#[thread3EXIT, L87, L102-4, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [237] L102-4-->L102-5: Formula: (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) InVars {ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid] SleepPredicate [underlying: 4691#[thread3EXIT, L102-5, L87, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [263] L102-5-->L102-6: Formula: true InVars {} OutVars{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[ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] SleepPredicate [underlying: 5647#[L102-6, thread3EXIT, L87, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [224] L102-6-->L102-7: Formula: (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0) |v_#valid_6|) InVars {ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[#valid] SleepPredicate [underlying: 6697#[L102-7, thread3EXIT, L87, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [266] L102-7-->L102-8: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] SleepPredicate [underlying: 7807#[thread3EXIT, L87, L102-8, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [267] L102-8-->L102-9: Formula: (= (store |v_#valid_9| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0) |v_#valid_8|) InVars {ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #valid=|v_#valid_9|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #valid=|v_#valid_8|} AuxVars[] AssignedVars[#valid] SleepPredicate [underlying: 8947#[thread3EXIT, L87, L102-9, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [268] L102-9-->main_returnLabel#1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_3|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_~#t3~0#1.base] SleepPredicate [underlying: 10093#[main_returnLabel#1, thread3EXIT, L87, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [278] main_returnLabel#1-->ULTIMATE.startFINAL: Formula: (= |v_ULTIMATE.start_main_#res#1_2| |v_ULTIMATE.start_#t~ret21#1_1|) InVars {ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} OutVars{ULTIMATE.start_#t~ret21#1=|v_ULTIMATE.start_#t~ret21#1_1|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_#t~ret21#1] SleepPredicate [underlying: 11225#[thread3EXIT, ULTIMATE.startFINAL, L87, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [289] ULTIMATE.startFINAL-->ULTIMATE.startEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] SleepPredicate [underlying: 12325#[thread3EXIT, L87, ULTIMATE.startEXIT, $Ultimate##0]don't care, sleep set: [thread1Thread1of1ForFork2]] [290] $Ultimate##0-->L61: Formula: (= v_~v_assert~0_1 |v_thread1Thread1of1ForFork2_~cond~0#1_1|) InVars {~v_assert~0=v_~v_assert~0_1} OutVars{~v_assert~0=v_~v_assert~0_1, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0#1] SleepPredicate [underlying: 13309#[thread3EXIT, L61, L87, ULTIMATE.startEXIT]don't care, sleep set: []] [2023-09-17 12:01:28,203 INFO L750 eck$LassoCheckResult]: Loop: SleepPredicate [underlying: 13309#[thread3EXIT, L61, L87, ULTIMATE.startEXIT]don't care, sleep set: []] [305] L87-->L72: Formula: (not (= (mod |v_thread2Thread1of1ForFork0_~cond~1#1_3| 256) 0)) InVars {thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} OutVars{thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_3|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 14263#[thread3EXIT, L61, L72, ULTIMATE.startEXIT]don't care, sleep set: [thread1Thread1of1ForFork2]] [291] L61-->L46: Formula: (not (= (mod |v_thread1Thread1of1ForFork2_~cond~0#1_3| 256) 0)) InVars {thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_3|} OutVars{thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_3|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 14861#[L46, thread3EXIT, L72, ULTIMATE.startEXIT]don't care, sleep set: []] [308] L72-->L72-1: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet6#1=|v_thread2Thread1of1ForFork0_#t~nondet6#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet6#1] SleepPredicate [underlying: 15613#[L46, thread3EXIT, ULTIMATE.startEXIT, L72-1]don't care, sleep set: [thread1Thread1of1ForFork2]] [294] L46-->L46-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet1#1] SleepPredicate [underlying: 16167#[thread3EXIT, L46-1, ULTIMATE.startEXIT, L72-1]don't care, sleep set: []] [297] L46-1-->L46-3: Formula: (= 0 (mod |v_thread1Thread1of1ForFork2_#t~nondet1#1_5| 256)) InVars {thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_5|} OutVars{thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_5|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 16557#[L46-3, thread3EXIT, ULTIMATE.startEXIT, L72-1]don't care, sleep set: [thread2Thread1of1ForFork0]] [311] L72-1-->L72-3: Formula: (= (mod |v_thread2Thread1of1ForFork0_#t~nondet6#1_5| 256) 0) InVars {thread2Thread1of1ForFork0_#t~nondet6#1=|v_thread2Thread1of1ForFork0_#t~nondet6#1_5|} OutVars{thread2Thread1of1ForFork0_#t~nondet6#1=|v_thread2Thread1of1ForFork0_#t~nondet6#1_5|} AuxVars[] AssignedVars[] SleepPredicate [underlying: 16821#[L46-3, thread3EXIT, ULTIMATE.startEXIT, L72-3]don't care, sleep set: []] [314] L72-3-->L79: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet6#1=|v_thread2Thread1of1ForFork0_#t~nondet6#1_9|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet6#1] SleepPredicate [underlying: 16955#[L46-3, L79, thread3EXIT, ULTIMATE.startEXIT]don't care, sleep set: [thread1Thread1of1ForFork2]] [316] L79-->L83: Formula: (and (not (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1| 0)) (= v_~c2~0_46 (+ v_~c2~0_45 1)) (= (+ v_~pos~0_63 1) v_~pos~0_64) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| (ite (< 0 v_~c2~0_46) 1 0)) (= |v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1| |v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|)) InVars {~c2~0=v_~c2~0_46, ~pos~0=v_~pos~0_64} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork0_#t~post10#1=|v_thread2Thread1of1ForFork0_#t~post10#1_1|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_1|, ~pos~0=v_~pos~0_63, ~c2~0=v_~c2~0_45, thread2Thread1of1ForFork0_#t~post9#1=|v_thread2Thread1of1ForFork0_#t~post9#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#t~post10#1, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~pos~0, ~c2~0, thread2Thread1of1ForFork0_#t~post9#1] SleepPredicate [underlying: 17007#[L83, L46-3, thread3EXIT, ULTIMATE.startEXIT]don't care, sleep set: [thread1Thread1of1ForFork2]] [300] L46-3-->L53: Formula: true InVars {} OutVars{thread1Thread1of1ForFork2_#t~nondet1#1=|v_thread1Thread1of1ForFork2_#t~nondet1#1_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~nondet1#1] SleepPredicate [underlying: 17021#[L83, L53, thread3EXIT, ULTIMATE.startEXIT]don't care, sleep set: []] [302] L53-->L57: Formula: (and (= |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~pos~0_67 1) v_~pos~0_68) (= (ite (< 0 v_~c1~0_36) 1 0) |v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|) (= v_~c1~0_36 (+ v_~c1~0_35 1)) (not (= 0 |v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|))) InVars {~c1~0=v_~c1~0_36, ~pos~0=v_~pos~0_68} OutVars{thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_1|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread1Thread1of1ForFork2_#t~post4#1=|v_thread1Thread1of1ForFork2_#t~post4#1_1|, ~pos~0=v_~pos~0_67, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, ~c1~0=v_~c1~0_35} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post5#1, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork2_#t~post4#1, ~pos~0, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~c1~0] SleepPredicate [underlying: 17023#[L83, thread3EXIT, ULTIMATE.startEXIT, L57]don't care, sleep set: [thread2Thread1of1ForFork0]] [303] L57-->L61: Formula: (= v_~v_assert~0_2 |v_thread1Thread1of1ForFork2_~cond~0#1_7|) InVars {~v_assert~0=v_~v_assert~0_2} OutVars{~v_assert~0=v_~v_assert~0_2, thread1Thread1of1ForFork2_~cond~0#1=|v_thread1Thread1of1ForFork2_~cond~0#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_~cond~0#1] SleepPredicate [underlying: 16657#[L83, thread3EXIT, L61, ULTIMATE.startEXIT]don't care, sleep set: [thread2Thread1of1ForFork0]] [317] L83-->L87: Formula: (= v_~v_assert~0_3 |v_thread2Thread1of1ForFork0_~cond~1#1_7|) InVars {~v_assert~0=v_~v_assert~0_3} OutVars{~v_assert~0=v_~v_assert~0_3, thread2Thread1of1ForFork0_~cond~1#1=|v_thread2Thread1of1ForFork0_~cond~1#1_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~cond~1#1] SleepPredicate [underlying: 13309#[thread3EXIT, L61, L87, ULTIMATE.startEXIT]don't care, sleep set: []] [2023-09-17 12:01:28,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:01:28,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1237852669, now seen corresponding path program 1 times [2023-09-17 12:01:28,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 12:01:28,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243620130] [2023-09-17 12:01:28,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 12:01:28,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 12:01:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 12:01:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 12:01:28,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-17 12:01:28,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243620130] [2023-09-17 12:01:28,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243620130] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-17 12:01:28,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-17 12:01:28,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-09-17 12:01:28,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855831893] [2023-09-17 12:01:28,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-17 12:01:28,446 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-09-17 12:01:28,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:01:28,446 INFO L85 PathProgramCache]: Analyzing trace with hash 2043053669, now seen corresponding path program 1 times [2023-09-17 12:01:28,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 12:01:28,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72858021] [2023-09-17 12:01:28,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 12:01:28,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 12:01:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:01:28,465 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 12:01:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 12:01:28,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 12:01:28,829 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 12:01:28,830 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 12:01:28,830 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 12:01:28,830 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 12:01:28,830 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-09-17 12:01:28,830 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:01:28,830 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 12:01:28,830 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 12:01:28,841 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-5.wvr.c_BEv2_Iteration1_Loop [2023-09-17 12:01:28,841 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 12:01:28,841 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 12:01:28,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,867 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,891 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,893 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,895 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,899 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,908 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,938 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,940 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:28,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,219 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 12:01:29,219 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-09-17 12:01:29,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:01:29,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:01:29,239 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) [2023-09-17 12:01:29,283 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 [2023-09-17 12:01:29,284 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-09-17 12:01:29,284 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-17 12:01:29,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-09-17 12:01:29,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:01:29,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:01:29,339 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) [2023-09-17 12:01:29,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-09-17 12:01:29,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-09-17 12:01:29,359 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 [2023-09-17 12:01:29,364 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-09-17 12:01:29,369 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 [2023-09-17 12:01:29,369 INFO L210 LassoAnalysis]: Preferences: [2023-09-17 12:01:29,369 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-09-17 12:01:29,369 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-09-17 12:01:29,369 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-09-17 12:01:29,369 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-09-17 12:01:29,369 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:01:29,370 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-09-17 12:01:29,370 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-09-17 12:01:29,370 INFO L133 ssoRankerPreferences]: Filename of dumped script: parallel-misc-5.wvr.c_BEv2_Iteration1_Loop [2023-09-17 12:01:29,370 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-09-17 12:01:29,370 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-09-17 12:01:29,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,392 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,396 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,425 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,430 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,435 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,436 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-09-17 12:01:29,632 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-09-17 12:01:29,636 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-09-17 12:01:29,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:01:29,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:01:29,638 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) [2023-09-17 12:01:29,641 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 [2023-09-17 12:01:29,643 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 [2023-09-17 12:01:29,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-09-17 12:01:29,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-09-17 12:01:29,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-09-17 12:01:29,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-09-17 12:01:29,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-09-17 12:01:29,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-09-17 12:01:29,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-09-17 12:01:29,667 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-09-17 12:01:29,673 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-09-17 12:01:29,673 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-09-17 12:01:29,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 12:01:29,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 12:01:29,739 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) [2023-09-17 12:01:29,740 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 [2023-09-17 12:01:29,742 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-09-17 12:01:29,742 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-09-17 12:01:29,742 INFO L513 LassoAnalysis]: Proved termination. [2023-09-17 12:01:29,743 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~c2~0) = 1*~c2~0 Supporting invariants [] [2023-09-17 12:01:29,746 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 [2023-09-17 12:01:29,748 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-09-17 12:01:29,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 12:01:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 12:01:29,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjunts are in the unsatisfiable core [2023-09-17 12:01:29,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 12:01:30,000 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 [2023-09-17 12:01:30,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 12:01:30,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 8 conjunts are in the unsatisfiable core [2023-09-17 12:01:30,104 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-09-17 12:01:30,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 12:01:30,197 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2023-09-17 12:01:30,200 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand null Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 12:01:46,581 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand null. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 194887 states and 803059 transitions. Complement of second has 6 states. [2023-09-17 12:01:46,584 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 [2023-09-17 12:01:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 12:01:46,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 218 transitions. [2023-09-17 12:01:46,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 218 transitions. Stem has 65 letters. Loop has 12 letters. [2023-09-17 12:01:46,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:01:46,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 218 transitions. Stem has 77 letters. Loop has 12 letters. [2023-09-17 12:01:46,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:01:46,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 218 transitions. Stem has 65 letters. Loop has 24 letters. [2023-09-17 12:01:46,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-09-17 12:01:46,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194887 states and 803059 transitions. [2023-09-17 12:01:50,744 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 208 [2023-09-17 12:01:52,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194887 states to 95726 states and 383108 transitions. [2023-09-17 12:01:52,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8141 [2023-09-17 12:01:52,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11291 [2023-09-17 12:01:52,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95726 states and 383108 transitions. [2023-09-17 12:01:52,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-09-17 12:01:52,391 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95726 states and 383108 transitions. [2023-09-17 12:01:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95726 states and 383108 transitions. [2023-09-17 12:01:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95726 to 91302. [2023-09-17 12:01:55,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91302 states, 91302 states have (on average 4.039035289478872) internal successors, (368772), 91301 states have internal predecessors, (368772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 12:01:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91302 states to 91302 states and 368772 transitions. [2023-09-17 12:01:56,287 INFO L240 hiAutomatonCegarLoop]: Abstraction has 91302 states and 368772 transitions. [2023-09-17 12:01:56,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-17 12:01:56,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-17 12:01:56,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-17 12:01:56,291 INFO L87 Difference]: Start difference. First operand 91302 states and 368772 transitions. Second operand has 2 states, 2 states have (on average 32.5) internal successors, (65), 2 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-17 12:01:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-17 12:01:57,019 INFO L93 Difference]: Finished difference Result 42422 states and 155054 transitions. [2023-09-17 12:01:57,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42422 states and 155054 transitions. [2023-09-17 12:01:57,450 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 12:01:57,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42422 states to 0 states and 0 transitions. [2023-09-17 12:01:57,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2023-09-17 12:01:57,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2023-09-17 12:01:57,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2023-09-17 12:01:57,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 12:01:57,451 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:01:57,451 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:01:57,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-17 12:01:57,452 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-09-17 12:01:57,452 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-17 12:01:57,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2023-09-17 12:01:57,452 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2023-09-17 12:01:57,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2023-09-17 12:01:57,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 12:01:57 BoogieIcfgContainer [2023-09-17 12:01:57,458 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 12:01:57,458 INFO L158 Benchmark]: Toolchain (without parser) took 50962.33ms. Allocated memory was 182.5MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 133.2MB in the beginning and 5.7GB in the end (delta: -5.5GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-09-17 12:01:57,459 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory was 130.3MB in the beginning and 130.2MB in the end (delta: 117.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 12:01:57,459 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.56ms. Allocated memory is still 182.5MB. Free memory was 132.7MB in the beginning and 121.6MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-09-17 12:01:57,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.58ms. Allocated memory is still 182.5MB. Free memory was 121.6MB in the beginning and 120.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 12:01:57,460 INFO L158 Benchmark]: Boogie Preprocessor took 25.39ms. Allocated memory is still 182.5MB. Free memory was 120.0MB in the beginning and 118.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-17 12:01:57,460 INFO L158 Benchmark]: RCFGBuilder took 526.80ms. Allocated memory is still 182.5MB. Free memory was 118.5MB in the beginning and 99.1MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-09-17 12:01:57,460 INFO L158 Benchmark]: BuchiAutomizer took 50179.91ms. Allocated memory was 182.5MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 99.1MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 2.0GB. Max. memory is 8.0GB. [2023-09-17 12:01:57,462 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 182.5MB. Free memory was 130.3MB in the beginning and 130.2MB in the end (delta: 117.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 191.56ms. Allocated memory is still 182.5MB. Free memory was 132.7MB in the beginning and 121.6MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.58ms. Allocated memory is still 182.5MB. Free memory was 121.6MB in the beginning and 120.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.39ms. Allocated memory is still 182.5MB. Free memory was 120.0MB in the beginning and 118.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 526.80ms. Allocated memory is still 182.5MB. Free memory was 118.5MB in the beginning and 99.1MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * BuchiAutomizer took 50179.91ms. Allocated memory was 182.5MB in the beginning and 7.8GB in the end (delta: 7.6GB). Free memory was 99.1MB in the beginning and 5.7GB in the end (delta: -5.6GB). Peak memory consumption was 2.0GB. 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function c2 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 2 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 50.0s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. Construction of modules took 0.0s. Büchi inclusion checks took 18.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 3.9s AutomataMinimizationTime, 1 MinimizatonAttempts, 4424 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 6.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 108 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 36 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 171 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital53 mio100 ax190 hnf100 lsp19 ukn100 mio100 lsp100 div469 bol100 ite100 ukn100 eq151 hnf95 smp39 dnf100 smp100 tf103 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 105ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2023-09-17 12:01:57,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...