/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/szymanski.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:17:34,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:17:34,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:17:34,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:17:34,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:17:34,836 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:34,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:17:34,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:17:34,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:17:34,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:17:34,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:17:34,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:17:34,857 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:17:34,858 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:17:34,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:17:34,858 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:17:34,859 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:17:34,859 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:17:34,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:17:34,859 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:17:34,859 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:17:34,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:17:34,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:17:34,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:17:34,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:17:34,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:17:34,859 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:17:34,859 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:17:34,860 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:17:35,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:17:35,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:17:35,079 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:17:35,080 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 18:17:35,080 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 18:17:35,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-atomic/szymanski.i [2025-04-26 18:17:36,411 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2df1f815d/fa91a54535b648719d1aef97915fb0cf/FLAG6a3aaf687 [2025-04-26 18:17:36,633 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 18:17:36,633 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-atomic/szymanski.i [2025-04-26 18:17:36,646 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2df1f815d/fa91a54535b648719d1aef97915fb0cf/FLAG6a3aaf687 [2025-04-26 18:17:37,412 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/2df1f815d/fa91a54535b648719d1aef97915fb0cf [2025-04-26 18:17:37,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:17:37,415 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 18:17:37,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 18:17:37,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 18:17:37,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 18:17:37,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:17:37" (1/1) ... [2025-04-26 18:17:37,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cf9cf8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:37, skipping insertion in model container [2025-04-26 18:17:37,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 06:17:37" (1/1) ... [2025-04-26 18:17:37,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 18:17:37,639 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/szymanski.i[32419,32432] [2025-04-26 18:17:37,644 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/szymanski.i[32696,32709] [2025-04-26 18:17:37,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:17:37,654 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 18:17:37,699 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/szymanski.i[32419,32432] [2025-04-26 18:17:37,700 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/szymanski.i[32696,32709] [2025-04-26 18:17:37,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 18:17:37,724 INFO L204 MainTranslator]: Completed translation [2025-04-26 18:17:37,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:37 WrapperNode [2025-04-26 18:17:37,724 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 18:17:37,725 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:17:37,725 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:17:37,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:17:37,729 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:37" (1/1) ... [2025-04-26 18:17:37,738 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:37" (1/1) ... [2025-04-26 18:17:37,749 INFO L138 Inliner]: procedures = 166, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 29 [2025-04-26 18:17:37,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:17:37,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:17:37,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:17:37,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:17:37,755 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:37" (1/1) ... [2025-04-26 18:17:37,755 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:37" (1/1) ... [2025-04-26 18:17:37,757 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:37" (1/1) ... [2025-04-26 18:17:37,757 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:37" (1/1) ... [2025-04-26 18:17:37,759 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:37" (1/1) ... [2025-04-26 18:17:37,760 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:37" (1/1) ... [2025-04-26 18:17:37,762 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:37" (1/1) ... [2025-04-26 18:17:37,762 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:37" (1/1) ... [2025-04-26 18:17:37,763 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:37" (1/1) ... [2025-04-26 18:17:37,767 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:17:37,767 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:17:37,768 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:17:37,768 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:17:37,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:37" (1/1) ... [2025-04-26 18:17:37,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:17:37,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:37,794 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:37,797 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:37,814 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-04-26 18:17:37,814 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-04-26 18:17:37,814 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-04-26 18:17:37,814 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-04-26 18:17:37,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 18:17:37,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 18:17:37,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:17:37,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:17:37,815 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:37,918 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:17:37,919 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:17:38,018 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:17:38,018 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:17:38,023 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:17:38,023 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:17:38,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:17:38 BoogieIcfgContainer [2025-04-26 18:17:38,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:17:38,025 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:17:38,025 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:17:38,029 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:17:38,030 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:17:38,030 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 06:17:37" (1/3) ... [2025-04-26 18:17:38,031 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58852cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:17:38, skipping insertion in model container [2025-04-26 18:17:38,031 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:17:38,031 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 06:17:37" (2/3) ... [2025-04-26 18:17:38,031 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58852cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:17:38, skipping insertion in model container [2025-04-26 18:17:38,031 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:17:38,032 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:17:38" (3/3) ... [2025-04-26 18:17:38,033 INFO L376 chiAutomizerObserver]: Analyzing ICFG szymanski.i [2025-04-26 18:17:38,098 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 18:17:38,130 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:17:38,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:17:38,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:17:38,133 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:38,134 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:38,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 81 transitions, 176 flow [2025-04-26 18:17:38,223 INFO L116 PetriNetUnfolderBase]: 12/77 cut-off events. [2025-04-26 18:17:38,227 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 18:17:38,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 77 events. 12/77 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 56. Up to 3 conditions per place. [2025-04-26 18:17:38,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 81 transitions, 176 flow [2025-04-26 18:17:38,237 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 77 transitions, 166 flow [2025-04-26 18:17:38,237 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 72 places, 77 transitions, 166 flow [2025-04-26 18:17:38,238 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 77 transitions, 166 flow [2025-04-26 18:17:38,322 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1120 states, 1116 states have (on average 3.0833333333333335) internal successors, (in total 3441), 1119 states have internal predecessors, (3441), 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:38,325 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 1120 states, 1116 states have (on average 3.0833333333333335) internal successors, (in total 3441), 1119 states have internal predecessors, (3441), 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:38,326 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:17:38,383 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1891#[thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, L761, L768-4]true [2025-04-26 18:17:38,383 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1505#[thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, L758, L768-4]true [2025-04-26 18:17:38,383 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1493#[thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, L755, L768-4]true [2025-04-26 18:17:38,383 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 933#[thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, L751, L768-4]true [2025-04-26 18:17:38,393 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2157#[thr1EXIT, L761, L768-4]true [2025-04-26 18:17:38,393 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1899#[thr1EXIT, L758, L768-4]true [2025-04-26 18:17:38,393 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1875#[thr1EXIT, L755, L768-4]true [2025-04-26 18:17:38,393 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1369#[L751, thr1EXIT, L768-4]true [2025-04-26 18:17:38,415 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1893#[L746, L761, L768-4]true [2025-04-26 18:17:38,416 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2085#[L761, thr1FINAL, L768-4]true [2025-04-26 18:17:38,416 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1507#[L746, L758, L768-4]true [2025-04-26 18:17:38,417 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1779#[thr1FINAL, L758, L768-4]true [2025-04-26 18:17:38,417 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1495#[L746, L755, L768-4]true [2025-04-26 18:17:38,417 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1757#[thr1FINAL, L755, L768-4]true [2025-04-26 18:17:38,418 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 935#[L746, L751, L768-4]true [2025-04-26 18:17:38,419 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1219#[L751, thr1FINAL, L768-4]true [2025-04-26 18:17:38,441 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1879#[L745, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, L768-4]true [2025-04-26 18:17:38,444 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1991#[L745, L762-1, L768-4]true [2025-04-26 18:17:38,444 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1889#[L745, L768-4, L762]true [2025-04-26 18:17:38,444 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1771#[L745, L761, L768-4]true [2025-04-26 18:17:38,444 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1355#[L745, L758, L768-4]true [2025-04-26 18:17:38,444 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1205#[L745, L753-1, L768-4]true [2025-04-26 18:17:38,444 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1345#[L745, L755, L768-4]true [2025-04-26 18:17:38,445 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1199#[L754, L745, L768-4]true [2025-04-26 18:17:38,445 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1061#[L745, L752-1, L768-4]true [2025-04-26 18:17:38,445 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 925#[L745, L768-4, L752]true [2025-04-26 18:17:38,445 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 803#[L751, L745, L768-4]true [2025-04-26 18:17:38,445 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 695#[L750, L745, L768-4]true [2025-04-26 18:17:38,449 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1201#[L758, L744, L768-4]true [2025-04-26 18:17:38,449 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1195#[L755, L744, L768-4]true [2025-04-26 18:17:38,450 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 689#[L751, L744, L768-4]true [2025-04-26 18:17:38,459 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1099#[L743, L758, L768-4]true [2025-04-26 18:17:38,460 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1097#[L743, L755, L768-4]true [2025-04-26 18:17:38,460 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 611#[L743, L751, L768-4]true [2025-04-26 18:17:38,497 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1537#[L742, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, L768-4]true [2025-04-26 18:17:38,506 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1677#[L742, L762-1, L768-4]true [2025-04-26 18:17:38,506 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1539#[L742, L768-4, L762]true [2025-04-26 18:17:38,506 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1391#[L742, L761, L768-4]true [2025-04-26 18:17:38,506 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1247#[L742, L760, L768-4]true [2025-04-26 18:17:38,506 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1109#[L742, L768-4, L759]true [2025-04-26 18:17:38,507 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 973#[L742, L758, L768-4]true [2025-04-26 18:17:38,507 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 841#[L742, L753-1, L768-4]true [2025-04-26 18:17:38,507 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 971#[L742, L755, L768-4]true [2025-04-26 18:17:38,507 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 839#[L754, L742, L768-4]true [2025-04-26 18:17:38,507 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 721#[L742, L752-1, L768-4]true [2025-04-26 18:17:38,507 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 617#[L742, L752, L768-4]true [2025-04-26 18:17:38,507 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 525#[L751, L742, L768-4]true [2025-04-26 18:17:38,507 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 441#[L750, L742, L768-4]true [2025-04-26 18:17:38,530 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1255#[L737-1, L761, L768-4]true [2025-04-26 18:17:38,530 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 851#[L737-1, L758, L768-4]true [2025-04-26 18:17:38,530 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 849#[L737-1, L755, L768-4]true [2025-04-26 18:17:38,531 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 445#[L751, L737-1, L768-4]true [2025-04-26 18:17:38,549 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1439#[L739, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, L768-4]true [2025-04-26 18:17:38,551 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1579#[L739, L762-1, L768-4]true [2025-04-26 18:17:38,551 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1441#[L739, L768-4, L762]true [2025-04-26 18:17:38,551 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1301#[L739, L761, L768-4]true [2025-04-26 18:17:38,551 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1167#[L739, L760, L768-4]true [2025-04-26 18:17:38,551 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1037#[L739, L768-4, L759]true [2025-04-26 18:17:38,551 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 907#[L739, L758, L768-4]true [2025-04-26 18:17:38,551 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 785#[L739, L753-1, L768-4]true [2025-04-26 18:17:38,551 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 905#[L739, L755, L768-4]true [2025-04-26 18:17:38,551 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 783#[L754, L739, L768-4]true [2025-04-26 18:17:38,551 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 677#[L739, L752-1, L768-4]true [2025-04-26 18:17:38,551 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 583#[L739, L752, L768-4]true [2025-04-26 18:17:38,552 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 497#[L751, L739, L768-4]true [2025-04-26 18:17:38,552 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 419#[L750, L739, L768-4]true [2025-04-26 18:17:38,572 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1175#[L738, L761, L768-4]true [2025-04-26 18:17:38,573 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 795#[L738, L758, L768-4]true [2025-04-26 18:17:38,573 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 793#[L738, L755, L768-4]true [2025-04-26 18:17:38,573 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 423#[L751, L738, L768-4]true [2025-04-26 18:17:38,592 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1125#[L761, L736-1, L768-4]true [2025-04-26 18:17:38,592 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 741#[L736-1, L758, L768-4]true [2025-04-26 18:17:38,592 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 739#[L736-1, L755, L768-4]true [2025-04-26 18:17:38,592 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 375#[L751, L736-1, L768-4]true [2025-04-26 18:17:38,613 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 999#[L736, L761, L768-4]true [2025-04-26 18:17:38,613 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 645#[L736, L758, L768-4]true [2025-04-26 18:17:38,613 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 643#[L736, L755, L768-4]true [2025-04-26 18:17:38,614 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 319#[L751, L736, L768-4]true [2025-04-26 18:17:38,630 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1007#[L735, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, L768-4]true [2025-04-26 18:17:38,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1145#[L762-1, L735, L768-4]true [2025-04-26 18:17:38,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1009#[L735, L768-4, L762]true [2025-04-26 18:17:38,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 877#[L761, L735, L768-4]true [2025-04-26 18:17:38,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 759#[L735, L760, L768-4]true [2025-04-26 18:17:38,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 655#[L735, L768-4, L759]true [2025-04-26 18:17:38,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 559#[L735, L758, L768-4]true [2025-04-26 18:17:38,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 469#[L735, L753-1, L768-4]true [2025-04-26 18:17:38,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 557#[L735, L755, L768-4]true [2025-04-26 18:17:38,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 467#[L754, L735, L768-4]true [2025-04-26 18:17:38,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 389#[L735, L752-1, L768-4]true [2025-04-26 18:17:38,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 325#[L735, L752, L768-4]true [2025-04-26 18:17:38,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 275#[L751, L735, L768-4]true [2025-04-26 18:17:38,635 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 235#[L750, L735, L768-4]true [2025-04-26 18:17:38,646 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 767#[L761, L734, L768-4]true [2025-04-26 18:17:38,647 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 481#[L758, L734, L768-4]true [2025-04-26 18:17:38,647 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 479#[L755, L734, L768-4]true [2025-04-26 18:17:38,647 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 241#[L751, L734, L768-4]true [2025-04-26 18:17:38,653 WARN L140 AmpleReduction]: Number of pruned transitions: 394 [2025-04-26 18:17:38,653 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 96 [2025-04-26 18:17:38,653 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 96 [2025-04-26 18:17:38,653 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:119 [2025-04-26 18:17:38,653 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:280 [2025-04-26 18:17:38,653 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:17:38,653 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:17:38,653 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:17:38,654 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 400 states, 396 states have (on average 2.1161616161616164) internal successors, (in total 838), 399 states have internal predecessors, (838), 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:38,660 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:17:38,660 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:17:38,660 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:17:38,660 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:17:38,660 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:17:38,660 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:17:38,660 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:17:38,661 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:17:38,662 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 400 states, 396 states have (on average 2.1161616161616164) internal successors, (in total 838), 399 states have internal predecessors, (838), 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:38,683 INFO L131 ngComponentsAnalysis]: Automaton has 120 accepting balls. 120 [2025-04-26 18:17:38,683 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:38,683 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:38,687 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] [2025-04-26 18:17:38,687 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:17:38,687 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:17:38,688 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 400 states, 396 states have (on average 2.1161616161616164) internal successors, (in total 838), 399 states have internal predecessors, (838), 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:38,695 INFO L131 ngComponentsAnalysis]: Automaton has 120 accepting balls. 120 [2025-04-26 18:17:38,695 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:38,695 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:38,696 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] [2025-04-26 18:17:38,696 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:17:38,701 INFO L752 eck$LassoCheckResult]: Stem: "[156] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[172] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[139] L12-->L12-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[]" "[167] L12-1-->L12-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[]" "[165] L12-2-->L12-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[]" "[187] L12-3-->L12-4: Formula: (and (= 12 (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[]" "[179] L12-4-->L731: Formula: (= v_~flag1~0_16 0) InVars {} OutVars{~flag1~0=v_~flag1~0_16} AuxVars[] AssignedVars[~flag1~0]" "[151] L731-->L732: Formula: (= v_~flag2~0_16 0) InVars {} OutVars{~flag2~0=v_~flag2~0_16} AuxVars[] AssignedVars[~flag2~0]" "[147] L732-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[196] 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]" "[197] L-1-2-->L766: 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]" "[132] L766-->L766-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]" "[153] L766-1-->L767: 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]" "[174] L767-->L767-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]" "[189] L767-1-->L767-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[150] L767-2-->L767-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]" "[255] L767-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork1_thidvar0_2) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0]" "[227] $Ultimate##0-->L734: Formula: (and (= v_thr1Thread1of1ForFork1_~_.base_1 |v_thr1Thread1of1ForFork1_#in~_.base_1|) (= |v_thr1Thread1of1ForFork1_#in~_.offset_1| v_thr1Thread1of1ForFork1_~_.offset_1)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_1, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset]" "[228] L734-->L735: Formula: (= v_~flag1~0_12 1) InVars {} OutVars{~flag1~0=v_~flag1~0_12} AuxVars[] AssignedVars[~flag1~0]" [2025-04-26 18:17:38,701 INFO L754 eck$LassoCheckResult]: Loop: "[230] L735-->L735: Formula: (<= 3 v_~flag2~0_10) InVars {~flag2~0=v_~flag2~0_10} OutVars{~flag2~0=v_~flag2~0_10} AuxVars[] AssignedVars[]" [2025-04-26 18:17:38,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:38,705 INFO L85 PathProgramCache]: Analyzing trace with hash 2016825051, now seen corresponding path program 1 times [2025-04-26 18:17:38,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:38,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693294773] [2025-04-26 18:17:38,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:38,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:38,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:17:38,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:17:38,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:38,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:38,761 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:38,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:17:38,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:17:38,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:38,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:38,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:38,787 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:38,787 INFO L85 PathProgramCache]: Analyzing trace with hash 261, now seen corresponding path program 1 times [2025-04-26 18:17:38,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:38,788 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548642544] [2025-04-26 18:17:38,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:38,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:38,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:38,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:38,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:38,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:38,794 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:38,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:38,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:38,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:38,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:38,797 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:38,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:38,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1902932629, now seen corresponding path program 1 times [2025-04-26 18:17:38,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:38,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341074259] [2025-04-26 18:17:38,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:38,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:38,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-26 18:17:38,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-26 18:17:38,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:38,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:38,914 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:38,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:17:38,915 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341074259] [2025-04-26 18:17:38,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341074259] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:17:38,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:17:38,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:17:38,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57220932] [2025-04-26 18:17:38,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:17:38,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:17:38,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:17:38,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:17:38,941 INFO L87 Difference]: Start difference. First operand has 400 states, 396 states have (on average 2.1161616161616164) internal successors, (in total 838), 399 states have internal predecessors, (838), 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, 2 states have (on average 10.0) internal successors, (in total 20), 3 states have internal predecessors, (20), 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:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:17:38,999 INFO L93 Difference]: Finished difference Result 383 states and 733 transitions. [2025-04-26 18:17:39,000 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 383 states and 733 transitions. [2025-04-26 18:17:39,003 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 89 [2025-04-26 18:17:39,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 383 states to 332 states and 668 transitions. [2025-04-26 18:17:39,013 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 332 [2025-04-26 18:17:39,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 332 [2025-04-26 18:17:39,014 INFO L74 IsDeterministic]: Start isDeterministic. Operand 332 states and 668 transitions. [2025-04-26 18:17:39,016 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:17:39,016 INFO L218 hiAutomatonCegarLoop]: Abstraction has 332 states and 668 transitions. [2025-04-26 18:17:39,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states and 668 transitions. [2025-04-26 18:17:39,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-04-26 18:17:39,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 332 states have (on average 2.0120481927710845) internal successors, (in total 668), 331 states have internal predecessors, (668), 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:39,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 668 transitions. [2025-04-26 18:17:39,042 INFO L240 hiAutomatonCegarLoop]: Abstraction has 332 states and 668 transitions. [2025-04-26 18:17:39,043 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:17:39,045 INFO L438 stractBuchiCegarLoop]: Abstraction has 332 states and 668 transitions. [2025-04-26 18:17:39,045 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:17:39,045 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 332 states and 668 transitions. [2025-04-26 18:17:39,047 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 89 [2025-04-26 18:17:39,047 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:39,047 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:39,048 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:39,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:17:39,051 INFO L752 eck$LassoCheckResult]: Stem: "[156] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[172] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[139] L12-->L12-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[]" "[167] L12-1-->L12-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[]" "[165] L12-2-->L12-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[]" "[187] L12-3-->L12-4: Formula: (and (= 12 (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[]" "[179] L12-4-->L731: Formula: (= v_~flag1~0_16 0) InVars {} OutVars{~flag1~0=v_~flag1~0_16} AuxVars[] AssignedVars[~flag1~0]" "[151] L731-->L732: Formula: (= v_~flag2~0_16 0) InVars {} OutVars{~flag2~0=v_~flag2~0_16} AuxVars[] AssignedVars[~flag2~0]" "[147] L732-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[196] 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]" "[197] L-1-2-->L766: 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]" "[132] L766-->L766-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]" "[153] L766-1-->L767: 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]" "[174] L767-->L767-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]" "[189] L767-1-->L767-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[150] L767-2-->L767-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]" "[255] L767-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork1_thidvar0_2) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0]" "[227] $Ultimate##0-->L734: Formula: (and (= v_thr1Thread1of1ForFork1_~_.base_1 |v_thr1Thread1of1ForFork1_#in~_.base_1|) (= |v_thr1Thread1of1ForFork1_#in~_.offset_1| v_thr1Thread1of1ForFork1_~_.offset_1)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_1, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset]" "[176] L767-4-->L767-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]" "[195] L767-5-->L768: 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]" "[133] L768-->L768-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]" "[202] L768-1-->L768-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[134] L768-2-->L768-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]" "[252] L768-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= v_thr2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base]" "[204] $Ultimate##0-->L750: Formula: (and (= |v_thr2Thread1of1ForFork0_#in~_.base_1| v_thr2Thread1of1ForFork0_~_.base_1) (= v_thr2Thread1of1ForFork0_~_.offset_1 |v_thr2Thread1of1ForFork0_#in~_.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_1, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base]" "[205] L750-->L751: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" [2025-04-26 18:17:39,051 INFO L754 eck$LassoCheckResult]: Loop: "[207] L751-->L751: Formula: (<= 3 v_~flag1~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1} AuxVars[] AssignedVars[]" [2025-04-26 18:17:39,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:39,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1739774568, now seen corresponding path program 1 times [2025-04-26 18:17:39,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:39,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963902872] [2025-04-26 18:17:39,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:39,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:39,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:17:39,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:17:39,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:39,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:17:39,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:17:39,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,082 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:39,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:39,082 INFO L85 PathProgramCache]: Analyzing trace with hash 238, now seen corresponding path program 1 times [2025-04-26 18:17:39,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:39,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427572492] [2025-04-26 18:17:39,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:39,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:39,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:39,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:39,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:39,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:39,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:39,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:39,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1901563447, now seen corresponding path program 1 times [2025-04-26 18:17:39,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:39,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729965693] [2025-04-26 18:17:39,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:39,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:39,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 18:17:39,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:17:39,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:39,147 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:39,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:17:39,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729965693] [2025-04-26 18:17:39,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729965693] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:17:39,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:17:39,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:17:39,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199460391] [2025-04-26 18:17:39,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:17:39,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:17:39,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:17:39,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:17:39,154 INFO L87 Difference]: Start difference. First operand 332 states and 668 transitions. cyclomatic complexity: 425 Second operand has 3 states, 2 states have (on average 13.5) internal successors, (in total 27), 3 states have internal predecessors, (27), 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:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:17:39,189 INFO L93 Difference]: Finished difference Result 328 states and 647 transitions. [2025-04-26 18:17:39,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 328 states and 647 transitions. [2025-04-26 18:17:39,191 INFO L131 ngComponentsAnalysis]: Automaton has 79 accepting balls. 79 [2025-04-26 18:17:39,195 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 328 states to 288 states and 596 transitions. [2025-04-26 18:17:39,195 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2025-04-26 18:17:39,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 288 [2025-04-26 18:17:39,196 INFO L74 IsDeterministic]: Start isDeterministic. Operand 288 states and 596 transitions. [2025-04-26 18:17:39,197 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:17:39,197 INFO L218 hiAutomatonCegarLoop]: Abstraction has 288 states and 596 transitions. [2025-04-26 18:17:39,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states and 596 transitions. [2025-04-26 18:17:39,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2025-04-26 18:17:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 288 states have (on average 2.0694444444444446) internal successors, (in total 596), 287 states have internal predecessors, (596), 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:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 596 transitions. [2025-04-26 18:17:39,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 288 states and 596 transitions. [2025-04-26 18:17:39,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:17:39,210 INFO L438 stractBuchiCegarLoop]: Abstraction has 288 states and 596 transitions. [2025-04-26 18:17:39,210 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:17:39,210 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 596 transitions. [2025-04-26 18:17:39,212 INFO L131 ngComponentsAnalysis]: Automaton has 79 accepting balls. 79 [2025-04-26 18:17:39,212 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:39,212 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:39,212 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] [2025-04-26 18:17:39,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:17:39,213 INFO L752 eck$LassoCheckResult]: Stem: "[156] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[172] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[139] L12-->L12-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[]" "[167] L12-1-->L12-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[]" "[165] L12-2-->L12-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[]" "[187] L12-3-->L12-4: Formula: (and (= 12 (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[]" "[179] L12-4-->L731: Formula: (= v_~flag1~0_16 0) InVars {} OutVars{~flag1~0=v_~flag1~0_16} AuxVars[] AssignedVars[~flag1~0]" "[151] L731-->L732: Formula: (= v_~flag2~0_16 0) InVars {} OutVars{~flag2~0=v_~flag2~0_16} AuxVars[] AssignedVars[~flag2~0]" "[147] L732-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[196] 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]" "[197] L-1-2-->L766: 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]" "[132] L766-->L766-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]" "[153] L766-1-->L767: 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]" "[174] L767-->L767-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]" "[189] L767-1-->L767-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[150] L767-2-->L767-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]" "[255] L767-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork1_thidvar0_2) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0]" "[227] $Ultimate##0-->L734: Formula: (and (= v_thr1Thread1of1ForFork1_~_.base_1 |v_thr1Thread1of1ForFork1_#in~_.base_1|) (= |v_thr1Thread1of1ForFork1_#in~_.offset_1| v_thr1Thread1of1ForFork1_~_.offset_1)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_1, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset]" "[176] L767-4-->L767-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]" "[195] L767-5-->L768: 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]" "[228] L734-->L735: Formula: (= v_~flag1~0_12 1) InVars {} OutVars{~flag1~0=v_~flag1~0_12} AuxVars[] AssignedVars[~flag1~0]" "[133] L768-->L768-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]" "[202] L768-1-->L768-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[134] L768-2-->L768-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]" "[252] L768-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= v_thr2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base]" "[204] $Ultimate##0-->L750: Formula: (and (= |v_thr2Thread1of1ForFork0_#in~_.base_1| v_thr2Thread1of1ForFork0_~_.base_1) (= v_thr2Thread1of1ForFork0_~_.offset_1 |v_thr2Thread1of1ForFork0_#in~_.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_1, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base]" "[205] L750-->L751: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" [2025-04-26 18:17:39,213 INFO L754 eck$LassoCheckResult]: Loop: "[230] L735-->L735: Formula: (<= 3 v_~flag2~0_10) InVars {~flag2~0=v_~flag2~0_10} OutVars{~flag2~0=v_~flag2~0_10} AuxVars[] AssignedVars[]" [2025-04-26 18:17:39,213 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:39,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1601014012, now seen corresponding path program 1 times [2025-04-26 18:17:39,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:39,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131394452] [2025-04-26 18:17:39,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:39,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:39,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 18:17:39,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:17:39,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,238 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:39,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 18:17:39,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:17:39,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:39,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:39,245 INFO L85 PathProgramCache]: Analyzing trace with hash 261, now seen corresponding path program 2 times [2025-04-26 18:17:39,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:39,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170966418] [2025-04-26 18:17:39,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:17:39,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:39,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:39,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:39,249 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:17:39,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:39,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:39,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:39,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:39,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1908173410, now seen corresponding path program 1 times [2025-04-26 18:17:39,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:39,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218853967] [2025-04-26 18:17:39,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:39,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:39,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:17:39,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:17:39,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:39,296 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:39,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:17:39,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218853967] [2025-04-26 18:17:39,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218853967] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:17:39,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:17:39,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:17:39,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990356044] [2025-04-26 18:17:39,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:17:39,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:17:39,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:17:39,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:17:39,302 INFO L87 Difference]: Start difference. First operand 288 states and 596 transitions. cyclomatic complexity: 387 Second operand has 3 states, 2 states have (on average 14.0) 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:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:17:39,346 INFO L93 Difference]: Finished difference Result 310 states and 635 transitions. [2025-04-26 18:17:39,346 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 310 states and 635 transitions. [2025-04-26 18:17:39,348 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 89 [2025-04-26 18:17:39,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 310 states to 310 states and 635 transitions. [2025-04-26 18:17:39,350 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 310 [2025-04-26 18:17:39,351 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 310 [2025-04-26 18:17:39,351 INFO L74 IsDeterministic]: Start isDeterministic. Operand 310 states and 635 transitions. [2025-04-26 18:17:39,352 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:17:39,352 INFO L218 hiAutomatonCegarLoop]: Abstraction has 310 states and 635 transitions. [2025-04-26 18:17:39,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states and 635 transitions. [2025-04-26 18:17:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2025-04-26 18:17:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 310 states have (on average 2.0483870967741935) internal successors, (in total 635), 309 states have internal predecessors, (635), 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:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 635 transitions. [2025-04-26 18:17:39,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 310 states and 635 transitions. [2025-04-26 18:17:39,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:17:39,361 INFO L438 stractBuchiCegarLoop]: Abstraction has 310 states and 635 transitions. [2025-04-26 18:17:39,361 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:17:39,361 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 310 states and 635 transitions. [2025-04-26 18:17:39,363 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 89 [2025-04-26 18:17:39,363 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:39,363 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:39,363 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] [2025-04-26 18:17:39,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:17:39,364 INFO L752 eck$LassoCheckResult]: Stem: "[156] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[172] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[139] L12-->L12-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[]" "[167] L12-1-->L12-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[]" "[165] L12-2-->L12-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[]" "[187] L12-3-->L12-4: Formula: (and (= 12 (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[]" "[179] L12-4-->L731: Formula: (= v_~flag1~0_16 0) InVars {} OutVars{~flag1~0=v_~flag1~0_16} AuxVars[] AssignedVars[~flag1~0]" "[151] L731-->L732: Formula: (= v_~flag2~0_16 0) InVars {} OutVars{~flag2~0=v_~flag2~0_16} AuxVars[] AssignedVars[~flag2~0]" "[147] L732-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[196] 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]" "[197] L-1-2-->L766: 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]" "[132] L766-->L766-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]" "[153] L766-1-->L767: 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]" "[174] L767-->L767-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]" "[189] L767-1-->L767-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[150] L767-2-->L767-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]" "[255] L767-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork1_thidvar0_2) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0]" "[227] $Ultimate##0-->L734: Formula: (and (= v_thr1Thread1of1ForFork1_~_.base_1 |v_thr1Thread1of1ForFork1_#in~_.base_1|) (= |v_thr1Thread1of1ForFork1_#in~_.offset_1| v_thr1Thread1of1ForFork1_~_.offset_1)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_1, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset]" "[176] L767-4-->L767-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]" "[195] L767-5-->L768: 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]" "[228] L734-->L735: Formula: (= v_~flag1~0_12 1) InVars {} OutVars{~flag1~0=v_~flag1~0_12} AuxVars[] AssignedVars[~flag1~0]" "[133] L768-->L768-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]" "[202] L768-1-->L768-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[134] L768-2-->L768-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]" "[252] L768-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= v_thr2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base]" "[204] $Ultimate##0-->L750: Formula: (and (= |v_thr2Thread1of1ForFork0_#in~_.base_1| v_thr2Thread1of1ForFork0_~_.base_1) (= v_thr2Thread1of1ForFork0_~_.offset_1 |v_thr2Thread1of1ForFork0_#in~_.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_1, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base]" "[205] L750-->L751: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" [2025-04-26 18:17:39,364 INFO L754 eck$LassoCheckResult]: Loop: "[207] L751-->L751: Formula: (<= 3 v_~flag1~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1} AuxVars[] AssignedVars[]" [2025-04-26 18:17:39,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:39,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1601014012, now seen corresponding path program 2 times [2025-04-26 18:17:39,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:39,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903691997] [2025-04-26 18:17:39,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:17:39,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:39,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-04-26 18:17:39,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:17:39,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:17:39,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:39,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 18:17:39,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:17:39,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:39,386 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:39,386 INFO L85 PathProgramCache]: Analyzing trace with hash 238, now seen corresponding path program 2 times [2025-04-26 18:17:39,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:39,386 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348867956] [2025-04-26 18:17:39,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:17:39,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:39,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:39,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:39,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:17:39,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,390 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:39,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:39,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:39,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:39,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:39,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1908173387, now seen corresponding path program 1 times [2025-04-26 18:17:39,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:39,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622533394] [2025-04-26 18:17:39,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:39,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:39,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 18:17:39,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 18:17:39,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:17:39,425 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:39,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:17:39,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622533394] [2025-04-26 18:17:39,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622533394] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:17:39,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:17:39,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 18:17:39,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389528219] [2025-04-26 18:17:39,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:17:39,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:17:39,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 18:17:39,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 18:17:39,430 INFO L87 Difference]: Start difference. First operand 310 states and 635 transitions. cyclomatic complexity: 414 Second operand has 3 states, 2 states have (on average 14.0) 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:39,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:17:39,462 INFO L93 Difference]: Finished difference Result 334 states and 678 transitions. [2025-04-26 18:17:39,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 678 transitions. [2025-04-26 18:17:39,465 INFO L131 ngComponentsAnalysis]: Automaton has 100 accepting balls. 100 [2025-04-26 18:17:39,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 334 states and 678 transitions. [2025-04-26 18:17:39,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 334 [2025-04-26 18:17:39,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 334 [2025-04-26 18:17:39,469 INFO L74 IsDeterministic]: Start isDeterministic. Operand 334 states and 678 transitions. [2025-04-26 18:17:39,469 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:17:39,469 INFO L218 hiAutomatonCegarLoop]: Abstraction has 334 states and 678 transitions. [2025-04-26 18:17:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states and 678 transitions. [2025-04-26 18:17:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-04-26 18:17:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 334 states have (on average 2.029940119760479) internal successors, (in total 678), 333 states have internal predecessors, (678), 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:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 678 transitions. [2025-04-26 18:17:39,475 INFO L240 hiAutomatonCegarLoop]: Abstraction has 334 states and 678 transitions. [2025-04-26 18:17:39,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 18:17:39,476 INFO L438 stractBuchiCegarLoop]: Abstraction has 334 states and 678 transitions. [2025-04-26 18:17:39,476 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:17:39,476 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 334 states and 678 transitions. [2025-04-26 18:17:39,477 INFO L131 ngComponentsAnalysis]: Automaton has 100 accepting balls. 100 [2025-04-26 18:17:39,477 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:17:39,477 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:17:39,478 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] [2025-04-26 18:17:39,478 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:17:39,478 INFO L752 eck$LassoCheckResult]: Stem: "[156] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[172] L-1-->L12: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[139] L12-->L12-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[]" "[167] L12-1-->L12-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[]" "[165] L12-2-->L12-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[]" "[187] L12-3-->L12-4: Formula: (and (= 12 (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[]" "[179] L12-4-->L731: Formula: (= v_~flag1~0_16 0) InVars {} OutVars{~flag1~0=v_~flag1~0_16} AuxVars[] AssignedVars[~flag1~0]" "[151] L731-->L732: Formula: (= v_~flag2~0_16 0) InVars {} OutVars{~flag2~0=v_~flag2~0_16} AuxVars[] AssignedVars[~flag2~0]" "[147] L732-->L-1-1: Formula: (= v_~x~0_7 0) InVars {} OutVars{~x~0=v_~x~0_7} AuxVars[] AssignedVars[~x~0]" "[196] 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]" "[197] L-1-2-->L766: 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]" "[132] L766-->L766-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]" "[153] L766-1-->L767: 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]" "[174] L767-->L767-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]" "[189] L767-1-->L767-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[150] L767-2-->L767-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]" "[255] L767-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_7| v_thr1Thread1of1ForFork1_thidvar0_2) (= v_thr1Thread1of1ForFork1_thidvar1_2 0) (= |v_thr1Thread1of1ForFork1_#in~_.base_4| 0) (= |v_thr1Thread1of1ForFork1_#in~_.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_4|, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_4, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_7|, thr1Thread1of1ForFork1_#res.base=|v_thr1Thread1of1ForFork1_#res.base_4|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_4|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_4, thr1Thread1of1ForFork1_#res.offset=|v_thr1Thread1of1ForFork1_#res.offset_4|, thr1Thread1of1ForFork1_thidvar1=v_thr1Thread1of1ForFork1_thidvar1_2, thr1Thread1of1ForFork1_thidvar0=v_thr1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_#in~_.offset, thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_#res.base, thr1Thread1of1ForFork1_#in~_.base, thr1Thread1of1ForFork1_~_.offset, thr1Thread1of1ForFork1_#res.offset, thr1Thread1of1ForFork1_thidvar1, thr1Thread1of1ForFork1_thidvar0]" "[227] $Ultimate##0-->L734: Formula: (and (= v_thr1Thread1of1ForFork1_~_.base_1 |v_thr1Thread1of1ForFork1_#in~_.base_1|) (= |v_thr1Thread1of1ForFork1_#in~_.offset_1| v_thr1Thread1of1ForFork1_~_.offset_1)) InVars {thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|} OutVars{thr1Thread1of1ForFork1_#in~_.offset=|v_thr1Thread1of1ForFork1_#in~_.offset_1|, thr1Thread1of1ForFork1_#in~_.base=|v_thr1Thread1of1ForFork1_#in~_.base_1|, thr1Thread1of1ForFork1_~_.offset=v_thr1Thread1of1ForFork1_~_.offset_1, thr1Thread1of1ForFork1_~_.base=v_thr1Thread1of1ForFork1_~_.base_1} AuxVars[] AssignedVars[thr1Thread1of1ForFork1_~_.base, thr1Thread1of1ForFork1_~_.offset]" "[176] L767-4-->L767-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]" "[195] L767-5-->L768: 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]" "[228] L734-->L735: Formula: (= v_~flag1~0_12 1) InVars {} OutVars{~flag1~0=v_~flag1~0_12} AuxVars[] AssignedVars[~flag1~0]" "[229] L735-->L736: Formula: (< v_~flag2~0_11 3) InVars {~flag2~0=v_~flag2~0_11} OutVars{~flag2~0=v_~flag2~0_11} AuxVars[] AssignedVars[]" "[133] L768-->L768-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]" "[231] L736-->L736-1: Formula: (= v_~flag1~0_13 3) InVars {} OutVars{~flag1~0=v_~flag1~0_13} AuxVars[] AssignedVars[~flag1~0]" "[202] L768-1-->L768-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks]" "[134] L768-2-->L768-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]" "[252] L768-3-->$Ultimate##0: Formula: (and (= v_thr2Thread1of1ForFork0_thidvar2_2 0) (= |v_thr2Thread1of1ForFork0_#in~_.offset_4| 0) (= |v_thr2Thread1of1ForFork0_#in~_.base_4| 0) (= v_thr2Thread1of1ForFork0_thidvar1_2 0) (= v_thr2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre11#1_7|)) InVars {ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_4, ULTIMATE.start_main_#t~pre11#1=|v_ULTIMATE.start_main_#t~pre11#1_7|, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_4|, thr2Thread1of1ForFork0_#res.base=|v_thr2Thread1of1ForFork0_#res.base_4|, thr2Thread1of1ForFork0_thidvar0=v_thr2Thread1of1ForFork0_thidvar0_2, thr2Thread1of1ForFork0_thidvar1=v_thr2Thread1of1ForFork0_thidvar1_2, thr2Thread1of1ForFork0_thidvar2=v_thr2Thread1of1ForFork0_thidvar2_2, thr2Thread1of1ForFork0_#res.offset=|v_thr2Thread1of1ForFork0_#res.offset_4|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_4|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_4} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_#in~_.offset, thr2Thread1of1ForFork0_#res.base, thr2Thread1of1ForFork0_thidvar0, thr2Thread1of1ForFork0_thidvar1, thr2Thread1of1ForFork0_thidvar2, thr2Thread1of1ForFork0_#res.offset, thr2Thread1of1ForFork0_#in~_.base, thr2Thread1of1ForFork0_~_.base]" "[204] $Ultimate##0-->L750: Formula: (and (= |v_thr2Thread1of1ForFork0_#in~_.base_1| v_thr2Thread1of1ForFork0_~_.base_1) (= v_thr2Thread1of1ForFork0_~_.offset_1 |v_thr2Thread1of1ForFork0_#in~_.offset_1|)) InVars {thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|} OutVars{thr2Thread1of1ForFork0_~_.offset=v_thr2Thread1of1ForFork0_~_.offset_1, thr2Thread1of1ForFork0_#in~_.offset=|v_thr2Thread1of1ForFork0_#in~_.offset_1|, thr2Thread1of1ForFork0_#in~_.base=|v_thr2Thread1of1ForFork0_#in~_.base_1|, thr2Thread1of1ForFork0_~_.base=v_thr2Thread1of1ForFork0_~_.base_1} AuxVars[] AssignedVars[thr2Thread1of1ForFork0_~_.offset, thr2Thread1of1ForFork0_~_.base]" "[205] L750-->L751: Formula: (= v_~flag2~0_1 1) InVars {} OutVars{~flag2~0=v_~flag2~0_1} AuxVars[] AssignedVars[~flag2~0]" [2025-04-26 18:17:39,478 INFO L754 eck$LassoCheckResult]: Loop: "[207] L751-->L751: Formula: (<= 3 v_~flag1~0_1) InVars {~flag1~0=v_~flag1~0_1} OutVars{~flag1~0=v_~flag1~0_1} AuxVars[] AssignedVars[]" [2025-04-26 18:17:39,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:39,479 INFO L85 PathProgramCache]: Analyzing trace with hash 450500130, now seen corresponding path program 1 times [2025-04-26 18:17:39,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:39,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384441404] [2025-04-26 18:17:39,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:39,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:39,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:17:39,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:17:39,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,484 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:39,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:17:39,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:17:39,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:39,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:39,494 INFO L85 PathProgramCache]: Analyzing trace with hash 238, now seen corresponding path program 3 times [2025-04-26 18:17:39,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:39,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057876307] [2025-04-26 18:17:39,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:17:39,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:39,497 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:39,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:39,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:17:39,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,498 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:39,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:17:39,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:17:39,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:39,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:17:39,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1080602349, now seen corresponding path program 1 times [2025-04-26 18:17:39,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:17:39,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817995299] [2025-04-26 18:17:39,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:17:39,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:17:39,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 18:17:39,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 18:17:39,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,509 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:39,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-26 18:17:39,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-26 18:17:39,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:17:39,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:17:39,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:17:39,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:17:39,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:17:39,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:17:39,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:17:39,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:17:39,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:17:39,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:17:39 BoogieIcfgContainer [2025-04-26 18:17:39,963 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:17:39,964 INFO L158 Benchmark]: Toolchain (without parser) took 2549.35ms. Allocated memory is still 155.2MB. Free memory was 105.5MB in the beginning and 92.4MB in the end (delta: 13.0MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2025-04-26 18:17:39,964 INFO L158 Benchmark]: CDTParser took 0.76ms. Allocated memory is still 163.6MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:17:39,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.04ms. Allocated memory is still 155.2MB. Free memory was 105.5MB in the beginning and 83.5MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-26 18:17:39,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.96ms. Allocated memory is still 155.2MB. Free memory was 83.5MB in the beginning and 81.8MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:17:39,965 INFO L158 Benchmark]: Boogie Preprocessor took 16.79ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 80.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:17:39,965 INFO L158 Benchmark]: RCFGBuilder took 257.31ms. Allocated memory is still 155.2MB. Free memory was 80.0MB in the beginning and 67.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:17:39,965 INFO L158 Benchmark]: BuchiAutomizer took 1937.96ms. Allocated memory is still 155.2MB. Free memory was 67.4MB in the beginning and 92.4MB in the end (delta: -25.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:17:39,966 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.76ms. Allocated memory is still 163.6MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.04ms. Allocated memory is still 155.2MB. Free memory was 105.5MB in the beginning and 83.5MB in the end (delta: 22.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.96ms. Allocated memory is still 155.2MB. Free memory was 83.5MB in the beginning and 81.8MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.79ms. Allocated memory is still 155.2MB. Free memory was 81.8MB in the beginning and 80.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 257.31ms. Allocated memory is still 155.2MB. Free memory was 80.0MB in the beginning and 67.4MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 1937.96ms. Allocated memory is still 155.2MB. Free memory was 67.4MB in the beginning and 92.4MB in the end (delta: -25.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 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, 99 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 458 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 159 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 299 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.5s InitialAbstraction: Time to compute Ample Reduction [ms]: 527, Number of transitions in reduction automaton: 838, Number of states in reduction automaton: 400, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 334 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: [L731] 0 atomic_int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L732] 0 int x; VAL [flag1=0, flag2=0, x=0] [L766] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, x=0] [L767] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\at(_, Pre)={0:0}, flag1=0, flag2=0, t1=-1, x=0] [L734] 1 flag1 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, x=0] [L735] COND FALSE 1 !(flag2 >= 3) VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, x=0] [L736] 1 flag1 = 3 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=3, flag2=0, x=0] [L768] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, flag1=3, flag2=0, t1=-1, t2=0, x=0] [L750] 2 flag2 = 1 VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, _={0:0}, flag1=3, flag2=1, x=0] Loop: [L751] COND TRUE flag1 >= 3 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: [L731] 0 atomic_int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L732] 0 int x; VAL [flag1=0, flag2=0, x=0] [L766] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, x=0] [L767] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\at(_, Pre)={0:0}, flag1=0, flag2=0, t1=-1, x=0] [L734] 1 flag1 = 1 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, x=0] [L735] COND FALSE 1 !(flag2 >= 3) VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=1, flag2=0, x=0] [L736] 1 flag1 = 3 VAL [\at(_, Pre)={0:0}, _={0:0}, flag1=3, flag2=0, x=0] [L768] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, flag1=3, flag2=0, t1=-1, t2=0, x=0] [L750] 2 flag2 = 1 VAL [\at(_, Pre)={0:0}, \at(_, Pre)={0:0}, _={0:0}, _={0:0}, flag1=3, flag2=1, x=0] Loop: [L751] COND TRUE flag1 >= 3 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 18:17:39,979 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...