/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-race-challenges/thread-join-array-const.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:47:53,300 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:47:53,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:47:53,348 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:47:53,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:47:53,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:47:53,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:47:53,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:47:53,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:47:53,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:47:53,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:47:53,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:47:53,364 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:47:53,364 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:47:53,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:47:53,365 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:47:53,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:47:53,366 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:47:53,366 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:47:53,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:47:53,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:47:53,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:47:53,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:47:53,366 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:47:53,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:47:53,366 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:47:53,366 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:47:53,366 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:47:53,367 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:47:53,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:47:53,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:47:53,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:47:53,589 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-26 16:47:53,589 INFO L274 PluginConnector]: CDTParser initialized [2025-04-26 16:47:53,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const.i [2025-04-26 16:47:54,889 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7478ae1e1/0bd682c17f484da1a4cf906cbc56e78e/FLAG1cfe3ae32 [2025-04-26 16:47:55,127 INFO L389 CDTParser]: Found 1 translation units. [2025-04-26 16:47:55,130 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const.i [2025-04-26 16:47:55,143 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7478ae1e1/0bd682c17f484da1a4cf906cbc56e78e/FLAG1cfe3ae32 [2025-04-26 16:47:56,040 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/7478ae1e1/0bd682c17f484da1a4cf906cbc56e78e [2025-04-26 16:47:56,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:47:56,043 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-26 16:47:56,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-26 16:47:56,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-26 16:47:56,047 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-26 16:47:56,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:47:56" (1/1) ... [2025-04-26 16:47:56,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20bb913b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56, skipping insertion in model container [2025-04-26 16:47:56,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.04 04:47:56" (1/1) ... [2025-04-26 16:47:56,070 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-26 16:47:56,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:47:56,349 INFO L200 MainTranslator]: Completed pre-run [2025-04-26 16:47:56,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-26 16:47:56,422 INFO L204 MainTranslator]: Completed translation [2025-04-26 16:47:56,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56 WrapperNode [2025-04-26 16:47:56,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-26 16:47:56,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:47:56,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:47:56,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:47:56,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56" (1/1) ... [2025-04-26 16:47:56,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56" (1/1) ... [2025-04-26 16:47:56,447 INFO L138 Inliner]: procedures = 158, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2025-04-26 16:47:56,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:47:56,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:47:56,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:47:56,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:47:56,452 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56" (1/1) ... [2025-04-26 16:47:56,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56" (1/1) ... [2025-04-26 16:47:56,456 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56" (1/1) ... [2025-04-26 16:47:56,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56" (1/1) ... [2025-04-26 16:47:56,464 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56" (1/1) ... [2025-04-26 16:47:56,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56" (1/1) ... [2025-04-26 16:47:56,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56" (1/1) ... [2025-04-26 16:47:56,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56" (1/1) ... [2025-04-26 16:47:56,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56" (1/1) ... [2025-04-26 16:47:56,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:47:56,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:47:56,471 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:47:56,471 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:47:56,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56" (1/1) ... [2025-04-26 16:47:56,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:47:56,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:47:56,498 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 16:47:56,500 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 16:47:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-26 16:47:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-26 16:47:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-26 16:47:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-26 16:47:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-26 16:47:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-26 16:47:56,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-26 16:47:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-26 16:47:56,517 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-26 16:47:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-26 16:47:56,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:47:56,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:47:56,517 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 16:47:56,612 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:47:56,613 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:47:56,699 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:47:56,699 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:47:56,713 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:47:56,713 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:47:56,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:47:56 BoogieIcfgContainer [2025-04-26 16:47:56,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:47:56,714 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:47:56,714 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:47:56,719 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:47:56,720 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:47:56,720 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.04 04:47:56" (1/3) ... [2025-04-26 16:47:56,721 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17ccf8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:47:56, skipping insertion in model container [2025-04-26 16:47:56,721 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:47:56,721 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.04 04:47:56" (2/3) ... [2025-04-26 16:47:56,721 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17ccf8ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:47:56, skipping insertion in model container [2025-04-26 16:47:56,721 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:47:56,721 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:47:56" (3/3) ... [2025-04-26 16:47:56,722 INFO L376 chiAutomizerObserver]: Analyzing ICFG thread-join-array-const.i [2025-04-26 16:47:56,759 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-26 16:47:56,793 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:47:56,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:47:56,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:47:56,796 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 16:47:56,800 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 16:47:56,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 55 transitions, 117 flow [2025-04-26 16:47:56,882 INFO L116 PetriNetUnfolderBase]: 2/72 cut-off events. [2025-04-26 16:47:56,883 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-26 16:47:56,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 72 events. 2/72 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 102 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 24. Up to 3 conditions per place. [2025-04-26 16:47:56,886 INFO L82 GeneralOperation]: Start removeDead. Operand has 56 places, 55 transitions, 117 flow [2025-04-26 16:47:56,888 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 56 places, 55 transitions, 117 flow [2025-04-26 16:47:56,888 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 56 places, 55 transitions, 117 flow [2025-04-26 16:47:56,893 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:47:57,009 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 349#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL]true [2025-04-26 16:47:57,025 WARN L140 AmpleReduction]: Number of pruned transitions: 106 [2025-04-26 16:47:57,025 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 1 [2025-04-26 16:47:57,025 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 1 [2025-04-26 16:47:57,025 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:74 [2025-04-26 16:47:57,025 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:96 [2025-04-26 16:47:57,025 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:47:57,025 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:47:57,025 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:47:57,027 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 171 states, 168 states have (on average 1.119047619047619) internal successors, (in total 188), 170 states have internal predecessors, (188), 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 16:47:57,035 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:47:57,035 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:47:57,035 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:47:57,035 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:47:57,035 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:47:57,035 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:47:57,036 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:47:57,036 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:47:57,037 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 171 states, 168 states have (on average 1.119047619047619) internal successors, (in total 188), 170 states have internal predecessors, (188), 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 16:47:57,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 16:47:57,054 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:47:57,054 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:47:57,060 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:47:57,060 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:47:57,060 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:47:57,060 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 171 states, 168 states have (on average 1.119047619047619) internal successors, (in total 188), 170 states have internal predecessors, (188), 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 16:47:57,068 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-04-26 16:47:57,068 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:47:57,068 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:47:57,072 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:47:57,072 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:47:57,078 INFO L752 eck$LassoCheckResult]: Stem: "[89] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[100] L-1-->L681: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[120] L681-->L682: Formula: (= v_~data~0_1 0) InVars {} OutVars{~data~0=v_~data~0_1} AuxVars[] AssignedVars[~data~0]" "[71] L682-->L682-1: Formula: (and (= (select |v_#length_1| 1) 24) (= (select |v_#valid_2| 1) 1)) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[84] L682-1-->L682-2: Formula: (and (= |v_~#data_mutex~0.base_1| 1) (= |v_~#data_mutex~0.offset_1| 0)) InVars {} OutVars{~#data_mutex~0.base=|v_~#data_mutex~0.base_1|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_1|} AuxVars[] AssignedVars[~#data_mutex~0.offset, ~#data_mutex~0.base]" "[74] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_1| |v_~#data_mutex~0.base_2|) |v_~#data_mutex~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} OutVars{#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} AuxVars[] AssignedVars[]" "[115] L682-3-->L682-4: Formula: (= 0 (select (select |v_#memory_int_2| |v_~#data_mutex~0.base_3|) (+ 4 |v_~#data_mutex~0.offset_3|))) InVars {#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} OutVars{#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} AuxVars[] AssignedVars[]" "[92] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_3| |v_~#data_mutex~0.base_4|) (+ 8 |v_~#data_mutex~0.offset_4|)) 0) InVars {#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} OutVars{#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} AuxVars[] AssignedVars[]" "[121] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_4| |v_~#data_mutex~0.base_5|) (+ 12 |v_~#data_mutex~0.offset_5|)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} OutVars{#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} AuxVars[] AssignedVars[]" "[81] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_5| |v_~#data_mutex~0.base_6|) (+ 16 |v_~#data_mutex~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} OutVars{#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} AuxVars[] AssignedVars[]" "[112] L682-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[114] L-1-1-->L690: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_1|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_#t~post5#1, ULTIMATE.start_main_~#tids~0#1.base, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_#t~pre3#1]" "[111] L690-->L691: Formula: (= |v_ULTIMATE.start_main_~threads_total~0#1_2| 4) InVars {} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~threads_total~0#1]" "[94] L691-->L691-1: Formula: (and (= (store |v_#length_3| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 16) |v_#length_2|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_main_~#tids~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) (= |v_ULTIMATE.start_main_~#tids~0#1.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_~#tids~0#1.base, #valid, #length]" "[122] L691-1-->L692-4: Formula: (= |v_ULTIMATE.start_main_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[77] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[109] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[72] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[113] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[136] L693-3-->$Ultimate##0: Formula: (and (= |v_ULTIMATE.start_main_#t~pre3#1_7| v_threadThread1of1ForFork0_thidvar0_2) (= |v_threadThread1of1ForFork0_#in~arg.base_4| 0) (= |v_threadThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_7|} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_4|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_4, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_4, threadThread1of1ForFork0_#res.base=|v_threadThread1of1ForFork0_#res.base_4|, threadThread1of1ForFork0_thidvar0=v_threadThread1of1ForFork0_thidvar0_2, threadThread1of1ForFork0_#t~ret0=|v_threadThread1of1ForFork0_#t~ret0_6|, threadThread1of1ForFork0_#res.offset=|v_threadThread1of1ForFork0_#res.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_7|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_4|, threadThread1of1ForFork0_#t~nondet1=|v_threadThread1of1ForFork0_#t~nondet1_8|, threadThread1of1ForFork0_#t~ret2=|v_threadThread1of1ForFork0_#t~ret2_6|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#in~arg.offset, threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset, threadThread1of1ForFork0_#res.base, threadThread1of1ForFork0_thidvar0, threadThread1of1ForFork0_#t~ret0, threadThread1of1ForFork0_#res.offset, threadThread1of1ForFork0_#in~arg.base, threadThread1of1ForFork0_#t~nondet1, threadThread1of1ForFork0_#t~ret2]" "[124] $Ultimate##0-->L684: Formula: (and (= v_threadThread1of1ForFork0_~arg.base_1 |v_threadThread1of1ForFork0_#in~arg.base_1|) (= |v_threadThread1of1ForFork0_#in~arg.offset_1| v_threadThread1of1ForFork0_~arg.offset_1)) InVars {threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_1|, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_1|} OutVars{threadThread1of1ForFork0_#in~arg.offset=|v_threadThread1of1ForFork0_#in~arg.offset_1|, threadThread1of1ForFork0_~arg.base=v_threadThread1of1ForFork0_~arg.base_1, threadThread1of1ForFork0_~arg.offset=v_threadThread1of1ForFork0_~arg.offset_1, threadThread1of1ForFork0_#in~arg.base=|v_threadThread1of1ForFork0_#in~arg.base_1|} AuxVars[] AssignedVars[threadThread1of1ForFork0_~arg.base, threadThread1of1ForFork0_~arg.offset]" "[125] L684-->L684-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_18| |v_~#data_mutex~0.base_15|))) (and (= (select .cse0 |v_~#data_mutex~0.offset_15|) 0) (= (store |v_#pthreadsMutex_18| |v_~#data_mutex~0.base_15| (store .cse0 |v_~#data_mutex~0.offset_15| 1)) |v_#pthreadsMutex_17|) (= |v_threadThread1of1ForFork0_#t~ret0_1| 0))) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_15|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_17|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_15|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_15|, threadThread1of1ForFork0_#t~ret0=|v_threadThread1of1ForFork0_#t~ret0_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_#t~ret0]" "[126] L684-3-->L685: Formula: true InVars {} OutVars{threadThread1of1ForFork0_#t~ret0=|v_threadThread1of1ForFork0_#t~ret0_3|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#t~ret0]" "[127] L685-->L685-1: Formula: true InVars {} OutVars{threadThread1of1ForFork0_#t~nondet1=|v_threadThread1of1ForFork0_#t~nondet1_1|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#t~nondet1]" "[87] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[118] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[103] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[83] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[95] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[77] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[109] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[72] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[113] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[134] L693-3-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[128] L685-1-->L685-2: Formula: (= |v_threadThread1of1ForFork0_#t~nondet1_3| v_~data~0_3) InVars {threadThread1of1ForFork0_#t~nondet1=|v_threadThread1of1ForFork0_#t~nondet1_3|} OutVars{~data~0=v_~data~0_3, threadThread1of1ForFork0_#t~nondet1=|v_threadThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[~data~0]" "[129] L685-2-->L686: Formula: true InVars {} OutVars{threadThread1of1ForFork0_#t~nondet1=|v_threadThread1of1ForFork0_#t~nondet1_5|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#t~nondet1]" "[130] L686-->L686-3: Formula: (and (= |v_threadThread1of1ForFork0_#t~ret2_1| 0) (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#data_mutex~0.base_11| (store (select |v_#pthreadsMutex_10| |v_~#data_mutex~0.base_11|) |v_~#data_mutex~0.offset_11| 0)))) InVars {~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, #pthreadsMutex=|v_#pthreadsMutex_10|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_11|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_11|, threadThread1of1ForFork0_#t~ret2=|v_threadThread1of1ForFork0_#t~ret2_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_#t~ret2]" "[131] L686-3-->L687: Formula: true InVars {} OutVars{threadThread1of1ForFork0_#t~ret2=|v_threadThread1of1ForFork0_#t~ret2_3|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#t~ret2]" "[132] L687-->threadFINAL: Formula: (and (= |v_threadThread1of1ForFork0_#res.base_1| 0) (= |v_threadThread1of1ForFork0_#res.offset_1| 0)) InVars {} OutVars{threadThread1of1ForFork0_#res.offset=|v_threadThread1of1ForFork0_#res.offset_1|, threadThread1of1ForFork0_#res.base=|v_threadThread1of1ForFork0_#res.base_1|} AuxVars[] AssignedVars[threadThread1of1ForFork0_#res.base, threadThread1of1ForFork0_#res.offset]" [2025-04-26 16:47:57,079 INFO L754 eck$LassoCheckResult]: Loop: "[135] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:47:57,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:47:57,085 INFO L85 PathProgramCache]: Analyzing trace with hash 61607183, now seen corresponding path program 1 times [2025-04-26 16:47:57,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:47:57,090 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142276493] [2025-04-26 16:47:57,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:47:57,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:47:57,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 16:47:57,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 16:47:57,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:57,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:57,200 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:47:57,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 16:47:57,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 16:47:57,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:57,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:57,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:47:57,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:47:57,254 INFO L85 PathProgramCache]: Analyzing trace with hash 166, now seen corresponding path program 1 times [2025-04-26 16:47:57,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:47:57,254 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338548026] [2025-04-26 16:47:57,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:47:57,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:47:57,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:47:57,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:47:57,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:57,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:57,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:47:57,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:47:57,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:47:57,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:57,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:57,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:47:57,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:47:57,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1909822808, now seen corresponding path program 1 times [2025-04-26 16:47:57,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:47:57,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762816034] [2025-04-26 16:47:57,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:47:57,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:47:57,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 16:47:57,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 16:47:57,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:57,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:57,301 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:47:57,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 16:47:57,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 16:47:57,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:57,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:57,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:47:57,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 16:47:57,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 16:47:57,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:57,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:57,977 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:47:57,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-26 16:47:57,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-26 16:47:57,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:57,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:58,004 WARN L166 chiAutomizerObserver]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:47:58,016 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:47:58,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:47:58,025 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:47:58,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:47:58,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:47:58,027 INFO L229 MonitoredProcess]: Starting monitored process 3 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 16:47:58,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Waiting until timeout for monitored process [2025-04-26 16:47:58,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 67 transitions, 150 flow [2025-04-26 16:47:58,068 INFO L116 PetriNetUnfolderBase]: 4/126 cut-off events. [2025-04-26 16:47:58,068 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:47:58,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 126 events. 4/126 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 257 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 73. Up to 6 conditions per place. [2025-04-26 16:47:58,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 67 transitions, 150 flow [2025-04-26 16:47:58,070 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 67 transitions, 150 flow [2025-04-26 16:47:58,070 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 69 places, 67 transitions, 150 flow [2025-04-26 16:47:58,070 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:47:58,191 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 768#[threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL]true [2025-04-26 16:47:58,214 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 976#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:58,271 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2198#[threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:47:58,272 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2144#[L685-1, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:58,273 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2124#[L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:58,310 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3006#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 16:47:58,310 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2986#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 16:47:58,310 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2960#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 16:47:58,329 WARN L140 AmpleReduction]: Number of pruned transitions: 1480 [2025-04-26 16:47:58,330 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 8 [2025-04-26 16:47:58,330 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 8 [2025-04-26 16:47:58,330 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:272 [2025-04-26 16:47:58,330 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:894 [2025-04-26 16:47:58,330 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:47:58,330 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:47:58,330 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:47:58,332 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 1167 states, 1162 states have (on average 1.2366609294320137) internal successors, (in total 1437), 1166 states have internal predecessors, (1437), 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 16:47:58,332 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:47:58,333 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:47:58,333 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:47:58,333 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:47:58,333 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:47:58,333 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:47:58,333 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:47:58,333 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:47:58,334 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1167 states, 1162 states have (on average 1.2366609294320137) internal successors, (in total 1437), 1166 states have internal predecessors, (1437), 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 16:47:58,350 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2025-04-26 16:47:58,350 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:47:58,350 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:47:58,351 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:47:58,351 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:47:58,351 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:47:58,352 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1167 states, 1162 states have (on average 1.2366609294320137) internal successors, (in total 1437), 1166 states have internal predecessors, (1437), 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 16:47:58,365 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 9 [2025-04-26 16:47:58,365 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:47:58,365 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:47:58,366 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:47:58,366 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:47:58,366 INFO L752 eck$LassoCheckResult]: Stem: "[182] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[193] L-1-->L681: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[213] L681-->L682: Formula: (= v_~data~0_1 0) InVars {} OutVars{~data~0=v_~data~0_1} AuxVars[] AssignedVars[~data~0]" "[164] L682-->L682-1: Formula: (and (= (select |v_#length_1| 1) 24) (= (select |v_#valid_2| 1) 1)) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[177] L682-1-->L682-2: Formula: (and (= |v_~#data_mutex~0.base_1| 1) (= |v_~#data_mutex~0.offset_1| 0)) InVars {} OutVars{~#data_mutex~0.base=|v_~#data_mutex~0.base_1|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_1|} AuxVars[] AssignedVars[~#data_mutex~0.offset, ~#data_mutex~0.base]" "[167] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_1| |v_~#data_mutex~0.base_2|) |v_~#data_mutex~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} OutVars{#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} AuxVars[] AssignedVars[]" "[208] L682-3-->L682-4: Formula: (= 0 (select (select |v_#memory_int_2| |v_~#data_mutex~0.base_3|) (+ 4 |v_~#data_mutex~0.offset_3|))) InVars {#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} OutVars{#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} AuxVars[] AssignedVars[]" "[185] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_3| |v_~#data_mutex~0.base_4|) (+ 8 |v_~#data_mutex~0.offset_4|)) 0) InVars {#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} OutVars{#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} AuxVars[] AssignedVars[]" "[214] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_4| |v_~#data_mutex~0.base_5|) (+ 12 |v_~#data_mutex~0.offset_5|)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} OutVars{#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} AuxVars[] AssignedVars[]" "[174] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_5| |v_~#data_mutex~0.base_6|) (+ 16 |v_~#data_mutex~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} OutVars{#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} AuxVars[] AssignedVars[]" "[205] L682-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[207] L-1-1-->L690: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_1|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_#t~post5#1, ULTIMATE.start_main_~#tids~0#1.base, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_#t~pre3#1]" "[204] L690-->L691: Formula: (= |v_ULTIMATE.start_main_~threads_total~0#1_2| 4) InVars {} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~threads_total~0#1]" "[187] L691-->L691-1: Formula: (and (= (store |v_#length_3| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 16) |v_#length_2|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_main_~#tids~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) (= |v_ULTIMATE.start_main_~#tids~0#1.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_~#tids~0#1.base, #valid, #length]" "[215] L691-1-->L692-4: Formula: (= |v_ULTIMATE.start_main_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[170] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[202] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[165] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[206] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[239] L693-3-->$Ultimate##0: Formula: (and (= v_threadThread1of2ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_13|) (= |v_threadThread1of2ForFork0_#in~arg.base_4| 0) (= |v_threadThread1of2ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_13|} OutVars{threadThread1of2ForFork0_~arg.base=v_threadThread1of2ForFork0_~arg.base_4, threadThread1of2ForFork0_#res.base=|v_threadThread1of2ForFork0_#res.base_4|, threadThread1of2ForFork0_#t~ret2=|v_threadThread1of2ForFork0_#t~ret2_6|, threadThread1of2ForFork0_#t~nondet1=|v_threadThread1of2ForFork0_#t~nondet1_8|, threadThread1of2ForFork0_thidvar0=v_threadThread1of2ForFork0_thidvar0_2, threadThread1of2ForFork0_#res.offset=|v_threadThread1of2ForFork0_#res.offset_4|, threadThread1of2ForFork0_~arg.offset=v_threadThread1of2ForFork0_~arg.offset_4, threadThread1of2ForFork0_#t~ret0=|v_threadThread1of2ForFork0_#t~ret0_6|, threadThread1of2ForFork0_#in~arg.base=|v_threadThread1of2ForFork0_#in~arg.base_4|, threadThread1of2ForFork0_#in~arg.offset=|v_threadThread1of2ForFork0_#in~arg.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_13|} AuxVars[] AssignedVars[threadThread1of2ForFork0_~arg.base, threadThread1of2ForFork0_#res.base, threadThread1of2ForFork0_#t~ret2, threadThread1of2ForFork0_#t~nondet1, threadThread1of2ForFork0_thidvar0, threadThread1of2ForFork0_#res.offset, threadThread1of2ForFork0_~arg.offset, threadThread1of2ForFork0_#t~ret0, threadThread1of2ForFork0_#in~arg.base, threadThread1of2ForFork0_#in~arg.offset]" "[217] $Ultimate##0-->L684: Formula: (and (= v_threadThread1of2ForFork0_~arg.offset_1 |v_threadThread1of2ForFork0_#in~arg.offset_1|) (= v_threadThread1of2ForFork0_~arg.base_1 |v_threadThread1of2ForFork0_#in~arg.base_1|)) InVars {threadThread1of2ForFork0_#in~arg.offset=|v_threadThread1of2ForFork0_#in~arg.offset_1|, threadThread1of2ForFork0_#in~arg.base=|v_threadThread1of2ForFork0_#in~arg.base_1|} OutVars{threadThread1of2ForFork0_~arg.base=v_threadThread1of2ForFork0_~arg.base_1, threadThread1of2ForFork0_~arg.offset=v_threadThread1of2ForFork0_~arg.offset_1, threadThread1of2ForFork0_#in~arg.offset=|v_threadThread1of2ForFork0_#in~arg.offset_1|, threadThread1of2ForFork0_#in~arg.base=|v_threadThread1of2ForFork0_#in~arg.base_1|} AuxVars[] AssignedVars[threadThread1of2ForFork0_~arg.base, threadThread1of2ForFork0_~arg.offset]" "[180] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[211] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[196] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[176] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[188] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[170] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[202] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[165] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[206] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[240] L693-3-->$Ultimate##0: Formula: (and (= |v_threadThread2of2ForFork0_#in~arg.base_4| 0) (= v_threadThread2of2ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_15|) (= |v_threadThread2of2ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_15|} OutVars{threadThread2of2ForFork0_#in~arg.base=|v_threadThread2of2ForFork0_#in~arg.base_4|, threadThread2of2ForFork0_#t~nondet1=|v_threadThread2of2ForFork0_#t~nondet1_8|, threadThread2of2ForFork0_#t~ret2=|v_threadThread2of2ForFork0_#t~ret2_6|, threadThread2of2ForFork0_~arg.offset=v_threadThread2of2ForFork0_~arg.offset_4, threadThread2of2ForFork0_#t~ret0=|v_threadThread2of2ForFork0_#t~ret0_6|, threadThread2of2ForFork0_#res.offset=|v_threadThread2of2ForFork0_#res.offset_4|, threadThread2of2ForFork0_~arg.base=v_threadThread2of2ForFork0_~arg.base_4, threadThread2of2ForFork0_thidvar0=v_threadThread2of2ForFork0_thidvar0_2, threadThread2of2ForFork0_#in~arg.offset=|v_threadThread2of2ForFork0_#in~arg.offset_4|, threadThread2of2ForFork0_#res.base=|v_threadThread2of2ForFork0_#res.base_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_15|} AuxVars[] AssignedVars[threadThread2of2ForFork0_#in~arg.base, threadThread2of2ForFork0_#t~nondet1, threadThread2of2ForFork0_#t~ret2, threadThread2of2ForFork0_~arg.offset, threadThread2of2ForFork0_#t~ret0, threadThread2of2ForFork0_#res.offset, threadThread2of2ForFork0_~arg.base, threadThread2of2ForFork0_thidvar0, threadThread2of2ForFork0_#in~arg.offset, threadThread2of2ForFork0_#res.base]" "[227] $Ultimate##0-->L684: Formula: (and (= v_threadThread2of2ForFork0_~arg.offset_1 |v_threadThread2of2ForFork0_#in~arg.offset_1|) (= |v_threadThread2of2ForFork0_#in~arg.base_1| v_threadThread2of2ForFork0_~arg.base_1)) InVars {threadThread2of2ForFork0_#in~arg.base=|v_threadThread2of2ForFork0_#in~arg.base_1|, threadThread2of2ForFork0_#in~arg.offset=|v_threadThread2of2ForFork0_#in~arg.offset_1|} OutVars{threadThread2of2ForFork0_#in~arg.base=|v_threadThread2of2ForFork0_#in~arg.base_1|, threadThread2of2ForFork0_#in~arg.offset=|v_threadThread2of2ForFork0_#in~arg.offset_1|, threadThread2of2ForFork0_~arg.offset=v_threadThread2of2ForFork0_~arg.offset_1, threadThread2of2ForFork0_~arg.base=v_threadThread2of2ForFork0_~arg.base_1} AuxVars[] AssignedVars[threadThread2of2ForFork0_~arg.offset, threadThread2of2ForFork0_~arg.base]" "[180] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[211] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[196] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[176] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[188] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[170] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[202] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[165] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[206] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[237] L693-3-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:47:58,367 INFO L754 eck$LassoCheckResult]: Loop: "[238] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:47:58,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:47:58,367 INFO L85 PathProgramCache]: Analyzing trace with hash -496369031, now seen corresponding path program 1 times [2025-04-26 16:47:58,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:47:58,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718395329] [2025-04-26 16:47:58,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:47:58,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:47:58,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 16:47:58,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 16:47:58,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:58,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:58,397 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:47:58,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 16:47:58,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 16:47:58,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:58,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:58,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:47:58,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:47:58,427 INFO L85 PathProgramCache]: Analyzing trace with hash 269, now seen corresponding path program 1 times [2025-04-26 16:47:58,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:47:58,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359115395] [2025-04-26 16:47:58,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:47:58,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:47:58,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:47:58,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:47:58,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:58,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:58,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:47:58,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:47:58,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:47:58,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:58,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:58,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:47:58,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:47:58,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1792429461, now seen corresponding path program 1 times [2025-04-26 16:47:58,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:47:58,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849287709] [2025-04-26 16:47:58,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:47:58,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:47:58,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 16:47:58,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 16:47:58,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:58,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:58,467 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:47:58,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-26 16:47:58,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-26 16:47:58,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:58,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:58,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:47:59,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 16:47:59,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 16:47:59,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:59,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:59,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:47:59,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-26 16:47:59,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-26 16:47:59,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:47:59,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:47:59,070 WARN L166 chiAutomizerObserver]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:47:59,080 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:47:59,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (3)] Ended with exit code 0 [2025-04-26 16:47:59,089 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:47:59,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:47:59,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:47:59,092 INFO L229 MonitoredProcess]: Starting monitored process 4 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 16:47:59,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Waiting until timeout for monitored process [2025-04-26 16:47:59,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 79 transitions, 185 flow [2025-04-26 16:47:59,151 INFO L116 PetriNetUnfolderBase]: 9/213 cut-off events. [2025-04-26 16:47:59,151 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-26 16:47:59,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 213 events. 9/213 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 547 event pairs, 1 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 133. Up to 12 conditions per place. [2025-04-26 16:47:59,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 79 transitions, 185 flow [2025-04-26 16:47:59,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 79 transitions, 185 flow [2025-04-26 16:47:59,154 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 82 places, 79 transitions, 185 flow [2025-04-26 16:47:59,154 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:47:59,294 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1523#[threadFINAL, threadEXIT, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,308 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 1729#[L686, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,389 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3895#[threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadFINAL, threadEXIT]true [2025-04-26 16:47:59,389 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3839#[threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L685-1]true [2025-04-26 16:47:59,390 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3821#[threadEXIT, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,428 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5053#[L684, threadEXIT, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,429 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5039#[L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:47:59,429 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5021#[L684, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,457 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 5891#[L684, L686, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,470 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 6399#[L686, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,513 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 8679#[L684, L686, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,546 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10679#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:47:59,547 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10649#[L684, L686, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,548 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10631#[L684, L686, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,549 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10607#[L684, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,678 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 15513#[threadFINAL, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:47:59,679 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 15459#[L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:47:59,679 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 15441#[L685-1, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,703 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 16451#[L685-1, L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,734 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17981#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT]true [2025-04-26 16:47:59,735 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17933#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L685-1]true [2025-04-26 16:47:59,735 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 17909#[L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:47:59,785 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 20163#[L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:47:59,786 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 20133#[L685-1, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,787 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 20115#[L685-1, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:47:59,787 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 20091#[L685-1, L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,845 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 22491#[L684, threadEXIT, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,846 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 22477#[L684, threadEXIT, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,846 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 22459#[L684, L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,885 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 24231#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:47:59,887 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 24201#[L686, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,889 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 24183#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:47:59,890 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 24159#[L686, L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,961 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 27351#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT]true [2025-04-26 16:47:59,961 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 27321#[L684, L686, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:47:59,962 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 27303#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L685-1]true [2025-04-26 16:47:59,962 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 27279#[L684, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:48:00,023 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 29053#[L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:00,024 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 29023#[L684, L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:48:00,025 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 29005#[L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:48:00,025 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 28981#[L684, L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:48:00,061 WARN L140 AmpleReduction]: Number of pruned transitions: 15037 [2025-04-26 16:48:00,061 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 41 [2025-04-26 16:48:00,061 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 41 [2025-04-26 16:48:00,061 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:1097 [2025-04-26 16:48:00,061 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:6542 [2025-04-26 16:48:00,061 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:48:00,061 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:48:00,062 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:48:00,073 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 7640 states, 7631 states have (on average 1.288690866203643) internal successors, (in total 9834), 7639 states have internal predecessors, (9834), 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 16:48:00,073 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:48:00,073 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:48:00,073 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:48:00,073 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:48:00,073 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:48:00,073 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:48:00,073 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:48:00,073 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:48:00,082 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7640 states, 7631 states have (on average 1.288690866203643) internal successors, (in total 9834), 7639 states have internal predecessors, (9834), 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 16:48:00,158 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 42 [2025-04-26 16:48:00,158 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:48:00,158 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:48:00,160 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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 16:48:00,160 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:48:00,161 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:48:00,170 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7640 states, 7631 states have (on average 1.288690866203643) internal successors, (in total 9834), 7639 states have internal predecessors, (9834), 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 16:48:00,217 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 42 [2025-04-26 16:48:00,217 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:48:00,217 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:48:00,218 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 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 16:48:00,218 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:48:00,219 INFO L752 eck$LassoCheckResult]: Stem: "[359] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[370] L-1-->L681: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[390] L681-->L682: Formula: (= v_~data~0_1 0) InVars {} OutVars{~data~0=v_~data~0_1} AuxVars[] AssignedVars[~data~0]" "[341] L682-->L682-1: Formula: (and (= (select |v_#length_1| 1) 24) (= (select |v_#valid_2| 1) 1)) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[354] L682-1-->L682-2: Formula: (and (= |v_~#data_mutex~0.base_1| 1) (= |v_~#data_mutex~0.offset_1| 0)) InVars {} OutVars{~#data_mutex~0.base=|v_~#data_mutex~0.base_1|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_1|} AuxVars[] AssignedVars[~#data_mutex~0.offset, ~#data_mutex~0.base]" "[344] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_1| |v_~#data_mutex~0.base_2|) |v_~#data_mutex~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} OutVars{#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} AuxVars[] AssignedVars[]" "[385] L682-3-->L682-4: Formula: (= 0 (select (select |v_#memory_int_2| |v_~#data_mutex~0.base_3|) (+ 4 |v_~#data_mutex~0.offset_3|))) InVars {#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} OutVars{#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} AuxVars[] AssignedVars[]" "[362] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_3| |v_~#data_mutex~0.base_4|) (+ 8 |v_~#data_mutex~0.offset_4|)) 0) InVars {#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} OutVars{#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} AuxVars[] AssignedVars[]" "[391] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_4| |v_~#data_mutex~0.base_5|) (+ 12 |v_~#data_mutex~0.offset_5|)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} OutVars{#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} AuxVars[] AssignedVars[]" "[351] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_5| |v_~#data_mutex~0.base_6|) (+ 16 |v_~#data_mutex~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} OutVars{#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} AuxVars[] AssignedVars[]" "[382] L682-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[384] L-1-1-->L690: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_1|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_#t~post5#1, ULTIMATE.start_main_~#tids~0#1.base, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_#t~pre3#1]" "[381] L690-->L691: Formula: (= |v_ULTIMATE.start_main_~threads_total~0#1_2| 4) InVars {} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~threads_total~0#1]" "[364] L691-->L691-1: Formula: (and (= (store |v_#length_3| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 16) |v_#length_2|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_main_~#tids~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) (= |v_ULTIMATE.start_main_~#tids~0#1.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_~#tids~0#1.base, #valid, #length]" "[392] L691-1-->L692-4: Formula: (= |v_ULTIMATE.start_main_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[347] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[379] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[342] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[383] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[426] L693-3-->$Ultimate##0: Formula: (and (= |v_threadThread1of3ForFork0_#in~arg.offset_4| 0) (= v_threadThread1of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_23|) (= |v_threadThread1of3ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_23|} OutVars{threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_4|, threadThread1of3ForFork0_#t~nondet1=|v_threadThread1of3ForFork0_#t~nondet1_8|, threadThread1of3ForFork0_#t~ret2=|v_threadThread1of3ForFork0_#t~ret2_6|, threadThread1of3ForFork0_#in~arg.base=|v_threadThread1of3ForFork0_#in~arg.base_4|, threadThread1of3ForFork0_#t~ret0=|v_threadThread1of3ForFork0_#t~ret0_6|, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_4|, threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_2, threadThread1of3ForFork0_#in~arg.offset=|v_threadThread1of3ForFork0_#in~arg.offset_4|, threadThread1of3ForFork0_~arg.base=v_threadThread1of3ForFork0_~arg.base_4, threadThread1of3ForFork0_~arg.offset=v_threadThread1of3ForFork0_~arg.offset_4, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_23|} AuxVars[] AssignedVars[threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#t~nondet1, threadThread1of3ForFork0_#t~ret2, threadThread1of3ForFork0_#in~arg.base, threadThread1of3ForFork0_#t~ret0, threadThread1of3ForFork0_#res.offset, threadThread1of3ForFork0_thidvar0, threadThread1of3ForFork0_#in~arg.offset, threadThread1of3ForFork0_~arg.base, threadThread1of3ForFork0_~arg.offset]" "[414] $Ultimate##0-->L684: Formula: (and (= v_threadThread1of3ForFork0_~arg.offset_1 |v_threadThread1of3ForFork0_#in~arg.offset_1|) (= v_threadThread1of3ForFork0_~arg.base_1 |v_threadThread1of3ForFork0_#in~arg.base_1|)) InVars {threadThread1of3ForFork0_#in~arg.offset=|v_threadThread1of3ForFork0_#in~arg.offset_1|, threadThread1of3ForFork0_#in~arg.base=|v_threadThread1of3ForFork0_#in~arg.base_1|} OutVars{threadThread1of3ForFork0_#in~arg.offset=|v_threadThread1of3ForFork0_#in~arg.offset_1|, threadThread1of3ForFork0_#in~arg.base=|v_threadThread1of3ForFork0_#in~arg.base_1|, threadThread1of3ForFork0_~arg.base=v_threadThread1of3ForFork0_~arg.base_1, threadThread1of3ForFork0_~arg.offset=v_threadThread1of3ForFork0_~arg.offset_1} AuxVars[] AssignedVars[threadThread1of3ForFork0_~arg.base, threadThread1of3ForFork0_~arg.offset]" "[357] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[388] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[373] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[353] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[365] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[347] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[379] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[342] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[383] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[427] L693-3-->$Ultimate##0: Formula: (and (= |v_threadThread2of3ForFork0_#in~arg.offset_4| 0) (= |v_threadThread2of3ForFork0_#in~arg.base_4| 0) (= v_threadThread2of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_25|)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|} OutVars{threadThread2of3ForFork0_thidvar0=v_threadThread2of3ForFork0_thidvar0_2, threadThread2of3ForFork0_#t~nondet1=|v_threadThread2of3ForFork0_#t~nondet1_8|, threadThread2of3ForFork0_#in~arg.offset=|v_threadThread2of3ForFork0_#in~arg.offset_4|, threadThread2of3ForFork0_#res.offset=|v_threadThread2of3ForFork0_#res.offset_4|, threadThread2of3ForFork0_#t~ret0=|v_threadThread2of3ForFork0_#t~ret0_6|, threadThread2of3ForFork0_#res.base=|v_threadThread2of3ForFork0_#res.base_4|, threadThread2of3ForFork0_#t~ret2=|v_threadThread2of3ForFork0_#t~ret2_6|, threadThread2of3ForFork0_#in~arg.base=|v_threadThread2of3ForFork0_#in~arg.base_4|, threadThread2of3ForFork0_~arg.offset=v_threadThread2of3ForFork0_~arg.offset_4, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_25|, threadThread2of3ForFork0_~arg.base=v_threadThread2of3ForFork0_~arg.base_4} AuxVars[] AssignedVars[threadThread2of3ForFork0_thidvar0, threadThread2of3ForFork0_#t~nondet1, threadThread2of3ForFork0_#in~arg.offset, threadThread2of3ForFork0_#res.offset, threadThread2of3ForFork0_#t~ret0, threadThread2of3ForFork0_#res.base, threadThread2of3ForFork0_#t~ret2, threadThread2of3ForFork0_#in~arg.base, threadThread2of3ForFork0_~arg.offset, threadThread2of3ForFork0_~arg.base]" "[404] $Ultimate##0-->L684: Formula: (and (= |v_threadThread2of3ForFork0_#in~arg.base_1| v_threadThread2of3ForFork0_~arg.base_1) (= v_threadThread2of3ForFork0_~arg.offset_1 |v_threadThread2of3ForFork0_#in~arg.offset_1|)) InVars {threadThread2of3ForFork0_#in~arg.base=|v_threadThread2of3ForFork0_#in~arg.base_1|, threadThread2of3ForFork0_#in~arg.offset=|v_threadThread2of3ForFork0_#in~arg.offset_1|} OutVars{threadThread2of3ForFork0_#in~arg.base=|v_threadThread2of3ForFork0_#in~arg.base_1|, threadThread2of3ForFork0_~arg.offset=v_threadThread2of3ForFork0_~arg.offset_1, threadThread2of3ForFork0_#in~arg.offset=|v_threadThread2of3ForFork0_#in~arg.offset_1|, threadThread2of3ForFork0_~arg.base=v_threadThread2of3ForFork0_~arg.base_1} AuxVars[] AssignedVars[threadThread2of3ForFork0_~arg.offset, threadThread2of3ForFork0_~arg.base]" "[357] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[388] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[373] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[353] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[365] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[347] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[379] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[342] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[383] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[428] L693-3-->$Ultimate##0: Formula: (and (= |v_threadThread3of3ForFork0_#in~arg.base_4| 0) (= v_threadThread3of3ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_27|) (= |v_threadThread3of3ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_27|} OutVars{threadThread3of3ForFork0_#in~arg.offset=|v_threadThread3of3ForFork0_#in~arg.offset_4|, threadThread3of3ForFork0_#res.base=|v_threadThread3of3ForFork0_#res.base_4|, threadThread3of3ForFork0_#t~ret2=|v_threadThread3of3ForFork0_#t~ret2_6|, threadThread3of3ForFork0_~arg.offset=v_threadThread3of3ForFork0_~arg.offset_4, threadThread3of3ForFork0_#t~ret0=|v_threadThread3of3ForFork0_#t~ret0_6|, threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_2, threadThread3of3ForFork0_#res.offset=|v_threadThread3of3ForFork0_#res.offset_4|, threadThread3of3ForFork0_#in~arg.base=|v_threadThread3of3ForFork0_#in~arg.base_4|, threadThread3of3ForFork0_#t~nondet1=|v_threadThread3of3ForFork0_#t~nondet1_8|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_27|, threadThread3of3ForFork0_~arg.base=v_threadThread3of3ForFork0_~arg.base_4} AuxVars[] AssignedVars[threadThread3of3ForFork0_#in~arg.offset, threadThread3of3ForFork0_#res.base, threadThread3of3ForFork0_#t~ret2, threadThread3of3ForFork0_~arg.offset, threadThread3of3ForFork0_#t~ret0, threadThread3of3ForFork0_thidvar0, threadThread3of3ForFork0_#res.offset, threadThread3of3ForFork0_#in~arg.base, threadThread3of3ForFork0_#t~nondet1, threadThread3of3ForFork0_~arg.base]" "[394] $Ultimate##0-->L684: Formula: (and (= v_threadThread3of3ForFork0_~arg.offset_1 |v_threadThread3of3ForFork0_#in~arg.offset_1|) (= v_threadThread3of3ForFork0_~arg.base_1 |v_threadThread3of3ForFork0_#in~arg.base_1|)) InVars {threadThread3of3ForFork0_#in~arg.base=|v_threadThread3of3ForFork0_#in~arg.base_1|, threadThread3of3ForFork0_#in~arg.offset=|v_threadThread3of3ForFork0_#in~arg.offset_1|} OutVars{threadThread3of3ForFork0_~arg.offset=v_threadThread3of3ForFork0_~arg.offset_1, threadThread3of3ForFork0_#in~arg.base=|v_threadThread3of3ForFork0_#in~arg.base_1|, threadThread3of3ForFork0_#in~arg.offset=|v_threadThread3of3ForFork0_#in~arg.offset_1|, threadThread3of3ForFork0_~arg.base=v_threadThread3of3ForFork0_~arg.base_1} AuxVars[] AssignedVars[threadThread3of3ForFork0_~arg.offset, threadThread3of3ForFork0_~arg.base]" "[357] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[388] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[373] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[353] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[365] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[347] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[379] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[342] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[383] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[424] L693-3-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:48:00,219 INFO L754 eck$LassoCheckResult]: Loop: "[425] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:48:00,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:48:00,219 INFO L85 PathProgramCache]: Analyzing trace with hash 330418100, now seen corresponding path program 1 times [2025-04-26 16:48:00,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:48:00,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557752994] [2025-04-26 16:48:00,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:48:00,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:48:00,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-26 16:48:00,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-26 16:48:00,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:48:00,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:48:00,241 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:48:00,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-26 16:48:00,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-26 16:48:00,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:48:00,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:48:00,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:48:00,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:48:00,262 INFO L85 PathProgramCache]: Analyzing trace with hash 456, now seen corresponding path program 1 times [2025-04-26 16:48:00,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:48:00,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282492497] [2025-04-26 16:48:00,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:48:00,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:48:00,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:48:00,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:48:00,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:48:00,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:48:00,264 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:48:00,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:48:00,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:48:00,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:48:00,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:48:00,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:48:00,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:48:00,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1653026933, now seen corresponding path program 1 times [2025-04-26 16:48:00,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:48:00,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281473630] [2025-04-26 16:48:00,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:48:00,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:48:00,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 16:48:00,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 16:48:00,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:48:00,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:48:00,279 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:48:00,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-26 16:48:00,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-26 16:48:00,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:48:00,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:48:00,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:48:01,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-26 16:48:01,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-26 16:48:01,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:48:01,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:48:01,010 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:48:01,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-26 16:48:01,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-26 16:48:01,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:48:01,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:48:01,036 WARN L166 chiAutomizerObserver]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-26 16:48:01,049 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:48:01,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:48:01,059 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:48:01,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:48:01,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:48:01,060 INFO L229 MonitoredProcess]: Starting monitored process 5 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 16:48:01,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Waiting until timeout for monitored process [2025-04-26 16:48:01,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 91 transitions, 222 flow [2025-04-26 16:48:01,119 INFO L116 PetriNetUnfolderBase]: 22/368 cut-off events. [2025-04-26 16:48:01,119 INFO L117 PetriNetUnfolderBase]: For 48/49 co-relation queries the response was YES. [2025-04-26 16:48:01,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 368 events. 22/368 cut-off events. For 48/49 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1307 event pairs, 6 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 232. Up to 32 conditions per place. [2025-04-26 16:48:01,121 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 91 transitions, 222 flow [2025-04-26 16:48:01,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 91 transitions, 222 flow [2025-04-26 16:48:01,126 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 95 places, 91 transitions, 222 flow [2025-04-26 16:48:01,126 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:48:01,295 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 2950#[threadFINAL, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, threadEXIT]true [2025-04-26 16:48:01,304 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 3160#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, threadEXIT]true [2025-04-26 16:48:01,393 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 7206#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, threadFINAL, threadEXIT, threadEXIT]true [2025-04-26 16:48:01,394 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 7152#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT, threadEXIT]true [2025-04-26 16:48:01,394 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 7132#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT, L684, threadEXIT]true [2025-04-26 16:48:01,429 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9112#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, threadEXIT]true [2025-04-26 16:48:01,429 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9092#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, threadEXIT]true [2025-04-26 16:48:01,429 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9066#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L684, threadEXIT]true [2025-04-26 16:48:01,447 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 9936#[L686, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 16:48:01,455 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 10446#[L686, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 16:48:01,504 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 14618#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT, L684]true [2025-04-26 16:48:01,547 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 18376#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, threadEXIT]true [2025-04-26 16:48:01,548 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 18260#[L686, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 16:48:01,548 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 18214#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L685-1]true [2025-04-26 16:48:01,548 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 18160#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L684]true [2025-04-26 16:48:01,701 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 25446#[threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, threadEXIT, threadFINAL]true [2025-04-26 16:48:01,701 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 25390#[L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L685-1]true [2025-04-26 16:48:01,701 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 25370#[L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 16:48:01,734 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 26968#[L685-1, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 16:48:01,778 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 29396#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT, threadEXIT]true [2025-04-26 16:48:01,779 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 29344#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT, L685-1]true [2025-04-26 16:48:01,779 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 29314#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT, L684]true [2025-04-26 16:48:01,846 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 33182#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, threadEXIT]true [2025-04-26 16:48:01,846 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 33138#[L685-1, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 16:48:01,846 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 33108#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L685-1]true [2025-04-26 16:48:01,846 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 33070#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L684]true [2025-04-26 16:48:01,895 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 36596#[L686, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:01,895 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 36576#[threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L685-1]true [2025-04-26 16:48:01,895 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 36550#[threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 16:48:01,931 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 39812#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, threadEXIT]true [2025-04-26 16:48:01,931 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 39700#[L686, L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:01,931 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 39654#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L685-1]true [2025-04-26 16:48:01,931 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 39600#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 16:48:02,028 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 44420#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, threadEXIT]true [2025-04-26 16:48:02,028 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 44376#[L686, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:02,029 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 44346#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L685-1]true [2025-04-26 16:48:02,029 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 44308#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 16:48:02,059 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 47004#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, threadEXIT]true [2025-04-26 16:48:02,059 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 46952#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 16:48:02,059 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 46914#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L685-1]true [2025-04-26 16:48:02,059 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 46868#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L684]true [2025-04-26 16:48:02,094 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 49068#[threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L684, threadEXIT]true [2025-04-26 16:48:02,104 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 49578#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686, threadEXIT]true [2025-04-26 16:48:02,152 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 53780#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L686, L684, threadEXIT]true [2025-04-26 16:48:02,189 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 57490#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L686, threadEXIT]true [2025-04-26 16:48:02,189 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 57376#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686, threadEXIT]true [2025-04-26 16:48:02,189 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 57330#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686, threadEXIT]true [2025-04-26 16:48:02,190 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 57276#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686, threadEXIT]true [2025-04-26 16:48:02,224 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 60274#[L686, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L684]true [2025-04-26 16:48:02,236 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 61390#[L686, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L684]true [2025-04-26 16:48:02,272 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 65640#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L686, L684]true [2025-04-26 16:48:02,350 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 69712#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L686]true [2025-04-26 16:48:02,351 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 69514#[L686, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 16:48:02,351 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 69432#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686, L685-1]true [2025-04-26 16:48:02,351 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 69340#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686, L684]true [2025-04-26 16:48:02,434 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 78428#[L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L684]true [2025-04-26 16:48:02,449 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 79982#[L685-1, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 16:48:02,465 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 81838#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L686, L684]true [2025-04-26 16:48:02,511 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 86574#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L686]true [2025-04-26 16:48:02,511 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 86424#[L685-1, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 16:48:02,511 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 86362#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686, L685-1]true [2025-04-26 16:48:02,511 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 86290#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686, L684]true [2025-04-26 16:48:02,633 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 94644#[threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L686]true [2025-04-26 16:48:02,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 94530#[L686, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 16:48:02,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 94484#[threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L685-1]true [2025-04-26 16:48:02,634 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 94430#[threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L684]true [2025-04-26 16:48:02,680 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 99236#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L686]true [2025-04-26 16:48:02,680 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 99044#[L686, L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 16:48:02,680 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 98962#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L685-1]true [2025-04-26 16:48:02,680 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 98870#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 16:48:02,737 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 105842#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L686]true [2025-04-26 16:48:02,737 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 105762#[L686, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686]true [2025-04-26 16:48:02,737 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 105700#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L685-1]true [2025-04-26 16:48:02,737 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 105628#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L686, L684]true [2025-04-26 16:48:02,768 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109332#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L686]true [2025-04-26 16:48:02,769 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109242#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686]true [2025-04-26 16:48:02,769 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109170#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686, L685-1]true [2025-04-26 16:48:02,769 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109088#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L686, L684]true [2025-04-26 16:48:02,961 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 118070#[threadEXIT, threadFINAL, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, threadEXIT]true [2025-04-26 16:48:02,962 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 118016#[L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT]true [2025-04-26 16:48:02,962 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 117996#[threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1, threadEXIT]true [2025-04-26 16:48:02,988 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 119594#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1, threadEXIT]true [2025-04-26 16:48:03,024 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 121962#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT, L685-1, threadEXIT]true [2025-04-26 16:48:03,024 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 121910#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L685-1, threadEXIT]true [2025-04-26 16:48:03,024 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 121880#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684, L685-1, threadEXIT]true [2025-04-26 16:48:03,077 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 125266#[ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L685-1, threadEXIT]true [2025-04-26 16:48:03,077 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 125222#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1, threadEXIT]true [2025-04-26 16:48:03,077 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 125192#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1, threadEXIT]true [2025-04-26 16:48:03,077 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 125154#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1, threadEXIT]true [2025-04-26 16:48:03,121 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 128112#[L686, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1]true [2025-04-26 16:48:03,143 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 129662#[L686, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1]true [2025-04-26 16:48:03,166 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 131526#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684, L685-1]true [2025-04-26 16:48:03,211 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 135112#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L685-1]true [2025-04-26 16:48:03,212 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 134964#[L686, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1]true [2025-04-26 16:48:03,212 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 134902#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1, L685-1]true [2025-04-26 16:48:03,212 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 134830#[L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1, L684]true [2025-04-26 16:48:03,305 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141422#[L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L685-1]true [2025-04-26 16:48:03,306 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141370#[L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L685-1]true [2025-04-26 16:48:03,306 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 141340#[L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1]true [2025-04-26 16:48:03,329 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 142866#[L685-1, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1]true [2025-04-26 16:48:03,358 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 144990#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT, L685-1]true [2025-04-26 16:48:03,358 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 144920#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L685-1, L685-1]true [2025-04-26 16:48:03,358 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 144878#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684, L685-1]true [2025-04-26 16:48:03,396 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 147556#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L685-1]true [2025-04-26 16:48:03,397 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 147496#[L685-1, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1]true [2025-04-26 16:48:03,397 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 147454#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1, L685-1]true [2025-04-26 16:48:03,397 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 147402#[L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1, L684]true [2025-04-26 16:48:03,485 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 153312#[threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L685-1]true [2025-04-26 16:48:03,486 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 153268#[L686, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:48:03,486 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 153238#[threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L685-1]true [2025-04-26 16:48:03,486 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 153200#[threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1]true [2025-04-26 16:48:03,530 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 156640#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L685-1]true [2025-04-26 16:48:03,530 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 156494#[L686, L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:48:03,530 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 156432#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L685-1]true [2025-04-26 16:48:03,530 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 156360#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1]true [2025-04-26 16:48:03,562 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 160334#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L685-1]true [2025-04-26 16:48:03,563 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 160274#[L686, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:48:03,563 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 160232#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L685-1]true [2025-04-26 16:48:03,563 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 160180#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1]true [2025-04-26 16:48:03,666 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 164116#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, L685-1]true [2025-04-26 16:48:03,667 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 164046#[L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1]true [2025-04-26 16:48:03,667 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 163994#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1, L685-1]true [2025-04-26 16:48:03,667 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 163932#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1, L684]true [2025-04-26 16:48:03,722 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 169382#[L684, L686, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:03,722 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 169362#[L684, L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:03,722 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 169336#[L684, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, threadEXIT]true [2025-04-26 16:48:03,752 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 172630#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, threadEXIT]true [2025-04-26 16:48:03,752 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 172518#[L684, L686, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:03,752 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 172472#[L684, L686, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:03,752 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 172418#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, threadEXIT]true [2025-04-26 16:48:03,797 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 177218#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT, threadEXIT]true [2025-04-26 16:48:03,797 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 177174#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT]true [2025-04-26 16:48:03,797 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 177144#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT]true [2025-04-26 16:48:03,797 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 177106#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684, threadEXIT]true [2025-04-26 16:48:03,823 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179802#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684, threadEXIT]true [2025-04-26 16:48:03,823 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179750#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, threadEXIT]true [2025-04-26 16:48:03,823 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179712#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, threadEXIT]true [2025-04-26 16:48:03,823 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179666#[L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L684, threadEXIT]true [2025-04-26 16:48:03,873 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 185346#[L684, L686, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:03,873 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 185234#[L684, L686, L686, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:48:03,873 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 185188#[L684, L686, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:48:03,873 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 185134#[L684, L686, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 16:48:03,910 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 189750#[L684, L686, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:03,911 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 189556#[L684, L686, L686, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:48:03,911 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 189474#[L684, L686, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:48:03,911 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 189382#[L684, L686, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 16:48:03,965 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 196310#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT]true [2025-04-26 16:48:03,966 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 196230#[L684, L686, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:48:03,966 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 196168#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L685-1]true [2025-04-26 16:48:03,966 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 196096#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684]true [2025-04-26 16:48:04,012 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199800#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 16:48:04,012 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199710#[L684, L686, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 16:48:04,012 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199638#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1]true [2025-04-26 16:48:04,013 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 199556#[L684, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L684]true [2025-04-26 16:48:04,177 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 206982#[L684, L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:04,177 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 206938#[L684, L685-1, L686, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:48:04,177 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 206908#[L684, L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:48:04,177 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 206870#[L684, L685-1, threadEXIT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 16:48:04,205 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 209830#[L684, L686, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:04,205 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 209750#[L684, L686, L685-1, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:48:04,205 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 209688#[L684, L686, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:48:04,205 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 209616#[L684, L686, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 16:48:04,236 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 213044#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, threadEXIT]true [2025-04-26 16:48:04,237 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 212984#[L684, L685-1, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:48:04,237 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 212942#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L685-1]true [2025-04-26 16:48:04,237 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 212890#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1, L684]true [2025-04-26 16:48:04,274 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 216826#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 16:48:04,274 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 216756#[L684, L685-1, L686, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 16:48:04,274 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 216704#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1]true [2025-04-26 16:48:04,274 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 216642#[L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L684]true [2025-04-26 16:48:04,320 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 221714#[L684, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:04,321 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 221662#[L684, L686, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:48:04,321 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 221624#[L684, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:48:04,321 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 221578#[L684, threadEXIT, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 16:48:04,346 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 224458#[L684, L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:04,347 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 224368#[L684, L686, L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:48:04,347 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 224296#[L684, L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:48:04,347 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 224214#[L684, L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 16:48:04,390 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 229082#[L684, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT]true [2025-04-26 16:48:04,390 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 229012#[L684, L686, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES]true [2025-04-26 16:48:04,390 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 228960#[L684, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L685-1]true [2025-04-26 16:48:04,390 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 228898#[L684, L684, L685-1, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 16:48:04,418 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 232072#[L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, threadEXIT, L684]true [2025-04-26 16:48:04,418 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 231992#[L684, L686, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684]true [2025-04-26 16:48:04,419 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 231930#[L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L685-1]true [2025-04-26 16:48:04,419 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 231858#[L684, L684, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, L684, L684]true [2025-04-26 16:48:04,453 WARN L140 AmpleReduction]: Number of pruned transitions: 123629 [2025-04-26 16:48:04,453 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 186 [2025-04-26 16:48:04,453 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 186 [2025-04-26 16:48:04,453 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:4930 [2025-04-26 16:48:04,453 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:42109 [2025-04-26 16:48:04,453 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 16:48:04,453 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 16:48:04,453 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:48:04,525 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 47040 states, 47023 states have (on average 1.3194606894498437) internal successors, (in total 62045), 47039 states have internal predecessors, (62045), 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 16:48:04,525 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:48:04,525 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:48:04,525 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:48:04,525 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:48:04,525 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:48:04,526 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:48:04,526 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:48:04,526 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:48:04,572 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47040 states, 47023 states have (on average 1.3194606894498437) internal successors, (in total 62045), 47039 states have internal predecessors, (62045), 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 16:48:04,897 INFO L131 ngComponentsAnalysis]: Automaton has 187 accepting balls. 187 [2025-04-26 16:48:04,897 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:48:04,897 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:48:04,898 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 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 16:48:04,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:48:04,898 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:48:04,944 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47040 states, 47023 states have (on average 1.3194606894498437) internal successors, (in total 62045), 47039 states have internal predecessors, (62045), 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 16:48:05,280 INFO L131 ngComponentsAnalysis]: Automaton has 187 accepting balls. 187 [2025-04-26 16:48:05,280 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:48:05,280 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:48:05,281 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 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 16:48:05,281 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 16:48:05,282 INFO L752 eck$LassoCheckResult]: Stem: "[628] $Ultimate##0-->L-1: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[]" "[639] L-1-->L681: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[]" "[659] L681-->L682: Formula: (= v_~data~0_1 0) InVars {} OutVars{~data~0=v_~data~0_1} AuxVars[] AssignedVars[~data~0]" "[610] L682-->L682-1: Formula: (and (= (select |v_#length_1| 1) 24) (= (select |v_#valid_2| 1) 1)) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[]" "[623] L682-1-->L682-2: Formula: (and (= |v_~#data_mutex~0.base_1| 1) (= |v_~#data_mutex~0.offset_1| 0)) InVars {} OutVars{~#data_mutex~0.base=|v_~#data_mutex~0.base_1|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_1|} AuxVars[] AssignedVars[~#data_mutex~0.offset, ~#data_mutex~0.base]" "[613] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_1| |v_~#data_mutex~0.base_2|) |v_~#data_mutex~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} OutVars{#memory_int=|v_#memory_int_1|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_2|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_2|} AuxVars[] AssignedVars[]" "[654] L682-3-->L682-4: Formula: (= 0 (select (select |v_#memory_int_2| |v_~#data_mutex~0.base_3|) (+ 4 |v_~#data_mutex~0.offset_3|))) InVars {#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} OutVars{#memory_int=|v_#memory_int_2|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_3|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_3|} AuxVars[] AssignedVars[]" "[631] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_3| |v_~#data_mutex~0.base_4|) (+ 8 |v_~#data_mutex~0.offset_4|)) 0) InVars {#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} OutVars{#memory_int=|v_#memory_int_3|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_4|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_4|} AuxVars[] AssignedVars[]" "[660] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_4| |v_~#data_mutex~0.base_5|) (+ 12 |v_~#data_mutex~0.offset_5|)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} OutVars{#memory_int=|v_#memory_int_4|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_5|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_5|} AuxVars[] AssignedVars[]" "[620] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_5| |v_~#data_mutex~0.base_6|) (+ 16 |v_~#data_mutex~0.offset_6|)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} OutVars{#memory_int=|v_#memory_int_5|, ~#data_mutex~0.base=|v_~#data_mutex~0.base_6|, ~#data_mutex~0.offset=|v_~#data_mutex~0.offset_6|} AuxVars[] AssignedVars[]" "[651] L682-7-->L-1-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1]" "[653] L-1-1-->L690: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_1|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_1|, ULTIMATE.start_main_#t~mem6#1=|v_ULTIMATE.start_main_#t~mem6#1_1|, ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_1|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_1|, ULTIMATE.start_main_#t~post7#1=|v_ULTIMATE.start_main_#t~post7#1_1|, ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_~i~1#1, ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_#t~mem6#1, ULTIMATE.start_main_#t~post5#1, ULTIMATE.start_main_~#tids~0#1.base, ULTIMATE.start_main_#t~post7#1, ULTIMATE.start_main_~threads_total~0#1, ULTIMATE.start_main_#t~pre3#1]" "[650] L690-->L691: Formula: (= |v_ULTIMATE.start_main_~threads_total~0#1_2| 4) InVars {} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~threads_total~0#1]" "[633] L691-->L691-1: Formula: (and (= (store |v_#length_3| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 16) |v_#length_2|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2| 1) |v_#valid_3|) (not (= |v_ULTIMATE.start_main_~#tids~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) (= |v_ULTIMATE.start_main_~#tids~0#1.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#tids~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_2|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#tids~0#1.offset, ULTIMATE.start_main_~#tids~0#1.base, #valid, #length]" "[661] L691-1-->L692-4: Formula: (= |v_ULTIMATE.start_main_~i~0#1_2| 0) InVars {} OutVars{ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[616] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[648] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[611] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[652] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[705] L693-3-->$Ultimate##0: Formula: (and (= v_threadThread1of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_37|) (= |v_threadThread1of4ForFork0_#in~arg.offset_4| 0) (= |v_threadThread1of4ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_37|} OutVars{threadThread1of4ForFork0_#res.base=|v_threadThread1of4ForFork0_#res.base_4|, threadThread1of4ForFork0_~arg.offset=v_threadThread1of4ForFork0_~arg.offset_4, threadThread1of4ForFork0_#res.offset=|v_threadThread1of4ForFork0_#res.offset_4|, threadThread1of4ForFork0_#t~ret0=|v_threadThread1of4ForFork0_#t~ret0_6|, threadThread1of4ForFork0_~arg.base=v_threadThread1of4ForFork0_~arg.base_4, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_2, threadThread1of4ForFork0_#in~arg.offset=|v_threadThread1of4ForFork0_#in~arg.offset_4|, threadThread1of4ForFork0_#in~arg.base=|v_threadThread1of4ForFork0_#in~arg.base_4|, threadThread1of4ForFork0_#t~ret2=|v_threadThread1of4ForFork0_#t~ret2_6|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_37|, threadThread1of4ForFork0_#t~nondet1=|v_threadThread1of4ForFork0_#t~nondet1_8|} AuxVars[] AssignedVars[threadThread1of4ForFork0_#res.base, threadThread1of4ForFork0_~arg.offset, threadThread1of4ForFork0_#res.offset, threadThread1of4ForFork0_#t~ret0, threadThread1of4ForFork0_~arg.base, threadThread1of4ForFork0_thidvar0, threadThread1of4ForFork0_#in~arg.offset, threadThread1of4ForFork0_#in~arg.base, threadThread1of4ForFork0_#t~ret2, threadThread1of4ForFork0_#t~nondet1]" "[673] $Ultimate##0-->L684: Formula: (and (= |v_threadThread1of4ForFork0_#in~arg.offset_1| v_threadThread1of4ForFork0_~arg.offset_1) (= v_threadThread1of4ForFork0_~arg.base_1 |v_threadThread1of4ForFork0_#in~arg.base_1|)) InVars {threadThread1of4ForFork0_#in~arg.base=|v_threadThread1of4ForFork0_#in~arg.base_1|, threadThread1of4ForFork0_#in~arg.offset=|v_threadThread1of4ForFork0_#in~arg.offset_1|} OutVars{threadThread1of4ForFork0_#in~arg.offset=|v_threadThread1of4ForFork0_#in~arg.offset_1|, threadThread1of4ForFork0_~arg.base=v_threadThread1of4ForFork0_~arg.base_1, threadThread1of4ForFork0_#in~arg.base=|v_threadThread1of4ForFork0_#in~arg.base_1|, threadThread1of4ForFork0_~arg.offset=v_threadThread1of4ForFork0_~arg.offset_1} AuxVars[] AssignedVars[threadThread1of4ForFork0_~arg.offset, threadThread1of4ForFork0_~arg.base]" "[626] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[657] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[642] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[622] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[634] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[616] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[648] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[611] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[652] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[706] L693-3-->$Ultimate##0: Formula: (and (= |v_threadThread2of4ForFork0_#in~arg.offset_4| 0) (= v_threadThread2of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_39|) (= 0 |v_threadThread2of4ForFork0_#in~arg.base_4|)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_39|} OutVars{threadThread2of4ForFork0_#in~arg.offset=|v_threadThread2of4ForFork0_#in~arg.offset_4|, threadThread2of4ForFork0_~arg.offset=v_threadThread2of4ForFork0_~arg.offset_4, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_2, threadThread2of4ForFork0_#res.base=|v_threadThread2of4ForFork0_#res.base_4|, threadThread2of4ForFork0_#t~nondet1=|v_threadThread2of4ForFork0_#t~nondet1_8|, threadThread2of4ForFork0_#t~ret2=|v_threadThread2of4ForFork0_#t~ret2_6|, threadThread2of4ForFork0_#in~arg.base=|v_threadThread2of4ForFork0_#in~arg.base_4|, threadThread2of4ForFork0_~arg.base=v_threadThread2of4ForFork0_~arg.base_4, threadThread2of4ForFork0_#t~ret0=|v_threadThread2of4ForFork0_#t~ret0_6|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_39|, threadThread2of4ForFork0_#res.offset=|v_threadThread2of4ForFork0_#res.offset_4|} AuxVars[] AssignedVars[threadThread2of4ForFork0_#in~arg.offset, threadThread2of4ForFork0_~arg.offset, threadThread2of4ForFork0_thidvar0, threadThread2of4ForFork0_#res.base, threadThread2of4ForFork0_#t~nondet1, threadThread2of4ForFork0_#t~ret2, threadThread2of4ForFork0_#in~arg.base, threadThread2of4ForFork0_~arg.base, threadThread2of4ForFork0_#t~ret0, threadThread2of4ForFork0_#res.offset]" "[683] $Ultimate##0-->L684: Formula: (and (= v_threadThread2of4ForFork0_~arg.offset_1 |v_threadThread2of4ForFork0_#in~arg.offset_1|) (= v_threadThread2of4ForFork0_~arg.base_1 |v_threadThread2of4ForFork0_#in~arg.base_1|)) InVars {threadThread2of4ForFork0_#in~arg.base=|v_threadThread2of4ForFork0_#in~arg.base_1|, threadThread2of4ForFork0_#in~arg.offset=|v_threadThread2of4ForFork0_#in~arg.offset_1|} OutVars{threadThread2of4ForFork0_#in~arg.base=|v_threadThread2of4ForFork0_#in~arg.base_1|, threadThread2of4ForFork0_~arg.base=v_threadThread2of4ForFork0_~arg.base_1, threadThread2of4ForFork0_#in~arg.offset=|v_threadThread2of4ForFork0_#in~arg.offset_1|, threadThread2of4ForFork0_~arg.offset=v_threadThread2of4ForFork0_~arg.offset_1} AuxVars[] AssignedVars[threadThread2of4ForFork0_~arg.offset, threadThread2of4ForFork0_~arg.base]" "[626] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[657] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[642] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[622] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[634] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[616] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[648] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[611] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[652] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[707] L693-3-->$Ultimate##0: Formula: (and (= v_threadThread3of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_41|) (= |v_threadThread3of4ForFork0_#in~arg.base_4| 0) (= |v_threadThread3of4ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_41|} OutVars{threadThread3of4ForFork0_#in~arg.offset=|v_threadThread3of4ForFork0_#in~arg.offset_4|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_2, threadThread3of4ForFork0_~arg.offset=v_threadThread3of4ForFork0_~arg.offset_4, threadThread3of4ForFork0_#res.base=|v_threadThread3of4ForFork0_#res.base_4|, threadThread3of4ForFork0_~arg.base=v_threadThread3of4ForFork0_~arg.base_4, threadThread3of4ForFork0_#in~arg.base=|v_threadThread3of4ForFork0_#in~arg.base_4|, threadThread3of4ForFork0_#t~ret2=|v_threadThread3of4ForFork0_#t~ret2_6|, threadThread3of4ForFork0_#t~nondet1=|v_threadThread3of4ForFork0_#t~nondet1_8|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_41|, threadThread3of4ForFork0_#res.offset=|v_threadThread3of4ForFork0_#res.offset_4|, threadThread3of4ForFork0_#t~ret0=|v_threadThread3of4ForFork0_#t~ret0_6|} AuxVars[] AssignedVars[threadThread3of4ForFork0_#in~arg.offset, threadThread3of4ForFork0_thidvar0, threadThread3of4ForFork0_~arg.offset, threadThread3of4ForFork0_#res.base, threadThread3of4ForFork0_~arg.base, threadThread3of4ForFork0_#in~arg.base, threadThread3of4ForFork0_#t~ret2, threadThread3of4ForFork0_#t~nondet1, threadThread3of4ForFork0_#res.offset, threadThread3of4ForFork0_#t~ret0]" "[663] $Ultimate##0-->L684: Formula: (and (= |v_threadThread3of4ForFork0_#in~arg.base_1| v_threadThread3of4ForFork0_~arg.base_1) (= v_threadThread3of4ForFork0_~arg.offset_1 |v_threadThread3of4ForFork0_#in~arg.offset_1|)) InVars {threadThread3of4ForFork0_#in~arg.offset=|v_threadThread3of4ForFork0_#in~arg.offset_1|, threadThread3of4ForFork0_#in~arg.base=|v_threadThread3of4ForFork0_#in~arg.base_1|} OutVars{threadThread3of4ForFork0_#in~arg.offset=|v_threadThread3of4ForFork0_#in~arg.offset_1|, threadThread3of4ForFork0_#in~arg.base=|v_threadThread3of4ForFork0_#in~arg.base_1|, threadThread3of4ForFork0_~arg.offset=v_threadThread3of4ForFork0_~arg.offset_1, threadThread3of4ForFork0_~arg.base=v_threadThread3of4ForFork0_~arg.base_1} AuxVars[] AssignedVars[threadThread3of4ForFork0_~arg.offset, threadThread3of4ForFork0_~arg.base]" "[626] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[657] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[642] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[622] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[634] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[616] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[648] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[611] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[652] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[708] L693-3-->$Ultimate##0: Formula: (and (= |v_threadThread4of4ForFork0_#in~arg.offset_4| 0) (= v_threadThread4of4ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre3#1_43|) (= |v_threadThread4of4ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_43|} OutVars{threadThread4of4ForFork0_#res.offset=|v_threadThread4of4ForFork0_#res.offset_4|, threadThread4of4ForFork0_#t~ret0=|v_threadThread4of4ForFork0_#t~ret0_6|, threadThread4of4ForFork0_~arg.base=v_threadThread4of4ForFork0_~arg.base_4, threadThread4of4ForFork0_#res.base=|v_threadThread4of4ForFork0_#res.base_4|, threadThread4of4ForFork0_#t~ret2=|v_threadThread4of4ForFork0_#t~ret2_6|, threadThread4of4ForFork0_#in~arg.base=|v_threadThread4of4ForFork0_#in~arg.base_4|, threadThread4of4ForFork0_~arg.offset=v_threadThread4of4ForFork0_~arg.offset_4, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_2, threadThread4of4ForFork0_#t~nondet1=|v_threadThread4of4ForFork0_#t~nondet1_8|, threadThread4of4ForFork0_#in~arg.offset=|v_threadThread4of4ForFork0_#in~arg.offset_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_43|} AuxVars[] AssignedVars[threadThread4of4ForFork0_#res.offset, threadThread4of4ForFork0_#t~ret0, threadThread4of4ForFork0_~arg.base, threadThread4of4ForFork0_#res.base, threadThread4of4ForFork0_#t~ret2, threadThread4of4ForFork0_#in~arg.base, threadThread4of4ForFork0_~arg.offset, threadThread4of4ForFork0_thidvar0, threadThread4of4ForFork0_#t~nondet1, threadThread4of4ForFork0_#in~arg.offset]" "[693] $Ultimate##0-->L684: Formula: (and (= v_threadThread4of4ForFork0_~arg.base_1 |v_threadThread4of4ForFork0_#in~arg.base_1|) (= |v_threadThread4of4ForFork0_#in~arg.offset_1| v_threadThread4of4ForFork0_~arg.offset_1)) InVars {threadThread4of4ForFork0_#in~arg.offset=|v_threadThread4of4ForFork0_#in~arg.offset_1|, threadThread4of4ForFork0_#in~arg.base=|v_threadThread4of4ForFork0_#in~arg.base_1|} OutVars{threadThread4of4ForFork0_~arg.base=v_threadThread4of4ForFork0_~arg.base_1, threadThread4of4ForFork0_#in~arg.base=|v_threadThread4of4ForFork0_#in~arg.base_1|, threadThread4of4ForFork0_#in~arg.offset=|v_threadThread4of4ForFork0_#in~arg.offset_1|, threadThread4of4ForFork0_~arg.offset=v_threadThread4of4ForFork0_~arg.offset_1} AuxVars[] AssignedVars[threadThread4of4ForFork0_~arg.base, threadThread4of4ForFork0_~arg.offset]" "[626] L693-4-->L693-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[657] L693-5-->L692-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1]" "[642] L692-1-->L692-2: Formula: (= |v_ULTIMATE.start_main_#t~post5#1_2| |v_ULTIMATE.start_main_~i~0#1_5|) InVars {ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_2|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[622] L692-2-->L692-3: Formula: (= |v_ULTIMATE.start_main_~i~0#1_6| (+ |v_ULTIMATE.start_main_#t~post5#1_3| 1)) InVars {ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0#1]" "[634] L692-3-->L692-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~post5#1=|v_ULTIMATE.start_main_#t~post5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post5#1]" "[616] L692-4-->L693: Formula: (< |v_ULTIMATE.start_main_~i~0#1_3| |v_ULTIMATE.start_main_~threads_total~0#1_3|) InVars {ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} OutVars{ULTIMATE.start_main_~threads_total~0#1=|v_ULTIMATE.start_main_~threads_total~0#1_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_3|} AuxVars[] AssignedVars[]" "[648] L693-->L693-1: Formula: (= |v_ULTIMATE.start_main_#t~pre3#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre3#1]" "[611] L693-1-->L693-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks]" "[652] L693-2-->L693-3: Formula: (let ((.cse1 (* |v_ULTIMATE.start_main_~i~0#1_4| 4))) (let ((.cse0 (+ .cse1 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|))) (and (<= 0 .cse0) (<= (+ .cse1 4 |v_ULTIMATE.start_main_~#tids~0#1.offset_3|) (select |v_#length_4| |v_ULTIMATE.start_main_~#tids~0#1.base_3|)) (= (store |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3| (store (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) .cse0 |v_ULTIMATE.start_main_#t~pre3#1_3|)) |v_#memory_int_6|) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#tids~0#1.base_3|) 1)))) InVars {ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_7|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} OutVars{ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_3|, ULTIMATE.start_main_~i~0#1=|v_ULTIMATE.start_main_~i~0#1_4|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_3|, #valid=|v_#valid_5|, #memory_int=|v_#memory_int_6|, #length=|v_#length_4|, ULTIMATE.start_main_#t~pre3#1=|v_ULTIMATE.start_main_#t~pre3#1_3|} AuxVars[] AssignedVars[#memory_int]" "[703] L693-3-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:48:05,282 INFO L754 eck$LassoCheckResult]: Loop: "[704] ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES-->ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" [2025-04-26 16:48:05,282 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:48:05,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1818448778, now seen corresponding path program 1 times [2025-04-26 16:48:05,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:48:05,282 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808952594] [2025-04-26 16:48:05,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:48:05,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:48:05,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-26 16:48:05,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-26 16:48:05,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:48:05,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:48:05,552 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 16:48:05,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:48:05,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808952594] [2025-04-26 16:48:05,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808952594] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:48:05,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:48:05,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-26 16:48:05,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631033081] [2025-04-26 16:48:05,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:48:05,555 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:48:05,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:48:05,555 INFO L85 PathProgramCache]: Analyzing trace with hash 735, now seen corresponding path program 1 times [2025-04-26 16:48:05,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:48:05,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001668630] [2025-04-26 16:48:05,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:48:05,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:48:05,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:48:05,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:48:05,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:48:05,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:48:05,558 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:48:05,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 16:48:05,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 16:48:05,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:48:05,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:48:05,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:48:05,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:48:05,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-26 16:48:05,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-04-26 16:48:05,622 INFO L87 Difference]: Start difference. First operand has 47040 states, 47023 states have (on average 1.3194606894498437) internal successors, (in total 62045), 47039 states have internal predecessors, (62045), 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 12 states, 12 states have (on average 5.333333333333333) internal successors, (in total 64), 12 states have internal predecessors, (64), 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 16:48:06,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:48:06,265 INFO L93 Difference]: Finished difference Result 40397 states and 52895 transitions. [2025-04-26 16:48:06,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40397 states and 52895 transitions. [2025-04-26 16:48:06,455 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:48:06,458 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40397 states to 0 states and 0 transitions. [2025-04-26 16:48:06,458 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:48:06,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:48:06,458 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:48:06,459 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:48:06,459 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:48:06,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:48:06,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-26 16:48:06,463 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:48:06,463 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:48:06,463 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:48:06,463 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:48:06,463 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:48:06,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:48:06,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:48:06 BoogieIcfgContainer [2025-04-26 16:48:06,470 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:48:06,471 INFO L158 Benchmark]: Toolchain (without parser) took 10427.38ms. Allocated memory was 155.2MB in the beginning and 931.1MB in the end (delta: 775.9MB). Free memory was 108.3MB in the beginning and 315.4MB in the end (delta: -207.0MB). Peak memory consumption was 568.2MB. Max. memory is 8.0GB. [2025-04-26 16:48:06,471 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 155.2MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:48:06,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.09ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 87.4MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-26 16:48:06,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.51ms. Allocated memory is still 155.2MB. Free memory was 87.4MB in the beginning and 85.2MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:48:06,471 INFO L158 Benchmark]: Boogie Preprocessor took 22.63ms. Allocated memory is still 155.2MB. Free memory was 85.2MB in the beginning and 83.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:48:06,471 INFO L158 Benchmark]: RCFGBuilder took 242.69ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 71.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:48:06,472 INFO L158 Benchmark]: BuchiAutomizer took 9755.86ms. Allocated memory was 155.2MB in the beginning and 931.1MB in the end (delta: 775.9MB). Free memory was 71.3MB in the beginning and 315.4MB in the end (delta: -244.1MB). Peak memory consumption was 530.4MB. Max. memory is 8.0GB. [2025-04-26 16:48:06,473 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.14ms. Allocated memory is still 155.2MB. Free memory is still 84.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 379.09ms. Allocated memory is still 155.2MB. Free memory was 108.3MB in the beginning and 87.4MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.51ms. Allocated memory is still 155.2MB. Free memory was 87.4MB in the beginning and 85.2MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.63ms. Allocated memory is still 155.2MB. Free memory was 85.2MB in the beginning and 83.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 242.69ms. Allocated memory is still 155.2MB. Free memory was 83.9MB in the beginning and 71.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 9755.86ms. Allocated memory was 155.2MB in the beginning and 931.1MB in the end (delta: 775.9MB). Free memory was 71.3MB in the beginning and 315.4MB in the end (delta: -244.1MB). Peak memory consumption was 530.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.2s and 1 iterations. TraceHistogramMax:2. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 239, Number of transitions in reduction automaton: 188, Number of states in reduction automaton: 171, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.0s and 1 iterations. TraceHistogramMax:3. Analysis of lassos took 0.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 311, Number of transitions in reduction automaton: 1437, Number of states in reduction automaton: 1167, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.9s and 1 iterations. TraceHistogramMax:4. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.9s InitialAbstraction: Time to compute Ample Reduction [ms]: 979, Number of transitions in reduction automaton: 9834, Number of states in reduction automaton: 7640, Underlying: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 2 iterations. TraceHistogramMax:5. Analysis of lassos took 0.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.1s 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, 505 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 505 mSDsluCounter, 1207 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 965 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 461 IncrementalHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 242 mSDtfsCounter, 461 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN1 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 3.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 3400, Number of transitions in reduction automaton: 62045, Number of states in reduction automaton: 47040, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic). 1 modules have a trivial ranking function, the largest among these consists of 12 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:48:06,483 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...