/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-atomic/dekker.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:17:19,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:17:19,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:17:19,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:17:19,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:17:19,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:17:19,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:17:19,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:17:19,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:17:19,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:17:19,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:17:19,413 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:17:19,413 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:17:19,413 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:17:19,413 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:17:19,413 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:17:19,413 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:17:19,413 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:17:19,413 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:17:19,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:17:19,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:17:19,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:17:19,414 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:17:19,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:17:19,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:17:19,415 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:17:19,415 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:17:19,415 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:17:19,415 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:17:19,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:17:19,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:17:19,629 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:17:19,629 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 18:17:19,630 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 18:17:19,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-atomic/dekker.i [2025-04-26 18:17:20,905 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fc86dac92/f1bce33ff89b4f8ab914adc8fe4dcc3a/FLAGe22d2d076 [2025-04-26 18:17:21,158 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 18:17:21,159 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i [2025-04-26 18:17:21,173 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fc86dac92/f1bce33ff89b4f8ab914adc8fe4dcc3a/FLAGe22d2d076 [2025-04-26 18:17:21,955 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fc86dac92/f1bce33ff89b4f8ab914adc8fe4dcc3a [2025-04-26 18:17:21,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:17:21,958 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 18:17:21,964 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 18:17:21,964 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 18:17:21,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 18:17:21,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:17:21" (1/1) ... [2025-04-26 18:17:21,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7517c1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:21, skipping insertion in model container [2025-04-26 18:17:21,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:17:21" (1/1) ... [2025-04-26 18:17:21,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 18:17:22,233 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i[32914,32927] [2025-04-26 18:17:22,237 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i[33150,33163] [2025-04-26 18:17:22,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:17:22,250 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 18:17:22,307 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i[32914,32927] [2025-04-26 18:17:22,308 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/dekker.i[33150,33163] [2025-04-26 18:17:22,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:17:22,338 INFO L204 MainTranslator]: Completed translation [2025-04-26 18:17:22,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:22 WrapperNode [2025-04-26 18:17:22,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 18:17:22,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:17:22,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:17:22,340 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:17:22,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:22" (1/1) ... [2025-04-26 18:17:22,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:22" (1/1) ... [2025-04-26 18:17:22,368 INFO L138 Inliner]: procedures = 167, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2025-04-26 18:17:22,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:17:22,370 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:17:22,370 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:17:22,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:17:22,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:22" (1/1) ... [2025-04-26 18:17:22,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:22" (1/1) ... [2025-04-26 18:17:22,376 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:22" (1/1) ... [2025-04-26 18:17:22,376 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:22" (1/1) ... [2025-04-26 18:17:22,378 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:22" (1/1) ... [2025-04-26 18:17:22,379 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:22" (1/1) ... [2025-04-26 18:17:22,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:22" (1/1) ... [2025-04-26 18:17:22,381 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:22" (1/1) ... [2025-04-26 18:17:22,382 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:22" (1/1) ... [2025-04-26 18:17:22,384 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:17:22,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:17:22,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:17:22,384 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:17:22,387 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:22" (1/1) ... [2025-04-26 18:17:22,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:17:22,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:22,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:22,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:17:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-04-26 18:17:22,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-04-26 18:17:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-26 18:17:22,433 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-26 18:17:22,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 18:17:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 18:17:22,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:17:22,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:17:22,434 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:17:22,525 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:17:22,526 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:17:22,606 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:17:22,606 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:17:22,614 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:17:22,614 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:17:22,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:17:22 BoogieIcfgContainer [2025-04-26 18:17:22,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:17:22,615 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:17:22,617 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:17:22,621 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:17:22,621 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:17:22,621 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 06:17:21" (1/3) ... [2025-04-26 18:17:22,622 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ff3b32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:17:22, skipping insertion in model container [2025-04-26 18:17:22,622 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:17:22,622 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:22" (2/3) ... [2025-04-26 18:17:22,622 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ff3b32b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:17:22, skipping insertion in model container [2025-04-26 18:17:22,622 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:17:22,622 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:17:22" (3/3) ... [2025-04-26 18:17:22,623 INFO L376 chiAutomizerObserver]: Analyzing ICFG dekker.i [2025-04-26 18:17:22,673 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:17:22,706 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:17:22,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:17:22,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:22,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:17:22,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:17:22,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 82 transitions, 178 flow [2025-04-26 18:17:22,801 INFO L116 PetriNetUnfolderBase]: 9/78 cut-off events. [2025-04-26 18:17:22,803 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:17:22,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 9/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 52. Up to 3 conditions per place. [2025-04-26 18:17:22,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 82 transitions, 178 flow [2025-04-26 18:17:22,810 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 78 transitions, 168 flow [2025-04-26 18:17:22,810 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 76 places, 78 transitions, 168 flow [2025-04-26 18:17:22,811 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 78 transitions, 168 flow [2025-04-26 18:17:22,870 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 910 states, 906 states have (on average 2.883002207505519) internal successors, (in total 2612), 909 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:22,872 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 910 states, 906 states have (on average 2.883002207505519) internal successors, (in total 2612), 909 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:22,874 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:17:22,942 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1301#[thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, L769, L783-5]true [2025-04-26 18:17:22,943 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1131#[thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, L783-4, L769]true [2025-04-26 18:17:22,953 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1789#[thr1EXIT, L784, L769]true [2025-04-26 18:17:22,954 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1719#[thr1EXIT, L769, L783-5]true [2025-04-26 18:17:22,955 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1621#[thr1EXIT, L783-4, L769]true [2025-04-26 18:17:22,962 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1525#[L784, L760, L769]true [2025-04-26 18:17:22,962 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1731#[thr1FINAL, L769, L784]true [2025-04-26 18:17:22,965 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1631#[thr1FINAL, L769, L783-5]true [2025-04-26 18:17:22,965 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1365#[L760, L769, L783-5]true [2025-04-26 18:17:22,966 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1185#[L760, L783-4, L769]true [2025-04-26 18:17:22,967 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1503#[thr1FINAL, L783-4, L769]true [2025-04-26 18:17:22,987 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1195#[L759-3, L769, L783-5]true [2025-04-26 18:17:22,988 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1013#[L759-3, L783-4, L769]true [2025-04-26 18:17:22,999 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1023#[L759, L769, L783-5]true [2025-04-26 18:17:23,000 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 853#[L759, L783-4, L769]true [2025-04-26 18:17:23,017 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 863#[L758, L769, L783-5]true [2025-04-26 18:17:23,018 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 713#[L758, L783-4, L769]true [2025-04-26 18:17:23,033 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1425#[thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, L754, L783-5]true [2025-04-26 18:17:23,034 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1251#[thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, L754, L783-4]true [2025-04-26 18:17:23,044 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1769#[L784, L754, thr2FINAL]true [2025-04-26 18:17:23,047 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1685#[L784, L754, L776]true [2025-04-26 18:17:23,049 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1771#[L754, thr2EXIT, L783-5]true [2025-04-26 18:17:23,049 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1687#[L754, thr2FINAL, L783-5]true [2025-04-26 18:17:23,049 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1575#[L754, L776, L783-5]true [2025-04-26 18:17:23,051 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1689#[L754, thr2EXIT, L783-4]true [2025-04-26 18:17:23,052 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1577#[L754, thr2FINAL, L783-4]true [2025-04-26 18:17:23,052 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1431#[L754, L783-4, L776]true [2025-04-26 18:17:23,054 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1571#[L784, L754, L775]true [2025-04-26 18:17:23,054 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1427#[L754, L775, L783-5]true [2025-04-26 18:17:23,055 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1253#[L754, L783-4, L775]true [2025-04-26 18:17:23,060 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1247#[L754, L774-3, L783-5]true [2025-04-26 18:17:23,061 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1065#[L754, L774-3, L783-4]true [2025-04-26 18:17:23,062 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1059#[L754, L774, L783-5]true [2025-04-26 18:17:23,063 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 885#[L754, L783-4, L774]true [2025-04-26 18:17:23,063 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 881#[L754, L773, L783-5]true [2025-04-26 18:17:23,064 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 725#[L754, L783-4, L773]true [2025-04-26 18:17:23,077 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 911#[L769, L752, L783-5]true [2025-04-26 18:17:23,078 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 723#[L754, L767-1, L783-5]true [2025-04-26 18:17:23,078 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1429#[L754, L770, L783-5]true [2025-04-26 18:17:23,078 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1249#[L754, L769, L783-5]true [2025-04-26 18:17:23,078 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1061#[L754, L768, L783-5]true [2025-04-26 18:17:23,079 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1077#[L753, L769, L783-5]true [2025-04-26 18:17:23,079 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 617#[L752-1, L768, L783-5]true [2025-04-26 18:17:23,079 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 417#[L752-1, L767-1, L783-5]true [2025-04-26 18:17:23,079 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 761#[L752-1, L769, L783-5]true [2025-04-26 18:17:23,079 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1411#[L755, L769, L783-5]true [2025-04-26 18:17:23,080 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 623#[L752-1, L783-4, L769]true [2025-04-26 18:17:23,081 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1255#[L754, L783-4, L770]true [2025-04-26 18:17:23,081 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1067#[L754, L783-4, L769]true [2025-04-26 18:17:23,081 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 887#[L754, L768, L783-4]true [2025-04-26 18:17:23,081 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 727#[L767, L754, L783-4]true [2025-04-26 18:17:23,081 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 901#[L753, L783-4, L769]true [2025-04-26 18:17:23,081 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 507#[L752-1, L768, L783-4]true [2025-04-26 18:17:23,081 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 357#[L752-1, L767-1, L783-4]true [2025-04-26 18:17:23,081 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 767#[L752-1, L783-4, L770]true [2025-04-26 18:17:23,081 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 751#[L783-4, L769, L752]true [2025-04-26 18:17:23,081 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1239#[L755, L783-4, L769]true [2025-04-26 18:17:23,082 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 589#[L754, L765, L783-5]true [2025-04-26 18:17:23,083 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 483#[L754, L783-4, L765]true [2025-04-26 18:17:23,093 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 633#[L750, L769, L783-5]true [2025-04-26 18:17:23,093 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 521#[L750, L783-4, L769]true [2025-04-26 18:17:23,099 WARN L140 AmpleReduction]: Number of pruned transitions: 701 [2025-04-26 18:17:23,099 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 61 [2025-04-26 18:17:23,099 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 110 [2025-04-26 18:17:23,100 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:222 [2025-04-26 18:17:23,100 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:473 [2025-04-26 18:17:23,100 WARN L145 AmpleReduction]: Times succ was already a loop node:150 [2025-04-26 18:17:23,100 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:101 [2025-04-26 18:17:23,100 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:17:23,102 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 745 states, 741 states have (on average 1.941970310391363) internal successors, (in total 1439), 744 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:23,108 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:17:23,108 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:17:23,108 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:17:23,108 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:17:23,108 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:17:23,108 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:17:23,108 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:17:23,108 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:17:23,110 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 745 states, 741 states have (on average 1.941970310391363) internal successors, (in total 1439), 744 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:23,144 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 365 [2025-04-26 18:17:23,145 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:23,145 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:23,151 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] [2025-04-26 18:17:23,151 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:17:23,152 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:17:23,153 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 745 states, 741 states have (on average 1.941970310391363) internal successors, (in total 1439), 744 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:23,162 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 365 [2025-04-26 18:17:23,162 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:23,162 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:23,163 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] [2025-04-26 18:17:23,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:17:23,167 INFO L752 eck$LassoCheckResult]: Stem: "[151] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[159] L-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[153] L16-->L16-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[]" "[120] L16-1-->L16-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[]" "[189] L16-2-->L16-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[]" "[167] L16-3-->L16-4: Formula: (and (= 9 (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[]" "[168] L16-4-->L746: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0]" "[137] L746-->L747: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0]" "[129] L747-->L748: Formula: (= v_~turn~0_11 0) InVars {} OutVars{~turn~0=v_~turn~0_11} AuxVars[] AssignedVars[~turn~0]" "[157] L748-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[183] 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]" "[185] L-1-2-->L780: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~t2~0#1]" "[122] L780-->L780-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[124] L780-1-->L781: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[149] L781-->L781-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~turn~0_12) (<= v_~turn~0_12 1)) 1 0)) InVars {~turn~0=v_~turn~0_12} OutVars{~turn~0=v_~turn~0_12, 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]" "[132] L781-1-->L2: 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]" "[121] L2-->L3: 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]" "[182] L3-->L2-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[]" "[152] L2-1-->L781-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]" "[135] L781-2-->L782: 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]" "[177] L782-->L782-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[126] L782-1-->L782-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[140] L782-2-->L782-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[236] L782-3-->$Ultimate##0: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset]" "[215] $Ultimate##0-->L750: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_1 |v_thr1Thread1of1ForFork0_#in~_.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_1| v_thr1Thread1of1ForFork0_~_.offset_1)) InVars {thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_1, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_~_.offset]" "[216] L750-->L752-1: Formula: (= v_~flag1~0_3 1) InVars {} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[~flag1~0]" [2025-04-26 18:17:23,167 INFO L754 eck$LassoCheckResult]: Loop: "[218] L752-1-->L752: Formula: (<= 1 v_~flag2~0_5) InVars {~flag2~0=v_~flag2~0_5} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[]" "[221] L752-->L752-1: Formula: (= v_~turn~0_10 0) InVars {~turn~0=v_~turn~0_10} OutVars{~turn~0=v_~turn~0_10} AuxVars[] AssignedVars[]" [2025-04-26 18:17:23,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:23,174 INFO L85 PathProgramCache]: Analyzing trace with hash 827000956, now seen corresponding path program 1 times [2025-04-26 18:17:23,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:23,178 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968057483] [2025-04-26 18:17:23,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:23,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:23,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:17:23,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:17:23,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:23,244 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:23,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:17:23,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:17:23,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:23,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:23,272 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:23,274 INFO L85 PathProgramCache]: Analyzing trace with hash 7940, now seen corresponding path program 1 times [2025-04-26 18:17:23,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:23,275 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689640569] [2025-04-26 18:17:23,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:23,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:23,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:17:23,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:17:23,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:23,284 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:23,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:17:23,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:17:23,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:23,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:23,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:23,289 INFO L85 PathProgramCache]: Analyzing trace with hash 178975935, now seen corresponding path program 1 times [2025-04-26 18:17:23,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:23,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762963596] [2025-04-26 18:17:23,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:23,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:23,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:17:23,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:17:23,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:23,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:17:23,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:17:23,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762963596] [2025-04-26 18:17:23,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762963596] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:17:23,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:17:23,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:17:23,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537897271] [2025-04-26 18:17:23,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:17:23,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:17:23,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:17:23,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:17:23,436 INFO L87 Difference]: Start difference. First operand has 745 states, 741 states have (on average 1.941970310391363) internal successors, (in total 1439), 744 states have internal predecessors, (1439), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (in total 28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:23,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:17:23,475 INFO L93 Difference]: Finished difference Result 654 states and 1180 transitions. [2025-04-26 18:17:23,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 654 states and 1180 transitions. [2025-04-26 18:17:23,483 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 278 [2025-04-26 18:17:23,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 654 states to 419 states and 847 transitions. [2025-04-26 18:17:23,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 419 [2025-04-26 18:17:23,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 419 [2025-04-26 18:17:23,511 INFO L74 IsDeterministic]: Start isDeterministic. Operand 419 states and 847 transitions. [2025-04-26 18:17:23,516 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:17:23,516 INFO L218 hiAutomatonCegarLoop]: Abstraction has 419 states and 847 transitions. [2025-04-26 18:17:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states and 847 transitions. [2025-04-26 18:17:23,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2025-04-26 18:17:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 419 states have (on average 2.0214797136038185) internal successors, (in total 847), 418 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:23,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 847 transitions. [2025-04-26 18:17:23,543 INFO L240 hiAutomatonCegarLoop]: Abstraction has 419 states and 847 transitions. [2025-04-26 18:17:23,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:17:23,547 INFO L438 stractBuchiCegarLoop]: Abstraction has 419 states and 847 transitions. [2025-04-26 18:17:23,547 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:17:23,547 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 419 states and 847 transitions. [2025-04-26 18:17:23,549 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 278 [2025-04-26 18:17:23,549 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:23,549 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:23,549 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] [2025-04-26 18:17:23,549 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:17:23,551 INFO L752 eck$LassoCheckResult]: Stem: "[151] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[159] L-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[153] L16-->L16-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[]" "[120] L16-1-->L16-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[]" "[189] L16-2-->L16-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[]" "[167] L16-3-->L16-4: Formula: (and (= 9 (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[]" "[168] L16-4-->L746: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0]" "[137] L746-->L747: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0]" "[129] L747-->L748: Formula: (= v_~turn~0_11 0) InVars {} OutVars{~turn~0=v_~turn~0_11} AuxVars[] AssignedVars[~turn~0]" "[157] L748-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[183] 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]" "[185] L-1-2-->L780: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~t2~0#1]" "[122] L780-->L780-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[124] L780-1-->L781: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[149] L781-->L781-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~turn~0_12) (<= v_~turn~0_12 1)) 1 0)) InVars {~turn~0=v_~turn~0_12} OutVars{~turn~0=v_~turn~0_12, 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]" "[132] L781-1-->L2: 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]" "[121] L2-->L3: 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]" "[182] L3-->L2-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[]" "[152] L2-1-->L781-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]" "[135] L781-2-->L782: 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]" "[177] L782-->L782-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[126] L782-1-->L782-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[140] L782-2-->L782-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[236] L782-3-->$Ultimate##0: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset]" "[215] $Ultimate##0-->L750: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_1 |v_thr1Thread1of1ForFork0_#in~_.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_1| v_thr1Thread1of1ForFork0_~_.offset_1)) InVars {thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_1, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_~_.offset]" "[169] L782-4-->L782-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[192] L782-5-->L783: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[127] L783-->L783-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[175] L783-1-->L783-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[170] L783-2-->L783-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre11#1_3|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[239] L783-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|) (= v_thr2Thread1of1ForFork1_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~_.base]" "[196] $Ultimate##0-->L765: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_1 |v_thr2Thread1of1ForFork1_#in~_.offset_1|) (= |v_thr2Thread1of1ForFork1_#in~_.base_1| v_thr2Thread1of1ForFork1_~_.base_1)) InVars {thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_1, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_~_.base]" "[197] L765-->L767-1: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" [2025-04-26 18:17:23,551 INFO L754 eck$LassoCheckResult]: Loop: "[199] L767-1-->L767: Formula: (<= 1 v_~flag1~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1} AuxVars[] AssignedVars[]" "[202] L767-->L767-1: Formula: (= v_~turn~0_5 1) InVars {~turn~0=v_~turn~0_5} OutVars{~turn~0=v_~turn~0_5} AuxVars[] AssignedVars[]" [2025-04-26 18:17:23,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:23,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1412607831, now seen corresponding path program 1 times [2025-04-26 18:17:23,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:23,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098862536] [2025-04-26 18:17:23,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:23,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:23,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 18:17:23,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 18:17:23,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:23,566 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:23,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 18:17:23,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 18:17:23,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:23,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:23,584 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:23,584 INFO L85 PathProgramCache]: Analyzing trace with hash 7332, now seen corresponding path program 1 times [2025-04-26 18:17:23,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:23,584 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402295953] [2025-04-26 18:17:23,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:23,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:17:23,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:17:23,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:23,590 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:23,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:17:23,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:17:23,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:23,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:23,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:23,597 INFO L85 PathProgramCache]: Analyzing trace with hash -306453684, now seen corresponding path program 1 times [2025-04-26 18:17:23,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:23,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861321565] [2025-04-26 18:17:23,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:23,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:23,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-26 18:17:23,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-26 18:17:23,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:17:23,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:17:23,663 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861321565] [2025-04-26 18:17:23,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861321565] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:17:23,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:17:23,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:17:23,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515364612] [2025-04-26 18:17:23,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:17:23,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:17:23,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:17:23,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:17:23,678 INFO L87 Difference]: Start difference. First operand 419 states and 847 transitions. cyclomatic complexity: 474 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (in total 35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:17:23,696 INFO L93 Difference]: Finished difference Result 403 states and 793 transitions. [2025-04-26 18:17:23,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 403 states and 793 transitions. [2025-04-26 18:17:23,698 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 235 [2025-04-26 18:17:23,700 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 403 states to 366 states and 739 transitions. [2025-04-26 18:17:23,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 366 [2025-04-26 18:17:23,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 366 [2025-04-26 18:17:23,701 INFO L74 IsDeterministic]: Start isDeterministic. Operand 366 states and 739 transitions. [2025-04-26 18:17:23,702 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:17:23,702 INFO L218 hiAutomatonCegarLoop]: Abstraction has 366 states and 739 transitions. [2025-04-26 18:17:23,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states and 739 transitions. [2025-04-26 18:17:23,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-04-26 18:17:23,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 366 states have (on average 2.019125683060109) internal successors, (in total 739), 365 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:17:23,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 739 transitions. [2025-04-26 18:17:23,710 INFO L240 hiAutomatonCegarLoop]: Abstraction has 366 states and 739 transitions. [2025-04-26 18:17:23,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:17:23,711 INFO L438 stractBuchiCegarLoop]: Abstraction has 366 states and 739 transitions. [2025-04-26 18:17:23,711 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:17:23,711 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 366 states and 739 transitions. [2025-04-26 18:17:23,712 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 235 [2025-04-26 18:17:23,713 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:23,713 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:23,714 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] [2025-04-26 18:17:23,714 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:17:23,715 INFO L752 eck$LassoCheckResult]: Stem: "[151] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[159] L-1-->L16: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[153] L16-->L16-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[]" "[120] L16-1-->L16-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[]" "[189] L16-2-->L16-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[]" "[167] L16-3-->L16-4: Formula: (and (= 9 (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[]" "[168] L16-4-->L746: Formula: (= v_~flag1~0_7 0) InVars {} OutVars{~flag1~0=v_~flag1~0_7} AuxVars[] AssignedVars[~flag1~0]" "[137] L746-->L747: Formula: (= v_~flag2~0_7 0) InVars {} OutVars{~flag2~0=v_~flag2~0_7} AuxVars[] AssignedVars[~flag2~0]" "[129] L747-->L748: Formula: (= v_~turn~0_11 0) InVars {} OutVars{~turn~0=v_~turn~0_11} AuxVars[] AssignedVars[~turn~0]" "[157] L748-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[183] 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]" "[185] L-1-2-->L780: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_1|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_1|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre11#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_#t~nondet12#1, ULTIMATE.start_main_~t2~0#1]" "[122] L780-->L780-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[124] L780-1-->L781: Formula: true InVars {} OutVars{ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[149] L781-->L781-1: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~turn~0_12) (<= v_~turn~0_12 1)) 1 0)) InVars {~turn~0=v_~turn~0_12} OutVars{~turn~0=v_~turn~0_12, 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]" "[132] L781-1-->L2: 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]" "[121] L2-->L3: 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]" "[182] L3-->L2-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[]" "[152] L2-1-->L781-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]" "[135] L781-2-->L782: 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]" "[177] L782-->L782-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[126] L782-1-->L782-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[140] L782-2-->L782-3: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_3| |v_ULTIMATE.start_main_~t1~0#1_3|) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_3|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t1~0#1]" "[236] L782-3-->$Ultimate##0: Formula: (and (= 0 |v_thr1Thread1of1ForFork0_#in~_.base_4|) (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork0_thidvar0_2) (= |v_thr1Thread1of1ForFork0_#in~_.offset_4| 0) (= v_thr1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_4, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_4|, thr1Thread1of1ForFork0_#res.base=|v_thr1Thread1of1ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork0_thidvar0=v_thr1Thread1of1ForFork0_thidvar0_2, thr1Thread1of1ForFork0_thidvar1=v_thr1Thread1of1ForFork0_thidvar1_2, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_4|, thr1Thread1of1ForFork0_#res.offset=|v_thr1Thread1of1ForFork0_#res.offset_4|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_4} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_#in~_.offset, thr1Thread1of1ForFork0_#res.base, thr1Thread1of1ForFork0_thidvar0, thr1Thread1of1ForFork0_thidvar1, thr1Thread1of1ForFork0_#in~_.base, thr1Thread1of1ForFork0_#res.offset, thr1Thread1of1ForFork0_~_.offset]" "[215] $Ultimate##0-->L750: Formula: (and (= v_thr1Thread1of1ForFork0_~_.base_1 |v_thr1Thread1of1ForFork0_#in~_.base_1|) (= |v_thr1Thread1of1ForFork0_#in~_.offset_1| v_thr1Thread1of1ForFork0_~_.offset_1)) InVars {thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|} OutVars{thr1Thread1of1ForFork0_~_.base=v_thr1Thread1of1ForFork0_~_.base_1, thr1Thread1of1ForFork0_#in~_.offset=|v_thr1Thread1of1ForFork0_#in~_.offset_1|, thr1Thread1of1ForFork0_#in~_.base=|v_thr1Thread1of1ForFork0_#in~_.base_1|, thr1Thread1of1ForFork0_~_.offset=v_thr1Thread1of1ForFork0_~_.offset_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork0_~_.base, thr1Thread1of1ForFork0_~_.offset]" "[216] L750-->L752-1: Formula: (= v_~flag1~0_3 1) InVars {} OutVars{~flag1~0=v_~flag1~0_3} AuxVars[] AssignedVars[~flag1~0]" "[169] L782-4-->L782-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1]" "[192] L782-5-->L783: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1]" "[127] L783-->L783-1: Formula: (= |v_ULTIMATE.start_main_#t~pre11#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_2|, #pthreadsForks=|v_#pthreadsForks_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre11#1]" "[175] L783-1-->L783-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[170] L783-2-->L783-3: Formula: (= |v_ULTIMATE.start_main_~t2~0#1_3| |v_ULTIMATE.start_main_#t~pre11#1_3|) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|} OutVars{ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_3|, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~t2~0#1]" "[239] L783-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork1_thidvar2_2 0) (= |v_thr2Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr2Thread1of1ForFork1_#in~_.offset_4| 0) (= v_thr2Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|) (= v_thr2Thread1of1ForFork1_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thr2Thread1of1ForFork1_thidvar0=v_thr2Thread1of1ForFork1_thidvar0_2, thr2Thread1of1ForFork1_thidvar1=v_thr2Thread1of1ForFork1_thidvar1_2, thr2Thread1of1ForFork1_thidvar2=v_thr2Thread1of1ForFork1_thidvar2_2, thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_4, thr2Thread1of1ForFork1_#res.base=|v_thr2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_4|, thr2Thread1of1ForFork1_#res.offset=|v_thr2Thread1of1ForFork1_#res.offset_4|, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_4|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_thidvar0, thr2Thread1of1ForFork1_thidvar1, thr2Thread1of1ForFork1_thidvar2, thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_#res.base, thr2Thread1of1ForFork1_#in~_.offset, thr2Thread1of1ForFork1_#res.offset, thr2Thread1of1ForFork1_#in~_.base, thr2Thread1of1ForFork1_~_.base]" "[196] $Ultimate##0-->L765: Formula: (and (= v_thr2Thread1of1ForFork1_~_.offset_1 |v_thr2Thread1of1ForFork1_#in~_.offset_1|) (= |v_thr2Thread1of1ForFork1_#in~_.base_1| v_thr2Thread1of1ForFork1_~_.base_1)) InVars {thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|} OutVars{thr2Thread1of1ForFork1_~_.offset=v_thr2Thread1of1ForFork1_~_.offset_1, thr2Thread1of1ForFork1_#in~_.base=|v_thr2Thread1of1ForFork1_#in~_.base_1|, thr2Thread1of1ForFork1_#in~_.offset=|v_thr2Thread1of1ForFork1_#in~_.offset_1|, thr2Thread1of1ForFork1_~_.base=v_thr2Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork1_~_.offset, thr2Thread1of1ForFork1_~_.base]" "[197] L765-->L767-1: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" [2025-04-26 18:17:23,715 INFO L754 eck$LassoCheckResult]: Loop: "[218] L752-1-->L752: Formula: (<= 1 v_~flag2~0_5) InVars {~flag2~0=v_~flag2~0_5} OutVars{~flag2~0=v_~flag2~0_5} AuxVars[] AssignedVars[]" "[221] L752-->L752-1: Formula: (= v_~turn~0_10 0) InVars {~turn~0=v_~turn~0_10} OutVars{~turn~0=v_~turn~0_10} AuxVars[] AssignedVars[]" [2025-04-26 18:17:23,715 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:23,715 INFO L85 PathProgramCache]: Analyzing trace with hash -840546999, now seen corresponding path program 1 times [2025-04-26 18:17:23,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:23,715 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218900201] [2025-04-26 18:17:23,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:23,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:23,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 18:17:23,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 18:17:23,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:23,729 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:23,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 18:17:23,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 18:17:23,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:23,739 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:23,739 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:23,739 INFO L85 PathProgramCache]: Analyzing trace with hash 7940, now seen corresponding path program 2 times [2025-04-26 18:17:23,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:23,739 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128619953] [2025-04-26 18:17:23,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:17:23,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:23,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:17:23,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:17:23,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:17:23,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:23,744 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:23,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:17:23,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:17:23,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:23,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:23,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:23,747 INFO L85 PathProgramCache]: Analyzing trace with hash -311807412, now seen corresponding path program 1 times [2025-04-26 18:17:23,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:23,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947371725] [2025-04-26 18:17:23,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:23,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:23,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-26 18:17:23,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-26 18:17:23,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:23,757 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:23,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-26 18:17:23,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-26 18:17:23,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:23,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:23,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:24,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 18:17:24,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 18:17:24,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:24,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:24,170 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:24,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-26 18:17:24,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-26 18:17:24,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:24,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:24,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:17:24,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:17:24 BoogieIcfgContainer [2025-04-26 18:17:24,241 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:17:24,241 INFO L158 Benchmark]: Toolchain (without parser) took 2283.26ms. Allocated memory is still 125.8MB. Free memory was 90.0MB in the beginning and 37.9MB in the end (delta: 52.1MB). Peak memory consumption was 51.3MB. Max. memory is 8.0GB. [2025-04-26 18:17:24,241 INFO L158 Benchmark]: CDTParser took 0.65ms. Allocated memory is still 167.8MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:17:24,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.56ms. Allocated memory is still 125.8MB. Free memory was 90.0MB in the beginning and 68.0MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-26 18:17:24,242 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.17ms. Allocated memory is still 125.8MB. Free memory was 68.0MB in the beginning and 66.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:17:24,242 INFO L158 Benchmark]: Boogie Preprocessor took 14.26ms. Allocated memory is still 125.8MB. Free memory was 66.0MB in the beginning and 65.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:17:24,242 INFO L158 Benchmark]: RCFGBuilder took 230.48ms. Allocated memory is still 125.8MB. Free memory was 64.6MB in the beginning and 51.2MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:17:24,242 INFO L158 Benchmark]: BuchiAutomizer took 1625.38ms. Allocated memory is still 125.8MB. Free memory was 51.2MB in the beginning and 37.9MB in the end (delta: 13.3MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2025-04-26 18:17:24,243 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.65ms. Allocated memory is still 167.8MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 375.56ms. Allocated memory is still 125.8MB. Free memory was 90.0MB in the beginning and 68.0MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.17ms. Allocated memory is still 125.8MB. Free memory was 68.0MB in the beginning and 66.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 14.26ms. Allocated memory is still 125.8MB. Free memory was 66.0MB in the beginning and 65.0MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 230.48ms. Allocated memory is still 125.8MB. Free memory was 64.6MB in the beginning and 51.2MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1625.38ms. Allocated memory is still 125.8MB. Free memory was 51.2MB in the beginning and 37.9MB in the end (delta: 13.3MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 225 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 155 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 400, Number of transitions in reduction automaton: 1439, Number of states in reduction automaton: 745, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (2 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 366 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 751]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L746] 0 atomic_int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L747] 0 atomic_int turn; VAL [flag1=0, flag2=0, turn=0] [L748] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L780] 0 pthread_t t1, t2; [L781] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\at(cond, Pre)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L781] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L782] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\at(_, Pre)={0:0}, flag1=0, flag2=0, t1=-1, turn=0, x=0] [L750] 1 flag1 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L783] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, t1=-1, t2=0, turn=0, x=0] [L765] 2 flag2 = 1 VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] Loop: [L751] COND TRUE flag2 >= 1 [L752] COND FALSE !(turn != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 751]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L746] 0 atomic_int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L747] 0 atomic_int turn; VAL [flag1=0, flag2=0, turn=0] [L748] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L780] 0 pthread_t t1, t2; [L781] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\at(cond, Pre)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L781] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L782] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\at(_, Pre)={0:0}, flag1=0, flag2=0, t1=-1, turn=0, x=0] [L750] 1 flag1 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L783] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, t1=-1, t2=0, turn=0, x=0] [L765] 2 flag2 = 1 VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] Loop: [L751] COND TRUE flag2 >= 1 [L752] COND FALSE !(turn != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:17:24,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...