/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_AUTOMATON -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:21:20,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:21:20,982 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-09 23:21:20,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:21:20,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:21:20,986 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:21:21,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:21:21,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:21:21,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:21:21,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:21:21,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:21:21,027 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:21:21,028 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:21:21,039 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:21:21,040 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:21:21,040 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:21:21,041 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:21:21,042 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:21:21,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:21:21,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:21:21,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:21:21,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:21:21,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:21:21,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:21:21,046 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:21:21,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:21:21,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:21:21,047 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:21:21,047 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:21:21,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:21:21,049 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:21:21,049 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:21:21,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:21:21,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:21:21,050 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:21:21,050 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:21:21,050 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:21:21,051 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:21:21,051 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_AUTOMATON [2024-02-09 23:21:21,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:21:21,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:21:21,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:21:21,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-09 23:21:21,425 INFO L274 PluginConnector]: CDTParser initialized [2024-02-09 23:21:21,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c [2024-02-09 23:21:22,582 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-09 23:21:22,730 INFO L384 CDTParser]: Found 1 translation units. [2024-02-09 23:21:22,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-nonblocking-cntr-alt.wvr.c [2024-02-09 23:21:22,738 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4fa7abc5/46842e1779b84ac1a9b075eb245920a4/FLAG9acb02b76 [2024-02-09 23:21:22,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4fa7abc5/46842e1779b84ac1a9b075eb245920a4 [2024-02-09 23:21:22,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:21:22,753 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-02-09 23:21:22,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-09 23:21:22,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-09 23:21:22,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-09 23:21:22,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 11:21:22" (1/1) ... [2024-02-09 23:21:22,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fb34170 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:21:22, skipping insertion in model container [2024-02-09 23:21:22,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.02 11:21:22" (1/1) ... [2024-02-09 23:21:22,782 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-09 23:21:22,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-09 23:21:22,964 INFO L202 MainTranslator]: Completed pre-run [2024-02-09 23:21:22,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-02-09 23:21:22,983 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2024-02-09 23:21:22,983 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2024-02-09 23:21:22,989 INFO L206 MainTranslator]: Completed translation [2024-02-09 23:21:22,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:21:22 WrapperNode [2024-02-09 23:21:22,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-09 23:21:22,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:21:22,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:21:22,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:21:22,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:21:22" (1/1) ... [2024-02-09 23:21:23,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:21:22" (1/1) ... [2024-02-09 23:21:23,019 INFO L138 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 58 [2024-02-09 23:21:23,019 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:21:23,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:21:23,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:21:23,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:21:23,027 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:21:22" (1/1) ... [2024-02-09 23:21:23,027 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:21:22" (1/1) ... [2024-02-09 23:21:23,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:21:22" (1/1) ... [2024-02-09 23:21:23,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:21:22" (1/1) ... [2024-02-09 23:21:23,041 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:21:22" (1/1) ... [2024-02-09 23:21:23,043 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:21:22" (1/1) ... [2024-02-09 23:21:23,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:21:22" (1/1) ... [2024-02-09 23:21:23,044 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:21:22" (1/1) ... [2024-02-09 23:21:23,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:21:23,046 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:21:23,046 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:21:23,046 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:21:23,047 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:21:22" (1/1) ... [2024-02-09 23:21:23,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:21:23,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:21:23,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:21:23,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-09 23:21:23,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-09 23:21:23,170 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-09 23:21:23,170 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-09 23:21:23,170 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-09 23:21:23,171 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-09 23:21:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-02-09 23:21:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-09 23:21:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-02-09 23:21:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-09 23:21:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-09 23:21:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:21:23,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:21:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-02-09 23:21:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-09 23:21:23,173 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:21:23,235 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:21:23,237 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:21:23,358 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:21:23,388 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:21:23,388 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-09 23:21:23,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:21:23 BoogieIcfgContainer [2024-02-09 23:21:23,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:21:23,391 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:21:23,391 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:21:23,393 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:21:23,394 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:21:23,394 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.02 11:21:22" (1/3) ... [2024-02-09 23:21:23,395 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68de74cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:21:23, skipping insertion in model container [2024-02-09 23:21:23,395 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:21:23,395 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.02 11:21:22" (2/3) ... [2024-02-09 23:21:23,395 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@68de74cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:21:23, skipping insertion in model container [2024-02-09 23:21:23,395 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:21:23,395 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:21:23" (3/3) ... [2024-02-09 23:21:23,396 INFO L332 chiAutomizerObserver]: Analyzing ICFG popl20-nonblocking-cntr-alt.wvr.c [2024-02-09 23:21:23,471 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-09 23:21:23,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 87 transitions, 188 flow [2024-02-09 23:21:23,523 INFO L124 PetriNetUnfolderBase]: 6/83 cut-off events. [2024-02-09 23:21:23,523 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:21:23,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 83 events. 6/83 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-02-09 23:21:23,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 87 transitions, 188 flow [2024-02-09 23:21:23,532 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 84 places, 83 transitions, 178 flow [2024-02-09 23:21:23,542 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:21:23,542 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:21:23,542 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:21:23,542 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:21:23,542 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:21:23,543 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:21:23,543 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:21:23,543 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-02-09 23:21:23,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2024-02-09 23:21:23,643 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 196 [2024-02-09 23:21:23,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:21:23,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:21:23,649 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] [2024-02-09 23:21:23,649 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-02-09 23:21:23,649 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:21:23,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 368 states, but on-demand construction may add more states [2024-02-09 23:21:23,658 INFO L131 ngComponentsAnalysis]: Automaton has 49 accepting balls. 196 [2024-02-09 23:21:23,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:21:23,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:21:23,659 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] [2024-02-09 23:21:23,660 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-02-09 23:21:23,669 INFO L748 eck$LassoCheckResult]: Stem: 89#[$Ultimate##0]don't care [174] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 92#[L-1]don't care [182] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 94#[L21]don't care [173] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 96#[L21-1]don't care [194] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 98#[L21-2]don't care [192] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 100#[L21-3]don't care [159] L21-3-->L21-4: Formula: (and (= 34 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 102#[L21-4]don't care [212] L21-4-->L38: Formula: (= 0 v_~M1~0_3) InVars {} OutVars{~M1~0=v_~M1~0_3} AuxVars[] AssignedVars[~M1~0] 104#[L38]don't care [213] L38-->L38-1: Formula: (= 0 v_~M2~0_3) InVars {} OutVars{~M2~0=v_~M2~0_3} AuxVars[] AssignedVars[~M2~0] 106#[L38-1]don't care [162] L38-1-->L-1-1: Formula: (= v_~counter~0_7 0) InVars {} OutVars{~counter~0=v_~counter~0_7} AuxVars[] AssignedVars[~counter~0] 108#[L-1-1]don't care [201] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 110#[L-1-2]don't care [203] L-1-2-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 112#[L65]don't care [215] L65-->L65-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 114#[L65-1]don't care [198] L65-1-->L65-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 116#[L65-2]don't care [181] L65-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 118#[L67]don't care [197] L67-->L67-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~M1~0_4) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~M1~0=v_~M1~0_4} AuxVars[] AssignedVars[~M1~0] 120#[L67-1]don't care [168] L67-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 122#[L68]don't care [200] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 124#[L68-1]don't care [166] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_3| v_~M2~0_4) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~M2~0=v_~M2~0_4, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~M2~0] 126#[L68-2]don't care [147] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 128#[L69]don't care [153] L69-->L69-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< 0 v_~M2~0_5) (< 0 v_~M1~0_5)) 1 0)) InVars {~M2~0=v_~M2~0_5, ~M1~0=v_~M1~0_5} OutVars{~M1~0=v_~M1~0_5, ~M2~0=v_~M2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 130#[L69-1]don't care [204] L69-1-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 132#[L34]don't care [170] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 134#[L35]don't care [196] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 138#[L34-1]don't care [190] L34-1-->L69-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 140#[L69-2]don't care [180] L69-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 142#[L72]don't care [214] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] 144#[L72-1]don't care [134] L72-1-->L72-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 146#[L72-2]don't care [143] L72-2-->L72-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_3|)) InVars {#valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 148#[L72-3]don't care [237] L72-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_4|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 150#[L72-4, $Ultimate##0]don't care [217] $Ultimate##0-->L41-4: Formula: (= v_thread1Thread1of1ForFork0_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 152#[L41-4, L72-4]don't care [2024-02-09 23:21:23,669 INFO L750 eck$LassoCheckResult]: Loop: 152#[L41-4, L72-4]don't care [218] L41-4-->L42: Formula: (< v_thread1Thread1of1ForFork0_~i~0_3 v_~M1~0_2) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_3, ~M1~0=v_~M1~0_2} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_3, ~M1~0=v_~M1~0_2} AuxVars[] AssignedVars[] 156#[L72-4, L42]don't care [221] L42-->L44: Formula: (= (+ v_~counter~0_26 1) v_~counter~0_25) InVars {~counter~0=v_~counter~0_26} OutVars{~counter~0=v_~counter~0_25, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[~counter~0, thread1Thread1of1ForFork0_#t~post2] 166#[L72-4, L44]don't care [223] L44-->L41-2: Formula: (= v_thread1Thread1of1ForFork0_~i~0_9 |v_thread1Thread1of1ForFork0_#t~post1_1|) InVars {thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_9, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 180#[L72-4, L41-2]don't care [225] L41-2-->L41-3: Formula: (= v_thread1Thread1of1ForFork0_~i~0_11 (+ |v_thread1Thread1of1ForFork0_#t~post1_3| 1)) InVars {thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} OutVars{thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_11, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_3|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_~i~0] 198#[L72-4, L41-3]don't care [227] L41-3-->L41-4: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_5|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1] 152#[L41-4, L72-4]don't care [2024-02-09 23:21:23,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:21:23,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1174692298, now seen corresponding path program 1 times [2024-02-09 23:21:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:21:23,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884905791] [2024-02-09 23:21:23,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:21:23,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:21:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:21:23,810 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:21:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:21:23,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:21:23,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:21:23,867 INFO L85 PathProgramCache]: Analyzing trace with hash 236762045, now seen corresponding path program 1 times [2024-02-09 23:21:23,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:21:23,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112189839] [2024-02-09 23:21:23,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:21:23,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:21:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:21:23,880 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:21:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:21:23,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:21:23,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:21:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1361358504, now seen corresponding path program 1 times [2024-02-09 23:21:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:21:23,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059607422] [2024-02-09 23:21:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:21:23,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:21:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:21:23,907 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:21:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:21:23,923 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:21:23,989 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:21:23,989 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:21:23,989 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:21:23,990 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:21:23,990 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2024-02-09 23:21:23,991 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:21:23,991 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:21:23,991 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:21:23,991 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-nonblocking-cntr-alt.wvr.c_BEv2_Iteration1_Loop [2024-02-09 23:21:23,991 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:21:23,991 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:21:24,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,021 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,027 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,031 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,034 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,038 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,125 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:21:24,126 INFO L404 LassoAnalysis]: Checking for nontermination... [2024-02-09 23:21:24,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:21:24,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:21:24,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:21:24,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-09 23:21:24,145 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:21:24,145 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:21:24,168 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:21:24,168 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~thread2.offset_1=1} Honda state: {v_rep#funAddr~thread2.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-02-09 23:21:24,173 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 [2024-02-09 23:21:24,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:21:24,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:21:24,176 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:21:24,181 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:21:24,182 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:21:24,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-09 23:21:24,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-09 23:21:24,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:21:24,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:21:24,204 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:21:24,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-09 23:21:24,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-09 23:21:24,209 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:21:24,241 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2024-02-09 23:21:24,241 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~counter~0=0} Honda state: {~counter~0=0} Generalized eigenvectors: [{~counter~0=4}, {~counter~0=-3}, {~counter~0=0}] Lambdas: [1, 1, 0] Nus: [0, 1] [2024-02-09 23:21:24,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-09 23:21:24,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:21:24,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:21:24,257 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:21:24,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-02-09 23:21:24,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:21:24,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-09 23:21:24,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-02-09 23:21:24,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:21:24,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:21:24,345 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:21:24,351 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-02-09 23:21:24,351 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-02-09 23:21:24,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-09 23:21:24,450 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-02-09 23:21:24,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-09 23:21:24,457 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:21:24,457 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:21:24,457 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:21:24,457 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:21:24,457 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:21:24,457 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:21:24,457 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:21:24,457 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:21:24,458 INFO L133 ssoRankerPreferences]: Filename of dumped script: popl20-nonblocking-cntr-alt.wvr.c_BEv2_Iteration1_Loop [2024-02-09 23:21:24,458 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:21:24,458 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:21:24,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,463 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,470 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,476 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,478 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-09 23:21:24,539 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:21:24,543 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:21:24,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:21:24,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:21:24,545 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:21:24,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-09 23:21:24,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:21:24,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:21:24,554 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:21:24,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:21:24,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:21:24,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:21:24,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:21:24,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:21:24,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:21:24,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-09 23:21:24,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:21:24,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:21:24,567 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:21:24,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-09 23:21:24,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:21:24,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:21:24,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:21:24,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:21:24,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:21:24,576 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:21:24,577 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:21:24,577 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:21:24,600 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:21:24,624 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-09 23:21:24,625 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-09 23:21:24,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:21:24,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:21:24,635 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:21:24,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-09 23:21:24,638 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:21:24,638 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-02-09 23:21:24,638 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:21:24,639 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~M1~0, thread1Thread1of1ForFork0_~i~0) = 1*~M1~0 - 1*thread1Thread1of1ForFork0_~i~0 Supporting invariants [] [2024-02-09 23:21:24,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-09 23:21:24,644 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-02-09 23:21:24,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:21:24,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:21:24,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:21:24,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:21:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:21:24,770 WARN L260 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:21:24,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:21:24,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:21:24,870 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-09 23:21:24,872 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 368 states, but on-demand construction may add more states Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:21:25,006 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 368 states, but on-demand construction may add more states. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1073 states and 3049 transitions. Complement of second has 10 states. [2024-02-09 23:21:25,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-02-09 23:21:25,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:21:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 181 transitions. [2024-02-09 23:21:25,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 181 transitions. Stem has 30 letters. Loop has 5 letters. [2024-02-09 23:21:25,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:21:25,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 181 transitions. Stem has 35 letters. Loop has 5 letters. [2024-02-09 23:21:25,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:21:25,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 181 transitions. Stem has 30 letters. Loop has 10 letters. [2024-02-09 23:21:25,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:21:25,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1073 states and 3049 transitions. [2024-02-09 23:21:25,038 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 86 [2024-02-09 23:21:25,050 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1073 states to 411 states and 1089 transitions. [2024-02-09 23:21:25,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 233 [2024-02-09 23:21:25,053 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2024-02-09 23:21:25,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 411 states and 1089 transitions. [2024-02-09 23:21:25,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-02-09 23:21:25,053 INFO L218 hiAutomatonCegarLoop]: Abstraction has 411 states and 1089 transitions. [2024-02-09 23:21:25,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states and 1089 transitions. [2024-02-09 23:21:25,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 342. [2024-02-09 23:21:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 342 states have (on average 2.625730994152047) internal successors, (898), 341 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-09 23:21:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 898 transitions. [2024-02-09 23:21:25,096 INFO L240 hiAutomatonCegarLoop]: Abstraction has 342 states and 898 transitions. [2024-02-09 23:21:25,097 INFO L428 stractBuchiCegarLoop]: Abstraction has 342 states and 898 transitions. [2024-02-09 23:21:25,097 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:21:25,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 342 states and 898 transitions. [2024-02-09 23:21:25,099 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 86 [2024-02-09 23:21:25,099 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-09 23:21:25,099 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-09 23:21:25,099 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] [2024-02-09 23:21:25,100 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-02-09 23:21:25,101 INFO L748 eck$LassoCheckResult]: Stem: 2630#[$Ultimate##0]don't care [174] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] 2632#[L-1]don't care [182] L-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] 2526#[L21]don't care [173] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] 2528#[L21-1]don't care [194] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] 2650#[L21-2]don't care [192] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] 2652#[L21-3]don't care [159] L21-3-->L21-4: Formula: (and (= 34 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] 2386#[L21-4]don't care [212] L21-4-->L38: Formula: (= 0 v_~M1~0_3) InVars {} OutVars{~M1~0=v_~M1~0_3} AuxVars[] AssignedVars[~M1~0] 2388#[L38]don't care [213] L38-->L38-1: Formula: (= 0 v_~M2~0_3) InVars {} OutVars{~M2~0=v_~M2~0_3} AuxVars[] AssignedVars[~M2~0] 2680#[L38-1]don't care [162] L38-1-->L-1-1: Formula: (= v_~counter~0_7 0) InVars {} OutVars{~counter~0=v_~counter~0_7} AuxVars[] AssignedVars[~counter~0] 2700#[L-1-1]don't care [201] L-1-1-->L-1-2: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 2712#[L-1-2]don't care [203] L-1-2-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 2714#[L65]don't care [215] L65-->L65-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 2340#[L65-1]don't care [198] L65-1-->L65-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 2342#[L65-2]don't care [181] L65-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 2640#[L67]don't care [197] L67-->L67-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~M1~0_4) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~M1~0=v_~M1~0_4} AuxVars[] AssignedVars[~M1~0] 2514#[L67-1]don't care [168] L67-1-->L68: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] 2516#[L68]don't care [200] L68-->L68-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 2512#[L68-1]don't care [166] L68-1-->L68-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_3| v_~M2~0_4) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{~M2~0=v_~M2~0_4, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[~M2~0] 2428#[L68-2]don't care [147] L68-2-->L69: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] 2144#[L69]don't care [153] L69-->L69-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (< 0 v_~M2~0_5) (< 0 v_~M1~0_5)) 1 0)) InVars {~M2~0=v_~M2~0_5, ~M1~0=v_~M1~0_5} OutVars{~M1~0=v_~M1~0_5, ~M2~0=v_~M2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2146#[L69-1]don't care [204] L69-1-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2592#[L34]don't care [170] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2626#[L35]don't care [196] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] 2708#[L34-1]don't care [190] L34-1-->L69-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] 2706#[L69-2]don't care [180] L69-2-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] 2390#[L72]don't care [214] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] 2392#[L72-1]don't care [134] L72-1-->L72-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 2608#[L72-2]don't care [143] L72-2-->L72-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (select |v_#valid_8| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_3|)) InVars {#valid=|v_#valid_8|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#valid=|v_#valid_8|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 2610#[L72-3]don't care [237] L72-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_7| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|} OutVars{thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_8|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_4|, thread1Thread1of1ForFork0_~i~0=v_thread1Thread1of1ForFork0_~i~0_14, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_7|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_~i~0, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 2500#[L72-4, $Ultimate##0]don't care [205] L72-4-->L72-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] 2504#[$Ultimate##0, L72-5]don't care [138] L72-5-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] 2300#[$Ultimate##0, L73]don't care [176] L73-->L73-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] 2302#[$Ultimate##0, L73-1]don't care [189] L73-1-->L73-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] 2558#[$Ultimate##0, L73-2]don't care [177] L73-2-->L73-3: Formula: (and (<= (+ 4 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (select |v_#length_8| |v_ULTIMATE.start_main_~#t2~0#1.base_3|)) (= (select |v_#valid_9| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) 1) (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_3|) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_6|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_5|, #length=|v_#length_8|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] 2314#[L73-3, $Ultimate##0]don't care [240] L73-3-->$Ultimate##0: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar1_2) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thread2Thread1of1ForFork1_thidvar0_2) (= 0 v_thread2Thread1of1ForFork1_thidvar2_2)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_4|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_12, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_6|, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_4|, thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_2, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_#t~post3, thread2Thread1of1ForFork1_#res.base, thread2Thread1of1ForFork1_thidvar2, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1] 2316#[L73-4, $Ultimate##0, $Ultimate##0]don't care [228] $Ultimate##0-->L54-1: Formula: (= v_thread2Thread1of1ForFork1_~i~1_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_~i~1] 2250#[L73-4, $Ultimate##0, L54-1]don't care [2024-02-09 23:21:25,101 INFO L750 eck$LassoCheckResult]: Loop: 2250#[L73-4, $Ultimate##0, L54-1]don't care [229] L54-1-->L53: Formula: (< v_thread2Thread1of1ForFork1_~i~1_3 v_~M2~0_2) InVars {~M2~0=v_~M2~0_2, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3} OutVars{~M2~0=v_~M2~0_2, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_3} AuxVars[] AssignedVars[] 2254#[L73-4, $Ultimate##0, L53]don't care [232] L53-->L54-1: Formula: (or (and (= v_~counter~0_Out_2 v_~counter~0_In_1) (= v_thread2Thread1of1ForFork1_~i~1_8 v_thread2Thread1of1ForFork1_~i~1_7) (= |v_thread2Thread1of1ForFork1_#t~post3_1| |v_thread2Thread1of1ForFork1_#t~post3_2|) (= |v_thread2Thread1of1ForFork1_#t~post4_2| |v_thread2Thread1of1ForFork1_#t~post4_1|) (<= v_~counter~0_In_1 0)) (and (< 0 v_~counter~0_In_1) (= v_~counter~0_In_1 (+ v_~counter~0_Out_2 1)) (= (+ v_thread2Thread1of1ForFork1_~i~1_7 1) v_thread2Thread1of1ForFork1_~i~1_8))) InVars {~counter~0=v_~counter~0_In_1, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_1|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_7, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_1|} OutVars{~counter~0=v_~counter~0_Out_2, thread2Thread1of1ForFork1_#t~post4=|v_thread2Thread1of1ForFork1_#t~post4_2|, thread2Thread1of1ForFork1_~i~1=v_thread2Thread1of1ForFork1_~i~1_8, thread2Thread1of1ForFork1_#t~post3=|v_thread2Thread1of1ForFork1_#t~post3_2|} AuxVars[] AssignedVars[~counter~0, thread2Thread1of1ForFork1_#t~post4, thread2Thread1of1ForFork1_~i~1, thread2Thread1of1ForFork1_#t~post3] 2250#[L73-4, $Ultimate##0, L54-1]don't care [2024-02-09 23:21:25,101 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:21:25,102 INFO L85 PathProgramCache]: Analyzing trace with hash -845650536, now seen corresponding path program 1 times [2024-02-09 23:21:25,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:21:25,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93158330] [2024-02-09 23:21:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:21:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:21:25,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:21:25,120 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:21:25,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:21:25,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:21:25,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:21:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash 8292, now seen corresponding path program 1 times [2024-02-09 23:21:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:21:25,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357129960] [2024-02-09 23:21:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:21:25,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:21:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:21:25,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:21:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:21:25,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:21:25,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:21:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash -921338821, now seen corresponding path program 1 times [2024-02-09 23:21:25,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:21:25,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367654817] [2024-02-09 23:21:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:21:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:21:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:21:25,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:21:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:21:25,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:21:25,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-02-09 23:21:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:21:25,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:21:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:21:25,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:21:25 BoogieIcfgContainer [2024-02-09 23:21:25,842 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:21:25,842 INFO L158 Benchmark]: Toolchain (without parser) took 3088.99ms. Allocated memory was 218.1MB in the beginning and 334.5MB in the end (delta: 116.4MB). Free memory was 164.9MB in the beginning and 276.6MB in the end (delta: -111.7MB). Peak memory consumption was 4.4MB. Max. memory is 8.0GB. [2024-02-09 23:21:25,843 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 218.1MB. Free memory is still 181.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:21:25,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.25ms. Allocated memory is still 218.1MB. Free memory was 164.7MB in the beginning and 182.4MB in the end (delta: -17.7MB). Peak memory consumption was 4.9MB. Max. memory is 8.0GB. [2024-02-09 23:21:25,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.39ms. Allocated memory is still 218.1MB. Free memory was 182.4MB in the beginning and 180.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-09 23:21:25,844 INFO L158 Benchmark]: Boogie Preprocessor took 25.86ms. Allocated memory is still 218.1MB. Free memory was 180.8MB in the beginning and 179.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-09 23:21:25,844 INFO L158 Benchmark]: RCFGBuilder took 343.65ms. Allocated memory is still 218.1MB. Free memory was 179.4MB in the beginning and 164.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2024-02-09 23:21:25,844 INFO L158 Benchmark]: BuchiAutomizer took 2451.35ms. Allocated memory was 218.1MB in the beginning and 334.5MB in the end (delta: 116.4MB). Free memory was 164.7MB in the beginning and 276.6MB in the end (delta: -111.9MB). Peak memory consumption was 5.8MB. Max. memory is 8.0GB. [2024-02-09 23:21:25,846 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.10ms. Allocated memory is still 218.1MB. Free memory is still 181.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.25ms. Allocated memory is still 218.1MB. Free memory was 164.7MB in the beginning and 182.4MB in the end (delta: -17.7MB). Peak memory consumption was 4.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.39ms. Allocated memory is still 218.1MB. Free memory was 182.4MB in the beginning and 180.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.86ms. Allocated memory is still 218.1MB. Free memory was 180.8MB in the beginning and 179.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 343.65ms. Allocated memory is still 218.1MB. Free memory was 179.4MB in the beginning and 164.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 2451.35ms. Allocated memory was 218.1MB in the beginning and 334.5MB in the end (delta: 116.4MB). Free memory was 164.7MB in the beginning and 276.6MB in the end (delta: -111.9MB). Peak memory consumption was 5.8MB. 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function ((-1 * i) + M1) and consists of 6 locations. The remainder module has 342 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 69 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 165 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 81 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37 IncrementalHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 84 mSDtfsCounter, 37 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax288 hnf100 lsp24 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 52]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L38] 0 int M1, M2, counter; VAL [M1=0, M2=0, counter=0] [L65] 0 pthread_t t1, t2; VAL [M1=0, M2=0, counter=0, t1={14259:0}, t2={14260:0}] [L67] 0 M1 = __VERIFIER_nondet_int() VAL [M1=1, M2=0, __VERIFIER_nondet_int()=1, counter=0, t1={14259:0}, t2={14260:0}] [L68] 0 M2 = __VERIFIER_nondet_int() VAL [M1=1, M2=1, __VERIFIER_nondet_int()=1, counter=0, t1={14259:0}, t2={14260:0}] [L69] CALL 0 assume_abort_if_not(M1 > 0 && M2 > 0) [L35] COND FALSE 0 !(!cond) VAL [M1=1, M2=1, \old(cond)=1, cond=1, counter=0] [L69] RET 0 assume_abort_if_not(M1 > 0 && M2 > 0) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [M1=1, M2=1, counter=0, pthread_create(&t1, 0, thread1, 0)=21651, t1={14259:0}, t2={14260:0}] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [M1=1, M2=1, counter=0, pthread_create(&t2, 0, thread2, 0)=21652, t1={14259:0}, t2={14260:0}] [L51] 2 int i = 0; VAL [M1=1, M2=1, counter=0, i=0] Loop: [L52] COND TRUE i < M2 [L54] COND FALSE !(counter > 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 52]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L38] 0 int M1, M2, counter; VAL [M1=0, M2=0, counter=0] [L65] 0 pthread_t t1, t2; VAL [M1=0, M2=0, counter=0, t1={14259:0}, t2={14260:0}] [L67] 0 M1 = __VERIFIER_nondet_int() VAL [M1=1, M2=0, __VERIFIER_nondet_int()=1, counter=0, t1={14259:0}, t2={14260:0}] [L68] 0 M2 = __VERIFIER_nondet_int() VAL [M1=1, M2=1, __VERIFIER_nondet_int()=1, counter=0, t1={14259:0}, t2={14260:0}] [L69] CALL 0 assume_abort_if_not(M1 > 0 && M2 > 0) [L35] COND FALSE 0 !(!cond) VAL [M1=1, M2=1, \old(cond)=1, cond=1, counter=0] [L69] RET 0 assume_abort_if_not(M1 > 0 && M2 > 0) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [M1=1, M2=1, counter=0, pthread_create(&t1, 0, thread1, 0)=21651, t1={14259:0}, t2={14260:0}] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [M1=1, M2=1, counter=0, pthread_create(&t2, 0, thread2, 0)=21652, t1={14259:0}, t2={14260:0}] [L51] 2 int i = 0; VAL [M1=1, M2=1, counter=0, i=0] Loop: [L52] COND TRUE i < M2 [L54] COND FALSE !(counter > 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-02-09 23:21:25,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...