./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:07:52,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:07:52,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:07:52,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:07:52,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:07:52,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:07:52,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:07:52,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:07:52,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:07:52,265 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:07:52,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:07:52,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:07:52,266 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:07:52,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:07:52,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:07:52,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:07:52,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:07:52,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:07:52,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:07:52,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:07:52,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:07:52,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:07:52,271 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:07:52,271 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:07:52,271 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:07:52,271 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:07:52,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:07:52,272 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:07:52,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:07:52,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:07:52,273 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:07:52,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:07:52,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:07:52,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:07:52,274 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:07:52,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:07:52,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:07:52,275 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:07:52,275 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:07:52,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:07:52,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:07:52,276 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45d1947e02656e790dafd6ca03f6eadb14d0b370e2217b75740af9998d975bef [2024-10-14 17:07:52,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:07:52,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:07:52,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:07:52,529 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:07:52,530 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:07:52,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2024-10-14 17:07:53,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:07:54,229 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:07:54,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_07-cond_racing2.i [2024-10-14 17:07:54,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31cf7a335/5038c59d511b4e4b9d00784e5ddda32a/FLAGe50682d51 [2024-10-14 17:07:54,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31cf7a335/5038c59d511b4e4b9d00784e5ddda32a [2024-10-14 17:07:54,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:07:54,270 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:07:54,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:07:54,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:07:54,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:07:54,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:07:54" (1/1) ... [2024-10-14 17:07:54,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73b498a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:54, skipping insertion in model container [2024-10-14 17:07:54,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:07:54" (1/1) ... [2024-10-14 17:07:54,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:07:54,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:07:54,836 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:07:54,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:07:54,980 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:07:54,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:54 WrapperNode [2024-10-14 17:07:54,981 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:07:54,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:07:54,982 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:07:54,983 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:07:54,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:54" (1/1) ... [2024-10-14 17:07:55,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:54" (1/1) ... [2024-10-14 17:07:55,045 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 110 [2024-10-14 17:07:55,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:07:55,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:07:55,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:07:55,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:07:55,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:54" (1/1) ... [2024-10-14 17:07:55,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:54" (1/1) ... [2024-10-14 17:07:55,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:54" (1/1) ... [2024-10-14 17:07:55,067 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:54" (1/1) ... [2024-10-14 17:07:55,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:54" (1/1) ... [2024-10-14 17:07:55,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:54" (1/1) ... [2024-10-14 17:07:55,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:54" (1/1) ... [2024-10-14 17:07:55,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:54" (1/1) ... [2024-10-14 17:07:55,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:07:55,100 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:07:55,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:07:55,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:07:55,104 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:54" (1/1) ... [2024-10-14 17:07:55,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:07:55,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:07:55,144 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:07:55,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:07:55,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:07:55,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:07:55,198 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-14 17:07:55,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 17:07:55,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 17:07:55,199 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-14 17:07:55,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:07:55,199 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-14 17:07:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-14 17:07:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:07:55,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:07:55,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:07:55,202 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:07:55,342 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:07:55,344 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:07:55,614 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:07:55,614 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:07:55,659 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:07:55,659 INFO L314 CfgBuilder]: Removed 10 assume(true) statements. [2024-10-14 17:07:55,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:07:55 BoogieIcfgContainer [2024-10-14 17:07:55,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:07:55,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:07:55,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:07:55,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:07:55,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:07:54" (1/3) ... [2024-10-14 17:07:55,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f096aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:07:55, skipping insertion in model container [2024-10-14 17:07:55,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:07:54" (2/3) ... [2024-10-14 17:07:55,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f096aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:07:55, skipping insertion in model container [2024-10-14 17:07:55,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:07:55" (3/3) ... [2024-10-14 17:07:55,675 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_07-cond_racing2.i [2024-10-14 17:07:55,692 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:07:55,692 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-14 17:07:55,692 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:07:55,776 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-14 17:07:55,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 164 transitions, 335 flow [2024-10-14 17:07:55,909 INFO L124 PetriNetUnfolderBase]: 25/233 cut-off events. [2024-10-14 17:07:55,909 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 17:07:55,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 233 events. 25/233 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 688 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 119. Up to 6 conditions per place. [2024-10-14 17:07:55,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 164 transitions, 335 flow [2024-10-14 17:07:55,928 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 164 transitions, 335 flow [2024-10-14 17:07:55,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:07:55,949 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53e3f238, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:07:55,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-14 17:07:55,964 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:07:55,964 INFO L124 PetriNetUnfolderBase]: 3/63 cut-off events. [2024-10-14 17:07:55,964 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:07:55,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:07:55,965 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:07:55,966 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-14 17:07:55,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:07:55,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1619116525, now seen corresponding path program 1 times [2024-10-14 17:07:55,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:07:55,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717910220] [2024-10-14 17:07:55,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:07:55,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:07:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:07:56,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:07:56,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:07:56,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717910220] [2024-10-14 17:07:56,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717910220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:07:56,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:07:56,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:07:56,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506906928] [2024-10-14 17:07:56,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:07:56,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:07:56,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:07:56,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:07:56,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:07:57,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 164 [2024-10-14 17:07:57,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 164 transitions, 335 flow. Second operand has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:07:57,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:07:57,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 164 [2024-10-14 17:07:57,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:07:57,392 INFO L124 PetriNetUnfolderBase]: 135/851 cut-off events. [2024-10-14 17:07:57,392 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 17:07:57,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 851 events. 135/851 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5211 event pairs, 60 based on Foata normal form. 106/852 useless extension candidates. Maximal degree in co-relation 993. Up to 198 conditions per place. [2024-10-14 17:07:57,404 INFO L140 encePairwiseOnDemand]: 146/164 looper letters, 48 selfloop transitions, 5 changer transitions 0/173 dead transitions. [2024-10-14 17:07:57,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 173 transitions, 459 flow [2024-10-14 17:07:57,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:07:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:07:57,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 816 transitions. [2024-10-14 17:07:57,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8292682926829268 [2024-10-14 17:07:57,430 INFO L175 Difference]: Start difference. First operand has 151 places, 164 transitions, 335 flow. Second operand 6 states and 816 transitions. [2024-10-14 17:07:57,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 173 transitions, 459 flow [2024-10-14 17:07:57,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 173 transitions, 459 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:07:57,440 INFO L231 Difference]: Finished difference. Result has 153 places, 149 transitions, 315 flow [2024-10-14 17:07:57,442 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=153, PETRI_TRANSITIONS=149} [2024-10-14 17:07:57,445 INFO L277 CegarLoopForPetriNet]: 151 programPoint places, 2 predicate places. [2024-10-14 17:07:57,446 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 149 transitions, 315 flow [2024-10-14 17:07:57,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:07:57,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:07:57,447 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:07:57,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:07:57,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-14 17:07:57,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:07:57,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1129970920, now seen corresponding path program 1 times [2024-10-14 17:07:57,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:07:57,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080601017] [2024-10-14 17:07:57,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:07:57,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:07:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:07:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:07:57,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:07:57,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080601017] [2024-10-14 17:07:57,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080601017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:07:57,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:07:57,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:07:57,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916651226] [2024-10-14 17:07:57,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:07:57,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:07:57,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:07:57,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:07:57,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:07:57,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 164 [2024-10-14 17:07:57,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 149 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:07:57,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:07:57,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 164 [2024-10-14 17:07:57,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:07:57,665 INFO L124 PetriNetUnfolderBase]: 57/589 cut-off events. [2024-10-14 17:07:57,665 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-14 17:07:57,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 589 events. 57/589 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2947 event pairs, 0 based on Foata normal form. 1/531 useless extension candidates. Maximal degree in co-relation 645. Up to 96 conditions per place. [2024-10-14 17:07:57,669 INFO L140 encePairwiseOnDemand]: 161/164 looper letters, 22 selfloop transitions, 2 changer transitions 0/155 dead transitions. [2024-10-14 17:07:57,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 155 transitions, 375 flow [2024-10-14 17:07:57,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:07:57,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:07:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2024-10-14 17:07:57,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8617886178861789 [2024-10-14 17:07:57,672 INFO L175 Difference]: Start difference. First operand has 153 places, 149 transitions, 315 flow. Second operand 3 states and 424 transitions. [2024-10-14 17:07:57,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 155 transitions, 375 flow [2024-10-14 17:07:57,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 155 transitions, 365 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:07:57,679 INFO L231 Difference]: Finished difference. Result has 151 places, 149 transitions, 313 flow [2024-10-14 17:07:57,679 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=151, PETRI_TRANSITIONS=149} [2024-10-14 17:07:57,680 INFO L277 CegarLoopForPetriNet]: 151 programPoint places, 0 predicate places. [2024-10-14 17:07:57,680 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 149 transitions, 313 flow [2024-10-14 17:07:57,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:07:57,681 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:07:57,681 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:07:57,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:07:57,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-14 17:07:57,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:07:57,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1539110074, now seen corresponding path program 1 times [2024-10-14 17:07:57,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:07:57,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831826989] [2024-10-14 17:07:57,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:07:57,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:07:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:07:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:07:57,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:07:57,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831826989] [2024-10-14 17:07:57,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831826989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:07:57,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:07:57,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:07:57,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89220598] [2024-10-14 17:07:57,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:07:57,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:07:57,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:07:57,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:07:57,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:07:57,761 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 164 [2024-10-14 17:07:57,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 149 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:07:57,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:07:57,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 164 [2024-10-14 17:07:57,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:07:57,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([485] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of1ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][155], [Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), 164#true, 160#true, 151#true, 97#L952-9true]) [2024-10-14 17:07:57,911 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is not cut-off event [2024-10-14 17:07:57,912 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-14 17:07:57,912 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-10-14 17:07:57,912 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-14 17:07:57,922 INFO L124 PetriNetUnfolderBase]: 134/904 cut-off events. [2024-10-14 17:07:57,923 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-10-14 17:07:57,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1168 conditions, 904 events. 134/904 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5514 event pairs, 32 based on Foata normal form. 0/805 useless extension candidates. Maximal degree in co-relation 1105. Up to 130 conditions per place. [2024-10-14 17:07:57,927 INFO L140 encePairwiseOnDemand]: 155/164 looper letters, 30 selfloop transitions, 6 changer transitions 0/162 dead transitions. [2024-10-14 17:07:57,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 162 transitions, 414 flow [2024-10-14 17:07:57,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:07:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:07:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2024-10-14 17:07:57,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8597560975609756 [2024-10-14 17:07:57,929 INFO L175 Difference]: Start difference. First operand has 151 places, 149 transitions, 313 flow. Second operand 3 states and 423 transitions. [2024-10-14 17:07:57,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 162 transitions, 414 flow [2024-10-14 17:07:57,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 162 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:07:57,933 INFO L231 Difference]: Finished difference. Result has 151 places, 151 transitions, 347 flow [2024-10-14 17:07:57,934 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=151, PETRI_TRANSITIONS=151} [2024-10-14 17:07:57,934 INFO L277 CegarLoopForPetriNet]: 151 programPoint places, 0 predicate places. [2024-10-14 17:07:57,934 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 151 transitions, 347 flow [2024-10-14 17:07:57,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:07:57,935 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:07:57,935 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:07:57,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:07:57,936 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-14 17:07:57,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:07:57,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1366458292, now seen corresponding path program 1 times [2024-10-14 17:07:57,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:07:57,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114980809] [2024-10-14 17:07:57,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:07:57,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:07:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:07:57,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:07:57,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:07:57,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114980809] [2024-10-14 17:07:57,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114980809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:07:57,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:07:57,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:07:57,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692829245] [2024-10-14 17:07:57,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:07:57,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:07:57,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:07:57,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:07:57,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:07:58,013 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 164 [2024-10-14 17:07:58,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 151 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:07:58,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:07:58,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 164 [2024-10-14 17:07:58,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:07:58,133 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([485] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread1of1ForFork0_thidvar0_4) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_5|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[][154], [Black: 162#(= |ULTIMATE.start_main_~i~1#1| 0), 164#true, Black: 166#(= |#race~global~0| 0), 169#true, 151#true, 97#L952-9true]) [2024-10-14 17:07:58,134 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is not cut-off event [2024-10-14 17:07:58,134 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-14 17:07:58,134 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-14 17:07:58,134 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-10-14 17:07:58,142 INFO L124 PetriNetUnfolderBase]: 139/986 cut-off events. [2024-10-14 17:07:58,143 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-10-14 17:07:58,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 986 events. 139/986 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6414 event pairs, 50 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 1284. Up to 220 conditions per place. [2024-10-14 17:07:58,149 INFO L140 encePairwiseOnDemand]: 159/164 looper letters, 27 selfloop transitions, 4 changer transitions 0/158 dead transitions. [2024-10-14 17:07:58,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 158 transitions, 427 flow [2024-10-14 17:07:58,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:07:58,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:07:58,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2024-10-14 17:07:58,151 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8516260162601627 [2024-10-14 17:07:58,152 INFO L175 Difference]: Start difference. First operand has 151 places, 151 transitions, 347 flow. Second operand 3 states and 419 transitions. [2024-10-14 17:07:58,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 158 transitions, 427 flow [2024-10-14 17:07:58,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 158 transitions, 413 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:07:58,156 INFO L231 Difference]: Finished difference. Result has 153 places, 154 transitions, 367 flow [2024-10-14 17:07:58,157 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=367, PETRI_PLACES=153, PETRI_TRANSITIONS=154} [2024-10-14 17:07:58,158 INFO L277 CegarLoopForPetriNet]: 151 programPoint places, 2 predicate places. [2024-10-14 17:07:58,158 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 154 transitions, 367 flow [2024-10-14 17:07:58,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:07:58,159 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:07:58,159 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:07:58,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:07:58,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-10-14 17:07:58,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:07:58,160 INFO L85 PathProgramCache]: Analyzing trace with hash 260434630, now seen corresponding path program 1 times [2024-10-14 17:07:58,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:07:58,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378145487] [2024-10-14 17:07:58,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:07:58,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:07:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:07:58,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 17:07:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:07:58,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 17:07:58,233 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 17:07:58,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-10-14 17:07:58,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-10-14 17:07:58,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-10-14 17:07:58,239 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-10-14 17:07:58,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-10-14 17:07:58,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-10-14 17:07:58,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-10-14 17:07:58,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-10-14 17:07:58,240 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-10-14 17:07:58,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-10-14 17:07:58,241 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-10-14 17:07:58,242 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-10-14 17:07:58,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:07:58,242 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 17:07:58,245 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-14 17:07:58,245 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-14 17:07:58,282 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-14 17:07:58,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 213 transitions, 442 flow [2024-10-14 17:07:58,329 INFO L124 PetriNetUnfolderBase]: 43/379 cut-off events. [2024-10-14 17:07:58,329 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:07:58,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 379 events. 43/379 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1303 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 235. Up to 9 conditions per place. [2024-10-14 17:07:58,334 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 213 transitions, 442 flow [2024-10-14 17:07:58,338 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 213 transitions, 442 flow [2024-10-14 17:07:58,339 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:07:58,340 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53e3f238, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:07:58,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-14 17:07:58,345 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:07:58,345 INFO L124 PetriNetUnfolderBase]: 3/63 cut-off events. [2024-10-14 17:07:58,346 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:07:58,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:07:58,346 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:07:58,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:07:58,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:07:58,347 INFO L85 PathProgramCache]: Analyzing trace with hash 968015848, now seen corresponding path program 1 times [2024-10-14 17:07:58,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:07:58,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859848418] [2024-10-14 17:07:58,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:07:58,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:07:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:07:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:07:58,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:07:58,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859848418] [2024-10-14 17:07:58,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859848418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:07:58,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:07:58,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:07:58,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910239294] [2024-10-14 17:07:58,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:07:58,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:07:58,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:07:58,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:07:58,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:07:58,780 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 213 [2024-10-14 17:07:58,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 213 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:07:58,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:07:58,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 213 [2024-10-14 17:07:58,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:07:59,981 INFO L124 PetriNetUnfolderBase]: 1874/8092 cut-off events. [2024-10-14 17:07:59,982 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-10-14 17:07:59,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11060 conditions, 8092 events. 1874/8092 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 84124 event pairs, 708 based on Foata normal form. 1383/8600 useless extension candidates. Maximal degree in co-relation 3268. Up to 2093 conditions per place. [2024-10-14 17:08:00,032 INFO L140 encePairwiseOnDemand]: 189/213 looper letters, 80 selfloop transitions, 5 changer transitions 0/240 dead transitions. [2024-10-14 17:08:00,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 240 transitions, 666 flow [2024-10-14 17:08:00,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:08:00,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:08:00,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1088 transitions. [2024-10-14 17:08:00,036 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8513302034428795 [2024-10-14 17:08:00,036 INFO L175 Difference]: Start difference. First operand has 195 places, 213 transitions, 442 flow. Second operand 6 states and 1088 transitions. [2024-10-14 17:08:00,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 240 transitions, 666 flow [2024-10-14 17:08:00,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 240 transitions, 666 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:08:00,043 INFO L231 Difference]: Finished difference. Result has 197 places, 192 transitions, 410 flow [2024-10-14 17:08:00,043 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=410, PETRI_PLACES=197, PETRI_TRANSITIONS=192} [2024-10-14 17:08:00,045 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, 2 predicate places. [2024-10-14 17:08:00,046 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 192 transitions, 410 flow [2024-10-14 17:08:00,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 157.5) internal successors, (945), 6 states have internal predecessors, (945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:00,047 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:00,047 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:08:00,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:08:00,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:08:00,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1681818035, now seen corresponding path program 1 times [2024-10-14 17:08:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:00,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046443024] [2024-10-14 17:08:00,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:00,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:08:00,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:00,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046443024] [2024-10-14 17:08:00,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046443024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:00,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:00,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:08:00,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077911371] [2024-10-14 17:08:00,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:00,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:08:00,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:00,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:08:00,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:08:00,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 213 [2024-10-14 17:08:00,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 192 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:00,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:00,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 213 [2024-10-14 17:08:00,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:00,821 INFO L124 PetriNetUnfolderBase]: 972/5006 cut-off events. [2024-10-14 17:08:00,821 INFO L125 PetriNetUnfolderBase]: For 208/208 co-relation queries the response was YES. [2024-10-14 17:08:00,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6636 conditions, 5006 events. 972/5006 cut-off events. For 208/208 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 48695 event pairs, 327 based on Foata normal form. 1/4470 useless extension candidates. Maximal degree in co-relation 876. Up to 1438 conditions per place. [2024-10-14 17:08:00,863 INFO L140 encePairwiseOnDemand]: 210/213 looper letters, 31 selfloop transitions, 2 changer transitions 0/199 dead transitions. [2024-10-14 17:08:00,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 199 transitions, 492 flow [2024-10-14 17:08:00,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:08:00,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:08:00,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 538 transitions. [2024-10-14 17:08:00,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8419405320813772 [2024-10-14 17:08:00,867 INFO L175 Difference]: Start difference. First operand has 197 places, 192 transitions, 410 flow. Second operand 3 states and 538 transitions. [2024-10-14 17:08:00,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 199 transitions, 492 flow [2024-10-14 17:08:00,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 199 transitions, 480 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:08:00,873 INFO L231 Difference]: Finished difference. Result has 195 places, 193 transitions, 412 flow [2024-10-14 17:08:00,873 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=412, PETRI_PLACES=195, PETRI_TRANSITIONS=193} [2024-10-14 17:08:00,874 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, 0 predicate places. [2024-10-14 17:08:00,875 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 193 transitions, 412 flow [2024-10-14 17:08:00,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:00,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:00,876 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:08:00,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:08:00,877 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:08:00,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:00,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1104877047, now seen corresponding path program 1 times [2024-10-14 17:08:00,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:00,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382830188] [2024-10-14 17:08:00,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:00,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:00,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:08:00,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:00,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382830188] [2024-10-14 17:08:00,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382830188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:00,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:00,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:08:00,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727763225] [2024-10-14 17:08:00,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:00,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:08:00,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:00,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:08:00,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:08:00,974 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 213 [2024-10-14 17:08:00,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 193 transitions, 412 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:00,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:00,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 213 [2024-10-14 17:08:00,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:01,959 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 195#true, 193#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:01,960 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is not cut-off event [2024-10-14 17:08:01,960 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-14 17:08:01,960 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-10-14 17:08:01,960 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-14 17:08:02,476 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 51#$Ultimate##0true, 193#true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,476 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-10-14 17:08:02,477 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-14 17:08:02,477 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-14 17:08:02,477 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-14 17:08:02,483 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 28#$Ultimate##0true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,483 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-10-14 17:08:02,484 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-14 17:08:02,486 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-14 17:08:02,486 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-14 17:08:02,510 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 122#L938-3true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,510 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-10-14 17:08:02,511 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-14 17:08:02,511 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-14 17:08:02,511 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-14 17:08:02,533 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0), 55#L938-3true]) [2024-10-14 17:08:02,533 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2024-10-14 17:08:02,533 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-14 17:08:02,534 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-14 17:08:02,534 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-14 17:08:02,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 117#L939-3true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,586 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-10-14 17:08:02,586 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-14 17:08:02,586 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-14 17:08:02,586 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-14 17:08:02,606 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 11#L939-3true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,607 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2024-10-14 17:08:02,607 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-14 17:08:02,607 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-14 17:08:02,607 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-14 17:08:02,607 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][222], [115#L952-9true, 83#L939-5true, 193#true, 210#(= |#race~global~0| 0), 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,608 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-10-14 17:08:02,608 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-14 17:08:02,608 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-14 17:08:02,608 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-14 17:08:02,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][222], [115#L952-9true, 193#true, 141#L939-6true, 210#(= |#race~global~0| 0), 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,654 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-14 17:08:02,654 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-14 17:08:02,654 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:08:02,654 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-14 17:08:02,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 83#L939-5true, 193#true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,655 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is not cut-off event [2024-10-14 17:08:02,655 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-14 17:08:02,655 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-10-14 17:08:02,655 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-10-14 17:08:02,655 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 138#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,655 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-14 17:08:02,656 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-14 17:08:02,656 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:08:02,656 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-14 17:08:02,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 141#L939-6true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,677 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is not cut-off event [2024-10-14 17:08:02,677 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is not cut-off event [2024-10-14 17:08:02,677 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-10-14 17:08:02,677 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-10-14 17:08:02,734 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 78#L939-10true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,735 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-14 17:08:02,735 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:08:02,735 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:08:02,735 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-14 17:08:02,751 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [182#L939-10true, 115#L952-9true, 208#true, 193#true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,752 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is not cut-off event [2024-10-14 17:08:02,752 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-14 17:08:02,752 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2024-10-14 17:08:02,752 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-14 17:08:02,793 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 148#L939-16true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,793 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-14 17:08:02,793 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-14 17:08:02,793 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:02,793 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:02,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 104#L939-16true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,806 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event [2024-10-14 17:08:02,806 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-14 17:08:02,806 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-14 17:08:02,806 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2024-10-14 17:08:02,830 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0), 150#L939-22true]) [2024-10-14 17:08:02,831 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-14 17:08:02,831 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-14 17:08:02,831 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-14 17:08:02,831 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-14 17:08:02,841 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [17#L939-22true, 115#L952-9true, 208#true, 193#true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,841 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2024-10-14 17:08:02,841 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-14 17:08:02,842 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-14 17:08:02,842 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-14 17:08:02,851 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][221], [115#L952-9true, 9#L939-24true, 194#true, 195#true, 210#(= |#race~global~0| 0), 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,852 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-14 17:08:02,852 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-10-14 17:08:02,852 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:08:02,852 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:08:02,860 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 54#L939-24true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,861 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is not cut-off event [2024-10-14 17:08:02,861 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2024-10-14 17:08:02,861 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is not cut-off event [2024-10-14 17:08:02,861 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is not cut-off event [2024-10-14 17:08:02,861 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 101#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 193#true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,861 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-14 17:08:02,862 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-14 17:08:02,862 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-14 17:08:02,862 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-14 17:08:02,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][221], [115#L952-9true, 194#true, 195#true, 210#(= |#race~global~0| 0), 48#L939-25true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,862 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-14 17:08:02,863 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-14 17:08:02,863 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-14 17:08:02,863 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-14 17:08:02,863 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 9#L939-24true, 194#true, 195#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,863 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is not cut-off event [2024-10-14 17:08:02,863 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is not cut-off event [2024-10-14 17:08:02,864 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is not cut-off event [2024-10-14 17:08:02,864 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is not cut-off event [2024-10-14 17:08:02,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 14#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,864 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2024-10-14 17:08:02,864 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-14 17:08:02,864 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-14 17:08:02,864 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-14 17:08:02,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 110#L939-25true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,873 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is not cut-off event [2024-10-14 17:08:02,873 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is not cut-off event [2024-10-14 17:08:02,873 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-10-14 17:08:02,873 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is not cut-off event [2024-10-14 17:08:02,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 194#true, 195#true, 48#L939-25true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:02,874 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is not cut-off event [2024-10-14 17:08:02,874 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is not cut-off event [2024-10-14 17:08:02,874 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-10-14 17:08:02,874 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is not cut-off event [2024-10-14 17:08:03,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [72#L939-29true, 115#L952-9true, 208#true, 194#true, 195#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:03,007 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-14 17:08:03,007 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-10-14 17:08:03,007 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-14 17:08:03,007 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-14 17:08:03,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 12#L939-29true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:03,025 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-10-14 17:08:03,025 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-14 17:08:03,025 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-14 17:08:03,026 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-14 17:08:03,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][222], [115#L952-9true, 193#true, 110#L939-25true, 210#(= |#race~global~0| 0), 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:03,027 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-10-14 17:08:03,027 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-14 17:08:03,028 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-14 17:08:03,028 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:08:03,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][222], [115#L952-9true, 193#true, 210#(= |#race~global~0| 0), 54#L939-24true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:03,028 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-10-14 17:08:03,028 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:08:03,028 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:08:03,028 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:08:03,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [5#L939-35true, 115#L952-9true, 208#true, 194#true, 195#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:03,044 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-14 17:08:03,044 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-10-14 17:08:03,044 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-14 17:08:03,045 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-14 17:08:03,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 191#L939-35true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:03,051 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2024-10-14 17:08:03,051 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2024-10-14 17:08:03,051 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2024-10-14 17:08:03,051 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is not cut-off event [2024-10-14 17:08:03,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][220], [115#L952-9true, 208#true, 161#L940-2true, 194#true, 195#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:03,065 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-10-14 17:08:03,066 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2024-10-14 17:08:03,066 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-14 17:08:03,066 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-14 17:08:03,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, 193#true, 56#L940-2true, 196#true, 204#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:03,069 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event [2024-10-14 17:08:03,070 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-10-14 17:08:03,070 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is not cut-off event [2024-10-14 17:08:03,070 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-10-14 17:08:03,099 INFO L124 PetriNetUnfolderBase]: 4754/15587 cut-off events. [2024-10-14 17:08:03,100 INFO L125 PetriNetUnfolderBase]: For 570/570 co-relation queries the response was YES. [2024-10-14 17:08:03,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22967 conditions, 15587 events. 4754/15587 cut-off events. For 570/570 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 174506 event pairs, 1581 based on Foata normal form. 0/13777 useless extension candidates. Maximal degree in co-relation 22903. Up to 3673 conditions per place. [2024-10-14 17:08:03,217 INFO L140 encePairwiseOnDemand]: 194/213 looper letters, 58 selfloop transitions, 14 changer transitions 0/226 dead transitions. [2024-10-14 17:08:03,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 226 transitions, 633 flow [2024-10-14 17:08:03,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:08:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:08:03,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2024-10-14 17:08:03,220 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8482003129890454 [2024-10-14 17:08:03,221 INFO L175 Difference]: Start difference. First operand has 195 places, 193 transitions, 412 flow. Second operand 3 states and 542 transitions. [2024-10-14 17:08:03,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 226 transitions, 633 flow [2024-10-14 17:08:03,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 226 transitions, 631 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:08:03,227 INFO L231 Difference]: Finished difference. Result has 198 places, 207 transitions, 532 flow [2024-10-14 17:08:03,227 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=410, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=198, PETRI_TRANSITIONS=207} [2024-10-14 17:08:03,228 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, 3 predicate places. [2024-10-14 17:08:03,228 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 207 transitions, 532 flow [2024-10-14 17:08:03,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:03,229 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:03,229 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:08:03,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:08:03,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:08:03,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:03,230 INFO L85 PathProgramCache]: Analyzing trace with hash -39313574, now seen corresponding path program 1 times [2024-10-14 17:08:03,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:03,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711763256] [2024-10-14 17:08:03,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:03,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:03,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:08:03,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:03,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711763256] [2024-10-14 17:08:03,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711763256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:03,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:03,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:08:03,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099971818] [2024-10-14 17:08:03,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:03,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:08:03,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:03,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:08:03,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:08:03,339 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 213 [2024-10-14 17:08:03,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 207 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:03,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:03,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 213 [2024-10-14 17:08:03,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:04,177 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [208#true, 115#L952-9true, Black: 210#(= |#race~global~0| 0), 195#true, 193#true, 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:04,177 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is not cut-off event [2024-10-14 17:08:04,177 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-10-14 17:08:04,177 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-14 17:08:04,178 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-14 17:08:04,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [51#$Ultimate##0true, 208#true, 115#L952-9true, Black: 210#(= |#race~global~0| 0), 193#true, 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:04,876 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-10-14 17:08:04,876 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-14 17:08:04,876 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-14 17:08:04,876 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-14 17:08:04,883 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [208#true, 115#L952-9true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 28#$Ultimate##0true, 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:04,884 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-10-14 17:08:04,884 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-14 17:08:04,884 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-14 17:08:04,884 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-14 17:08:04,914 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [115#L952-9true, 208#true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 122#L938-3true, 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:04,915 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-10-14 17:08:04,915 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-14 17:08:04,915 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-14 17:08:04,915 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-14 17:08:04,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, Black: 210#(= |#race~global~0| 0), 193#true, 213#true, 196#true, 55#L938-3true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:04,943 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is not cut-off event [2024-10-14 17:08:04,943 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-14 17:08:04,943 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-14 17:08:04,944 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2024-10-14 17:08:05,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [208#true, 115#L952-9true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 213#true, 117#L939-3true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,101 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-10-14 17:08:05,101 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-14 17:08:05,101 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-14 17:08:05,101 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-14 17:08:05,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [208#true, 115#L952-9true, Black: 210#(= |#race~global~0| 0), 193#true, 213#true, 11#L939-3true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,117 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is not cut-off event [2024-10-14 17:08:05,117 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-14 17:08:05,117 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-14 17:08:05,117 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is not cut-off event [2024-10-14 17:08:05,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, Black: 208#true, 83#L939-5true, 193#true, 210#(= |#race~global~0| 0), 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,117 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-10-14 17:08:05,117 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-14 17:08:05,117 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-14 17:08:05,117 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-14 17:08:05,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [208#true, 115#L952-9true, Black: 210#(= |#race~global~0| 0), 83#L939-5true, 193#true, 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,152 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is not cut-off event [2024-10-14 17:08:05,152 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-10-14 17:08:05,152 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-10-14 17:08:05,152 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-14 17:08:05,171 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [208#true, 115#L952-9true, Black: 210#(= |#race~global~0| 0), 141#L939-6true, 193#true, 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,171 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is not cut-off event [2024-10-14 17:08:05,171 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-10-14 17:08:05,171 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-10-14 17:08:05,171 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is not cut-off event [2024-10-14 17:08:05,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [182#L939-10true, 115#L952-9true, 208#true, Black: 210#(= |#race~global~0| 0), 193#true, 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,232 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is not cut-off event [2024-10-14 17:08:05,232 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-14 17:08:05,232 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-14 17:08:05,232 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2024-10-14 17:08:05,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [115#L952-9true, 208#true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 77#L939-13true, 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,254 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-10-14 17:08:05,254 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-14 17:08:05,254 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 17:08:05,254 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 17:08:05,266 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [115#L952-9true, 208#true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 213#true, 148#L939-16true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,266 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-14 17:08:05,266 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:05,266 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:05,266 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-14 17:08:05,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, Black: 210#(= |#race~global~0| 0), 193#true, 104#L939-16true, 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,280 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event [2024-10-14 17:08:05,280 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-14 17:08:05,281 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event [2024-10-14 17:08:05,281 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-14 17:08:05,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [115#L952-9true, 208#true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 213#true, 150#L939-22true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,299 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-14 17:08:05,299 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-14 17:08:05,299 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-14 17:08:05,299 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-14 17:08:05,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [17#L939-22true, 208#true, 115#L952-9true, Black: 210#(= |#race~global~0| 0), 193#true, 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,306 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2024-10-14 17:08:05,306 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is not cut-off event [2024-10-14 17:08:05,306 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-14 17:08:05,306 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-14 17:08:05,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [115#L952-9true, 9#L939-24true, Black: 208#true, 194#true, 195#true, 210#(= |#race~global~0| 0), 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,312 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-14 17:08:05,312 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:08:05,312 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-10-14 17:08:05,312 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:08:05,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [115#L952-9true, 208#true, 72#L939-29true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,340 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-14 17:08:05,340 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-14 17:08:05,340 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-14 17:08:05,340 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-10-14 17:08:05,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [208#true, 115#L952-9true, Black: 210#(= |#race~global~0| 0), 193#true, 12#L939-29true, 213#true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,345 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is not cut-off event [2024-10-14 17:08:05,345 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-14 17:08:05,345 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is not cut-off event [2024-10-14 17:08:05,345 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-14 17:08:05,349 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, Black: 208#true, 193#true, 213#true, 210#(= |#race~global~0| 0), 196#true, 54#L939-24true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,350 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-10-14 17:08:05,350 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:08:05,350 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:08:05,350 INFO L297 olderBase$Statistics]: existing Event has 146 ancestors and is cut-off event [2024-10-14 17:08:05,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [5#L939-35true, 208#true, 115#L952-9true, 194#true, Black: 210#(= |#race~global~0| 0), 195#true, 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,356 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-14 17:08:05,356 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-10-14 17:08:05,356 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-14 17:08:05,356 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-14 17:08:05,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, Black: 210#(= |#race~global~0| 0), 193#true, 213#true, 191#L939-35true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,359 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event [2024-10-14 17:08:05,359 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2024-10-14 17:08:05,359 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is not cut-off event [2024-10-14 17:08:05,359 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2024-10-14 17:08:05,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([747] t_funEXIT-->L952-9: Formula: (= v_t_funThread2of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_9| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_9|, t_funThread2of2ForFork0_thidvar0=v_t_funThread2of2ForFork0_thidvar0_4} AuxVars[] AssignedVars[][223], [115#L952-9true, 208#true, 194#true, 161#L940-2true, Black: 210#(= |#race~global~0| 0), 195#true, 213#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,366 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-10-14 17:08:05,366 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-14 17:08:05,366 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2024-10-14 17:08:05,366 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-14 17:08:05,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([746] t_funEXIT-->L952-9: Formula: (= v_t_funThread1of2ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_7| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} OutVars{t_funThread1of2ForFork0_thidvar0=v_t_funThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_7|} AuxVars[] AssignedVars[][194], [115#L952-9true, 208#true, Black: 210#(= |#race~global~0| 0), 193#true, 213#true, 56#L940-2true, 196#true, Black: 206#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2024-10-14 17:08:05,368 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event [2024-10-14 17:08:05,368 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-10-14 17:08:05,368 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-10-14 17:08:05,368 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is not cut-off event [2024-10-14 17:08:05,383 INFO L124 PetriNetUnfolderBase]: 4902/17958 cut-off events. [2024-10-14 17:08:05,383 INFO L125 PetriNetUnfolderBase]: For 4627/4785 co-relation queries the response was YES. [2024-10-14 17:08:05,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29532 conditions, 17958 events. 4902/17958 cut-off events. For 4627/4785 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 214161 event pairs, 2418 based on Foata normal form. 45/16141 useless extension candidates. Maximal degree in co-relation 28053. Up to 6184 conditions per place. [2024-10-14 17:08:05,497 INFO L140 encePairwiseOnDemand]: 204/213 looper letters, 52 selfloop transitions, 14 changer transitions 0/231 dead transitions. [2024-10-14 17:08:05,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 231 transitions, 750 flow [2024-10-14 17:08:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:08:05,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:08:05,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2024-10-14 17:08:05,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.838810641627543 [2024-10-14 17:08:05,499 INFO L175 Difference]: Start difference. First operand has 198 places, 207 transitions, 532 flow. Second operand 3 states and 536 transitions. [2024-10-14 17:08:05,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 231 transitions, 750 flow [2024-10-14 17:08:05,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 231 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:08:05,513 INFO L231 Difference]: Finished difference. Result has 200 places, 219 transitions, 630 flow [2024-10-14 17:08:05,513 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=200, PETRI_TRANSITIONS=219} [2024-10-14 17:08:05,514 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, 5 predicate places. [2024-10-14 17:08:05,514 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 219 transitions, 630 flow [2024-10-14 17:08:05,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:05,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:05,515 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:08:05,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:08:05,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:08:05,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:05,516 INFO L85 PathProgramCache]: Analyzing trace with hash -733496753, now seen corresponding path program 1 times [2024-10-14 17:08:05,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:05,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676523672] [2024-10-14 17:08:05,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:08:05,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:05,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676523672] [2024-10-14 17:08:05,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676523672] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:08:05,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027398053] [2024-10-14 17:08:05,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:05,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:08:05,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:08:05,805 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:08:05,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 17:08:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:05,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 17:08:05,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:08:05,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:08:05,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:08:05,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027398053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:05,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:08:05,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-14 17:08:05,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654254731] [2024-10-14 17:08:05,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:05,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:08:05,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:05,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:08:05,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:08:05,993 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 213 [2024-10-14 17:08:05,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 219 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:05,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:05,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 213 [2024-10-14 17:08:05,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:08,712 INFO L124 PetriNetUnfolderBase]: 5834/27521 cut-off events. [2024-10-14 17:08:08,713 INFO L125 PetriNetUnfolderBase]: For 3230/4167 co-relation queries the response was YES. [2024-10-14 17:08:08,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41445 conditions, 27521 events. 5834/27521 cut-off events. For 3230/4167 co-relation queries the response was YES. Maximal size of possible extension queue 755. Compared 370901 event pairs, 2503 based on Foata normal form. 127/24842 useless extension candidates. Maximal degree in co-relation 39177. Up to 3430 conditions per place. [2024-10-14 17:08:08,887 INFO L140 encePairwiseOnDemand]: 209/213 looper letters, 42 selfloop transitions, 3 changer transitions 0/238 dead transitions. [2024-10-14 17:08:08,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 238 transitions, 764 flow [2024-10-14 17:08:08,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:08:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:08:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 550 transitions. [2024-10-14 17:08:08,890 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8607198748043818 [2024-10-14 17:08:08,890 INFO L175 Difference]: Start difference. First operand has 200 places, 219 transitions, 630 flow. Second operand 3 states and 550 transitions. [2024-10-14 17:08:08,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 238 transitions, 764 flow [2024-10-14 17:08:08,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 238 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:08:08,914 INFO L231 Difference]: Finished difference. Result has 202 places, 221 transitions, 624 flow [2024-10-14 17:08:08,915 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=202, PETRI_TRANSITIONS=221} [2024-10-14 17:08:08,916 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, 7 predicate places. [2024-10-14 17:08:08,916 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 221 transitions, 624 flow [2024-10-14 17:08:08,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:08,917 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:08,917 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:08:08,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 17:08:09,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 17:08:09,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:08:09,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:09,123 INFO L85 PathProgramCache]: Analyzing trace with hash 187245600, now seen corresponding path program 1 times [2024-10-14 17:08:09,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:09,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107067280] [2024-10-14 17:08:09,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:09,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:09,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:08:09,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:09,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107067280] [2024-10-14 17:08:09,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107067280] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:08:09,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522761083] [2024-10-14 17:08:09,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:09,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:08:09,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:08:09,226 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:08:09,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 17:08:09,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:09,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 17:08:09,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:08:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:08:09,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:08:09,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522761083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:09,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:08:09,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-14 17:08:09,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695054041] [2024-10-14 17:08:09,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:09,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:08:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:09,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:08:09,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:08:09,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 213 [2024-10-14 17:08:09,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 221 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:09,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:09,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 213 [2024-10-14 17:08:09,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:12,317 INFO L124 PetriNetUnfolderBase]: 6115/29089 cut-off events. [2024-10-14 17:08:12,317 INFO L125 PetriNetUnfolderBase]: For 5727/6149 co-relation queries the response was YES. [2024-10-14 17:08:12,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44987 conditions, 29089 events. 6115/29089 cut-off events. For 5727/6149 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 391454 event pairs, 3054 based on Foata normal form. 130/25945 useless extension candidates. Maximal degree in co-relation 42646. Up to 6042 conditions per place. [2024-10-14 17:08:12,508 INFO L140 encePairwiseOnDemand]: 210/213 looper letters, 42 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2024-10-14 17:08:12,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 237 transitions, 752 flow [2024-10-14 17:08:12,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:08:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:08:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2024-10-14 17:08:12,511 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8560250391236307 [2024-10-14 17:08:12,511 INFO L175 Difference]: Start difference. First operand has 202 places, 221 transitions, 624 flow. Second operand 3 states and 547 transitions. [2024-10-14 17:08:12,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 237 transitions, 752 flow [2024-10-14 17:08:12,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 237 transitions, 746 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:08:12,535 INFO L231 Difference]: Finished difference. Result has 203 places, 222 transitions, 632 flow [2024-10-14 17:08:12,535 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=203, PETRI_TRANSITIONS=222} [2024-10-14 17:08:12,536 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, 8 predicate places. [2024-10-14 17:08:12,536 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 222 transitions, 632 flow [2024-10-14 17:08:12,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:12,537 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:12,537 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:08:12,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:08:12,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 17:08:12,738 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:08:12,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:12,739 INFO L85 PathProgramCache]: Analyzing trace with hash -516409989, now seen corresponding path program 1 times [2024-10-14 17:08:12,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:12,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956616955] [2024-10-14 17:08:12,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:12,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:08:12,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:12,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956616955] [2024-10-14 17:08:12,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956616955] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:08:12,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336481639] [2024-10-14 17:08:12,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:12,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:08:12,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:08:12,844 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:08:12,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 17:08:12,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:12,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 17:08:12,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:08:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:08:13,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:08:13,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:08:13,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [336481639] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:08:13,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:08:13,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-10-14 17:08:13,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702860290] [2024-10-14 17:08:13,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:08:13,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 17:08:13,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:13,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 17:08:13,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:08:13,167 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 213 [2024-10-14 17:08:13,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 222 transitions, 632 flow. Second operand has 10 states, 10 states have (on average 167.3) internal successors, (1673), 10 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:13,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:13,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 213 [2024-10-14 17:08:13,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:13,746 INFO L124 PetriNetUnfolderBase]: 675/2923 cut-off events. [2024-10-14 17:08:13,747 INFO L125 PetriNetUnfolderBase]: For 224/241 co-relation queries the response was YES. [2024-10-14 17:08:13,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4511 conditions, 2923 events. 675/2923 cut-off events. For 224/241 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 25192 event pairs, 55 based on Foata normal form. 106/2901 useless extension candidates. Maximal degree in co-relation 4501. Up to 458 conditions per place. [2024-10-14 17:08:13,764 INFO L140 encePairwiseOnDemand]: 208/213 looper letters, 72 selfloop transitions, 7 changer transitions 0/216 dead transitions. [2024-10-14 17:08:13,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 216 transitions, 716 flow [2024-10-14 17:08:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 17:08:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-14 17:08:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1566 transitions. [2024-10-14 17:08:13,769 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8169014084507042 [2024-10-14 17:08:13,769 INFO L175 Difference]: Start difference. First operand has 203 places, 222 transitions, 632 flow. Second operand 9 states and 1566 transitions. [2024-10-14 17:08:13,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 216 transitions, 716 flow [2024-10-14 17:08:13,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 216 transitions, 716 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:08:13,774 INFO L231 Difference]: Finished difference. Result has 159 places, 160 transitions, 460 flow [2024-10-14 17:08:13,774 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=460, PETRI_PLACES=159, PETRI_TRANSITIONS=160} [2024-10-14 17:08:13,775 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, -36 predicate places. [2024-10-14 17:08:13,775 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 160 transitions, 460 flow [2024-10-14 17:08:13,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 167.3) internal successors, (1673), 10 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:13,776 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:13,777 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:08:13,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 17:08:13,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:08:13,978 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:08:13,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:13,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1296148194, now seen corresponding path program 1 times [2024-10-14 17:08:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:13,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761740882] [2024-10-14 17:08:13,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:14,029 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-14 17:08:14,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:14,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761740882] [2024-10-14 17:08:14,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761740882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:14,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:14,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:08:14,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023606713] [2024-10-14 17:08:14,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:14,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:08:14,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:14,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:08:14,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:08:14,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 213 [2024-10-14 17:08:14,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 160 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:14,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:14,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 213 [2024-10-14 17:08:14,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:14,226 INFO L124 PetriNetUnfolderBase]: 260/1301 cut-off events. [2024-10-14 17:08:14,226 INFO L125 PetriNetUnfolderBase]: For 454/475 co-relation queries the response was YES. [2024-10-14 17:08:14,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2349 conditions, 1301 events. 260/1301 cut-off events. For 454/475 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8700 event pairs, 132 based on Foata normal form. 7/1216 useless extension candidates. Maximal degree in co-relation 2338. Up to 459 conditions per place. [2024-10-14 17:08:14,236 INFO L140 encePairwiseOnDemand]: 205/213 looper letters, 42 selfloop transitions, 12 changer transitions 0/174 dead transitions. [2024-10-14 17:08:14,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 174 transitions, 612 flow [2024-10-14 17:08:14,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:08:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:08:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2024-10-14 17:08:14,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8169014084507042 [2024-10-14 17:08:14,239 INFO L175 Difference]: Start difference. First operand has 159 places, 160 transitions, 460 flow. Second operand 3 states and 522 transitions. [2024-10-14 17:08:14,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 174 transitions, 612 flow [2024-10-14 17:08:14,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 174 transitions, 597 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-10-14 17:08:14,245 INFO L231 Difference]: Finished difference. Result has 158 places, 168 transitions, 543 flow [2024-10-14 17:08:14,246 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=543, PETRI_PLACES=158, PETRI_TRANSITIONS=168} [2024-10-14 17:08:14,246 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, -37 predicate places. [2024-10-14 17:08:14,246 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 168 transitions, 543 flow [2024-10-14 17:08:14,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:14,247 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:14,247 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:08:14,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:08:14,249 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:08:14,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:14,250 INFO L85 PathProgramCache]: Analyzing trace with hash -34473496, now seen corresponding path program 1 times [2024-10-14 17:08:14,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:14,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768863582] [2024-10-14 17:08:14,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:14,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:14,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:08:14,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:14,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768863582] [2024-10-14 17:08:14,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768863582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:14,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:14,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:08:14,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499730666] [2024-10-14 17:08:14,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:14,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:08:14,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:14,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:08:14,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:08:14,330 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 213 [2024-10-14 17:08:14,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 168 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:14,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:14,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 213 [2024-10-14 17:08:14,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:14,503 INFO L124 PetriNetUnfolderBase]: 291/1373 cut-off events. [2024-10-14 17:08:14,503 INFO L125 PetriNetUnfolderBase]: For 1105/1140 co-relation queries the response was YES. [2024-10-14 17:08:14,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2803 conditions, 1373 events. 291/1373 cut-off events. For 1105/1140 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9360 event pairs, 134 based on Foata normal form. 9/1306 useless extension candidates. Maximal degree in co-relation 2792. Up to 501 conditions per place. [2024-10-14 17:08:14,514 INFO L140 encePairwiseOnDemand]: 205/213 looper letters, 49 selfloop transitions, 12 changer transitions 0/183 dead transitions. [2024-10-14 17:08:14,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 183 transitions, 732 flow [2024-10-14 17:08:14,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:08:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:08:14,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2024-10-14 17:08:14,517 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8184663536776213 [2024-10-14 17:08:14,517 INFO L175 Difference]: Start difference. First operand has 158 places, 168 transitions, 543 flow. Second operand 3 states and 523 transitions. [2024-10-14 17:08:14,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 183 transitions, 732 flow [2024-10-14 17:08:14,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 183 transitions, 704 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:08:14,522 INFO L231 Difference]: Finished difference. Result has 160 places, 176 transitions, 629 flow [2024-10-14 17:08:14,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=213, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=629, PETRI_PLACES=160, PETRI_TRANSITIONS=176} [2024-10-14 17:08:14,523 INFO L277 CegarLoopForPetriNet]: 195 programPoint places, -35 predicate places. [2024-10-14 17:08:14,524 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 176 transitions, 629 flow [2024-10-14 17:08:14,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:14,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:14,524 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:08:14,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:08:14,525 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:08:14,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:14,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1588779371, now seen corresponding path program 1 times [2024-10-14 17:08:14,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:14,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935280450] [2024-10-14 17:08:14,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:14,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:08:14,545 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 17:08:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 17:08:14,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 17:08:14,573 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 17:08:14,573 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-10-14 17:08:14,573 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-10-14 17:08:14,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-10-14 17:08:14,574 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-10-14 17:08:14,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-10-14 17:08:14,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-10-14 17:08:14,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-10-14 17:08:14,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-10-14 17:08:14,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-10-14 17:08:14,575 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-10-14 17:08:14,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-10-14 17:08:14,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-10-14 17:08:14,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-10-14 17:08:14,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-10-14 17:08:14,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-10-14 17:08:14,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-10-14 17:08:14,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:08:14,577 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:08:14,577 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-14 17:08:14,578 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-14 17:08:14,609 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 17:08:14,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 262 transitions, 551 flow [2024-10-14 17:08:14,679 INFO L124 PetriNetUnfolderBase]: 66/570 cut-off events. [2024-10-14 17:08:14,679 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-14 17:08:14,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 570 events. 66/570 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2142 event pairs, 1 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 387. Up to 16 conditions per place. [2024-10-14 17:08:14,686 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 262 transitions, 551 flow [2024-10-14 17:08:14,690 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 262 transitions, 551 flow [2024-10-14 17:08:14,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:08:14,691 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53e3f238, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:08:14,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-10-14 17:08:14,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:08:14,695 INFO L124 PetriNetUnfolderBase]: 3/63 cut-off events. [2024-10-14 17:08:14,695 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:08:14,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:14,695 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:08:14,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-14 17:08:14,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:14,696 INFO L85 PathProgramCache]: Analyzing trace with hash 298954478, now seen corresponding path program 1 times [2024-10-14 17:08:14,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:14,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744045397] [2024-10-14 17:08:14,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:14,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:14,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:08:14,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:14,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744045397] [2024-10-14 17:08:14,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744045397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:14,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:14,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:08:14,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624035469] [2024-10-14 17:08:14,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:14,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:08:14,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:14,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:08:14,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:08:15,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 262 [2024-10-14 17:08:15,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 262 transitions, 551 flow. Second operand has 6 states, 6 states have (on average 192.5) internal successors, (1155), 6 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:15,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:15,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 262 [2024-10-14 17:08:15,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:20,696 INFO L124 PetriNetUnfolderBase]: 18812/51168 cut-off events. [2024-10-14 17:08:20,696 INFO L125 PetriNetUnfolderBase]: For 1003/1003 co-relation queries the response was YES. [2024-10-14 17:08:20,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77581 conditions, 51168 events. 18812/51168 cut-off events. For 1003/1003 co-relation queries the response was YES. Maximal size of possible extension queue 1339. Compared 631903 event pairs, 2581 based on Foata normal form. 14007/60707 useless extension candidates. Maximal degree in co-relation 8850. Up to 18109 conditions per place. [2024-10-14 17:08:20,958 INFO L140 encePairwiseOnDemand]: 232/262 looper letters, 112 selfloop transitions, 5 changer transitions 0/307 dead transitions. [2024-10-14 17:08:20,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 307 transitions, 875 flow [2024-10-14 17:08:20,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:08:20,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:08:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1360 transitions. [2024-10-14 17:08:20,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8651399491094147 [2024-10-14 17:08:20,962 INFO L175 Difference]: Start difference. First operand has 239 places, 262 transitions, 551 flow. Second operand 6 states and 1360 transitions. [2024-10-14 17:08:20,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 307 transitions, 875 flow [2024-10-14 17:08:20,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 307 transitions, 875 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:08:20,966 INFO L231 Difference]: Finished difference. Result has 241 places, 235 transitions, 507 flow [2024-10-14 17:08:20,966 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=241, PETRI_TRANSITIONS=235} [2024-10-14 17:08:20,966 INFO L277 CegarLoopForPetriNet]: 239 programPoint places, 2 predicate places. [2024-10-14 17:08:20,966 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 235 transitions, 507 flow [2024-10-14 17:08:20,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 192.5) internal successors, (1155), 6 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:20,967 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:20,967 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:08:20,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:08:20,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-14 17:08:20,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:20,968 INFO L85 PathProgramCache]: Analyzing trace with hash -404691821, now seen corresponding path program 1 times [2024-10-14 17:08:20,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:20,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556658217] [2024-10-14 17:08:20,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:20,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:20,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:08:20,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:20,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556658217] [2024-10-14 17:08:20,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556658217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:20,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:20,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:08:20,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003496056] [2024-10-14 17:08:20,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:20,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:08:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:20,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:08:20,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:08:21,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 262 [2024-10-14 17:08:21,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 235 transitions, 507 flow. Second operand has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:21,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:21,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 262 [2024-10-14 17:08:21,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:25,440 INFO L124 PetriNetUnfolderBase]: 10694/37984 cut-off events. [2024-10-14 17:08:25,440 INFO L125 PetriNetUnfolderBase]: For 2242/2242 co-relation queries the response was YES. [2024-10-14 17:08:25,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53572 conditions, 37984 events. 10694/37984 cut-off events. For 2242/2242 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 488681 event pairs, 8202 based on Foata normal form. 1/34087 useless extension candidates. Maximal degree in co-relation 39383. Up to 14422 conditions per place. [2024-10-14 17:08:25,762 INFO L140 encePairwiseOnDemand]: 259/262 looper letters, 39 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2024-10-14 17:08:25,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 242 transitions, 605 flow [2024-10-14 17:08:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:08:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:08:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2024-10-14 17:08:25,764 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8282442748091603 [2024-10-14 17:08:25,764 INFO L175 Difference]: Start difference. First operand has 241 places, 235 transitions, 507 flow. Second operand 3 states and 651 transitions. [2024-10-14 17:08:25,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 242 transitions, 605 flow [2024-10-14 17:08:25,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 242 transitions, 593 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:08:25,771 INFO L231 Difference]: Finished difference. Result has 239 places, 236 transitions, 509 flow [2024-10-14 17:08:25,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=262, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=509, PETRI_PLACES=239, PETRI_TRANSITIONS=236} [2024-10-14 17:08:25,772 INFO L277 CegarLoopForPetriNet]: 239 programPoint places, 0 predicate places. [2024-10-14 17:08:25,772 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 236 transitions, 509 flow [2024-10-14 17:08:25,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 204.66666666666666) internal successors, (614), 3 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:25,773 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:08:25,773 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:08:25,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:08:25,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-10-14 17:08:25,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:08:25,774 INFO L85 PathProgramCache]: Analyzing trace with hash -507547656, now seen corresponding path program 1 times [2024-10-14 17:08:25,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:08:25,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53537248] [2024-10-14 17:08:25,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:08:25,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:08:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:08:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:08:25,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:08:25,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53537248] [2024-10-14 17:08:25,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53537248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:08:25,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:08:25,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:08:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136149844] [2024-10-14 17:08:25,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:08:25,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:08:25,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:08:25,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:08:25,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:08:25,852 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 262 [2024-10-14 17:08:25,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 236 transitions, 509 flow. Second operand has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:08:25,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:08:25,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 262 [2024-10-14 17:08:25,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:08:28,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 193#L952-9true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true, 237#true]) [2024-10-14 17:08:28,032 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is not cut-off event [2024-10-14 17:08:28,032 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-14 17:08:28,032 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is not cut-off event [2024-10-14 17:08:28,032 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is not cut-off event [2024-10-14 17:08:32,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [111#$Ultimate##0true, 248#true, 235#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true]) [2024-10-14 17:08:32,168 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-10-14 17:08:32,168 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-14 17:08:32,168 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-14 17:08:32,168 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-14 17:08:32,168 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 239#true, 142#L938-3true]) [2024-10-14 17:08:32,168 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2024-10-14 17:08:32,169 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-14 17:08:32,169 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-14 17:08:32,169 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-14 17:08:32,175 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 193#L952-9true, 236#true, 67#$Ultimate##0true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true, 237#true]) [2024-10-14 17:08:32,176 INFO L294 olderBase$Statistics]: this new event has 124 ancestors and is not cut-off event [2024-10-14 17:08:32,176 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-14 17:08:32,176 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2024-10-14 17:08:32,176 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-14 17:08:32,477 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 193#L952-9true, 236#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 71#L938-3true, 239#true, 252#true, 237#true]) [2024-10-14 17:08:32,478 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-10-14 17:08:32,478 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-14 17:08:32,478 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2024-10-14 17:08:32,478 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2024-10-14 17:08:33,784 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 193#L952-9true, 6#L939-3true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 239#true]) [2024-10-14 17:08:33,784 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-10-14 17:08:33,784 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-14 17:08:33,784 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-14 17:08:33,784 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-14 17:08:33,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 193#L952-9true, 236#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true, 95#L939-3true, 237#true]) [2024-10-14 17:08:33,787 INFO L294 olderBase$Statistics]: this new event has 129 ancestors and is cut-off event [2024-10-14 17:08:33,787 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-14 17:08:33,787 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-14 17:08:33,787 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-14 17:08:34,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][262], [248#true, 235#true, 193#L952-9true, 129#L939-5true, 238#true, 254#(= |#race~global~0| 0), Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true]) [2024-10-14 17:08:34,786 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-10-14 17:08:34,786 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-14 17:08:34,786 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-14 17:08:34,786 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-14 17:08:35,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][262], [65#L939-6true, 248#true, 235#true, 193#L952-9true, 238#true, 254#(= |#race~global~0| 0), Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true]) [2024-10-14 17:08:35,154 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-14 17:08:35,154 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-14 17:08:35,154 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:08:35,154 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-14 17:08:35,154 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 193#L952-9true, 129#L939-5true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true]) [2024-10-14 17:08:35,154 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is not cut-off event [2024-10-14 17:08:35,154 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-10-14 17:08:35,154 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-10-14 17:08:35,154 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is not cut-off event [2024-10-14 17:08:35,155 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [17#t_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 248#true, 235#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true]) [2024-10-14 17:08:35,155 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-14 17:08:35,155 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-14 17:08:35,155 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2024-10-14 17:08:35,155 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-14 17:08:36,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [65#L939-6true, 248#true, 235#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true]) [2024-10-14 17:08:36,010 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is not cut-off event [2024-10-14 17:08:36,010 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-10-14 17:08:36,010 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is not cut-off event [2024-10-14 17:08:36,010 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is not cut-off event [2024-10-14 17:08:37,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [177#L939-10true, 248#true, 235#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true]) [2024-10-14 17:08:37,831 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-14 17:08:37,832 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-14 17:08:37,832 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:08:37,832 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:08:38,643 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [115#L939-10true, 248#true, 193#L952-9true, 236#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true, 237#true]) [2024-10-14 17:08:38,643 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is not cut-off event [2024-10-14 17:08:38,644 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is not cut-off event [2024-10-14 17:08:38,644 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-14 17:08:38,644 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-14 17:08:39,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [111#$Ultimate##0true, 248#true, 235#true, 240#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 55#$Ultimate##0true]) [2024-10-14 17:08:39,272 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2024-10-14 17:08:39,272 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-14 17:08:39,272 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-14 17:08:39,273 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-14 17:08:39,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 240#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 142#L938-3true, 55#$Ultimate##0true]) [2024-10-14 17:08:39,273 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-14 17:08:39,273 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-14 17:08:39,273 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:39,273 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:39,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [111#$Ultimate##0true, 248#true, 235#true, 240#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 163#L938-3true]) [2024-10-14 17:08:39,273 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-14 17:08:39,273 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-14 17:08:39,273 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:39,273 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:39,871 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 240#true, 193#L952-9true, 236#true, 67#$Ultimate##0true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 237#true, 55#$Ultimate##0true]) [2024-10-14 17:08:39,871 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2024-10-14 17:08:39,871 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-14 17:08:39,871 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-14 17:08:39,871 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-14 17:08:39,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 240#true, 193#L952-9true, 236#true, 67#$Ultimate##0true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 237#true, 163#L938-3true]) [2024-10-14 17:08:39,872 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-14 17:08:39,872 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:39,872 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:39,872 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-14 17:08:39,872 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1058] t_funEXIT-->L952-9: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][281], [111#$Ultimate##0true, 248#true, 193#L952-9true, 236#true, 67#$Ultimate##0true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 238#true, 239#true, 252#true]) [2024-10-14 17:08:39,872 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2024-10-14 17:08:39,872 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-14 17:08:39,872 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-10-14 17:08:39,873 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-14 17:08:39,873 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1058] t_funEXIT-->L952-9: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][281], [248#true, 193#L952-9true, 236#true, 67#$Ultimate##0true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 238#true, 239#true, 252#true, 142#L938-3true]) [2024-10-14 17:08:39,873 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-14 17:08:39,873 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:39,873 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-14 17:08:39,873 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:40,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 240#true, 193#L952-9true, 236#true, 71#L938-3true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 237#true, 55#$Ultimate##0true]) [2024-10-14 17:08:40,236 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-10-14 17:08:40,236 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 17:08:40,237 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:40,237 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:40,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1058] t_funEXIT-->L952-9: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][281], [111#$Ultimate##0true, 248#true, 193#L952-9true, 236#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 71#L938-3true, 238#true, 239#true, 252#true]) [2024-10-14 17:08:40,245 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-10-14 17:08:40,245 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:40,245 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-14 17:08:40,245 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:40,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 193#L952-9true, 49#L939-16true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true]) [2024-10-14 17:08:40,322 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2024-10-14 17:08:40,322 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:40,322 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:08:40,322 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-14 17:08:40,542 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1056] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_t_funThread1of3ForFork0_thidvar0_4) InVars {t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} OutVars{t_funThread1of3ForFork0_thidvar0=v_t_funThread1of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_12|} AuxVars[] AssignedVars[][206], [248#true, 235#true, 240#true, 193#L952-9true, 238#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 142#L938-3true, 163#L938-3true]) [2024-10-14 17:08:40,542 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-14 17:08:40,542 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-14 17:08:40,542 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-14 17:08:40,543 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-14 17:08:41,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 240#true, 193#L952-9true, 236#true, 71#L938-3true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 252#true, 237#true, 163#L938-3true]) [2024-10-14 17:08:41,008 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-14 17:08:41,008 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-14 17:08:41,008 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-14 17:08:41,008 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-14 17:08:41,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1058] t_funEXIT-->L952-9: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_16| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_16|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][281], [248#true, 193#L952-9true, 236#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 71#L938-3true, 238#true, 239#true, 252#true, 142#L938-3true]) [2024-10-14 17:08:41,009 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-14 17:08:41,009 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-14 17:08:41,009 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-14 17:08:41,009 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-14 17:08:41,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1057] t_funEXIT-->L952-9: Formula: (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem53#1_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_t_funThread2of3ForFork0_thidvar0_4) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem53#1=|v_ULTIMATE.start_main_#t~mem53#1_14|} AuxVars[] AssignedVars[][255], [248#true, 101#L939-16true, 193#L952-9true, 236#true, Black: 250#(= |ULTIMATE.start_main_~i~1#1| 0), 239#true, 252#true, 237#true]) [2024-10-14 17:08:41,125 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event [2024-10-14 17:08:41,125 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-14 17:08:41,126 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is not cut-off event [2024-10-14 17:08:41,126 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is not cut-off event