./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.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 a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:00:01,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:00:01,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-22 18:00:01,504 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:00:01,505 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:00:01,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:00:01,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:00:01,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:00:01,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:00:01,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:00:01,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:00:01,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:00:01,540 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:00:01,540 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:00:01,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 18:00:01,541 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:00:01,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:00:01,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:00:01,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:00:01,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 18:00:01,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:00:01,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 18:00:01,545 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-22 18:00:01,545 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:00:01,546 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:00:01,546 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:00:01,546 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 18:00:01,546 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:00:01,546 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:00:01,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:00:01,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:00:01,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:00:01,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:00:01,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:00:01,547 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 18:00:01,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:00:01,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:00:01,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:00:01,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:00:01,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:00:01,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:00:01,552 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 -> a5ee9b9286f55973fff2cea9c449f3602c5be2a48fed2e7e6cce6beebc18d9bc [2024-11-22 18:00:01,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:00:01,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:00:01,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:00:01,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:00:01,775 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:00:01,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-22 18:00:03,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:00:03,245 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:00:03,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/circular_buffer_bad.i [2024-11-22 18:00:03,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/156170089/386d882fd1714ba3adc39a56e3c058b1/FLAGf64914c72 [2024-11-22 18:00:03,271 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/156170089/386d882fd1714ba3adc39a56e3c058b1 [2024-11-22 18:00:03,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:00:03,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:00:03,275 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:00:03,275 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:00:03,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:00:03,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:00:03" (1/1) ... [2024-11-22 18:00:03,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c4306da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:00:03, skipping insertion in model container [2024-11-22 18:00:03,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:00:03" (1/1) ... [2024-11-22 18:00:03,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:00:03,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:00:03,657 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:00:03,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:00:03,735 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:00:03,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:00:03 WrapperNode [2024-11-22 18:00:03,736 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:00:03,736 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:00:03,737 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:00:03,737 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:00:03,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:00:03" (1/1) ... [2024-11-22 18:00:03,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:00:03" (1/1) ... [2024-11-22 18:00:03,786 INFO L138 Inliner]: procedures = 168, calls = 40, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 234 [2024-11-22 18:00:03,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:00:03,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:00:03,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:00:03,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:00:03,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:00:03" (1/1) ... [2024-11-22 18:00:03,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:00:03" (1/1) ... [2024-11-22 18:00:03,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:00:03" (1/1) ... [2024-11-22 18:00:03,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:00:03" (1/1) ... [2024-11-22 18:00:03,814 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:00:03" (1/1) ... [2024-11-22 18:00:03,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:00:03" (1/1) ... [2024-11-22 18:00:03,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:00:03" (1/1) ... [2024-11-22 18:00:03,826 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:00:03" (1/1) ... [2024-11-22 18:00:03,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:00:03,833 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:00:03,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:00:03,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:00:03,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:00:03" (1/1) ... [2024-11-22 18:00:03,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:00:03,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:00:03,863 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-11-22 18:00:03,865 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-11-22 18:00:03,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-22 18:00:03,899 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-22 18:00:03,899 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-22 18:00:03,899 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-22 18:00:03,899 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-22 18:00:03,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-22 18:00:03,899 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-22 18:00:03,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:00:03,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-22 18:00:03,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-22 18:00:03,900 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-22 18:00:03,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:00:03,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:00:03,901 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 18:00:04,003 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:00:04,006 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:00:04,377 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 18:00:04,378 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:00:04,413 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:00:04,414 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 18:00:04,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:00:04 BoogieIcfgContainer [2024-11-22 18:00:04,414 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:00:04,416 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:00:04,416 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:00:04,419 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:00:04,420 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:00:03" (1/3) ... [2024-11-22 18:00:04,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699125e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:00:04, skipping insertion in model container [2024-11-22 18:00:04,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:00:03" (2/3) ... [2024-11-22 18:00:04,421 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@699125e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:00:04, skipping insertion in model container [2024-11-22 18:00:04,421 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:00:04" (3/3) ... [2024-11-22 18:00:04,423 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_bad.i [2024-11-22 18:00:04,435 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:00:04,436 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2024-11-22 18:00:04,436 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 18:00:04,542 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-22 18:00:04,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 270 places, 277 transitions, 568 flow [2024-11-22 18:00:04,680 INFO L124 PetriNetUnfolderBase]: 14/275 cut-off events. [2024-11-22 18:00:04,680 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-22 18:00:04,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284 conditions, 275 events. 14/275 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 645 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 190. Up to 2 conditions per place. [2024-11-22 18:00:04,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 270 places, 277 transitions, 568 flow [2024-11-22 18:00:04,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 263 places, 270 transitions, 549 flow [2024-11-22 18:00:04,708 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:00:04,714 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;@f6752fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:00:04,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-11-22 18:00:04,722 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 18:00:04,723 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2024-11-22 18:00:04,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 18:00:04,723 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:04,725 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] [2024-11-22 18:00:04,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:04,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:04,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1096338425, now seen corresponding path program 1 times [2024-11-22 18:00:04,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:04,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683163502] [2024-11-22 18:00:04,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:04,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:04,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:04,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:04,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683163502] [2024-11-22 18:00:04,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683163502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:04,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:04,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:04,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887196905] [2024-11-22 18:00:04,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:04,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:04,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:05,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:05,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:05,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 277 [2024-11-22 18:00:05,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 270 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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-11-22 18:00:05,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:05,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 277 [2024-11-22 18:00:05,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:05,162 INFO L124 PetriNetUnfolderBase]: 55/645 cut-off events. [2024-11-22 18:00:05,163 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-11-22 18:00:05,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 645 events. 55/645 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3332 event pairs, 27 based on Foata normal form. 34/565 useless extension candidates. Maximal degree in co-relation 630. Up to 79 conditions per place. [2024-11-22 18:00:05,171 INFO L140 encePairwiseOnDemand]: 268/277 looper letters, 16 selfloop transitions, 2 changer transitions 0/259 dead transitions. [2024-11-22 18:00:05,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 259 transitions, 563 flow [2024-11-22 18:00:05,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:05,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 772 transitions. [2024-11-22 18:00:05,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9290012033694344 [2024-11-22 18:00:05,191 INFO L175 Difference]: Start difference. First operand has 263 places, 270 transitions, 549 flow. Second operand 3 states and 772 transitions. [2024-11-22 18:00:05,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 259 transitions, 563 flow [2024-11-22 18:00:05,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 259 transitions, 558 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 18:00:05,217 INFO L231 Difference]: Finished difference. Result has 257 places, 259 transitions, 526 flow [2024-11-22 18:00:05,220 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=526, PETRI_PLACES=257, PETRI_TRANSITIONS=259} [2024-11-22 18:00:05,225 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -6 predicate places. [2024-11-22 18:00:05,226 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 259 transitions, 526 flow [2024-11-22 18:00:05,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 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-11-22 18:00:05,226 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:05,226 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-11-22 18:00:05,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:00:05,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:05,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:05,227 INFO L85 PathProgramCache]: Analyzing trace with hash 979925240, now seen corresponding path program 1 times [2024-11-22 18:00:05,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:05,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120607932] [2024-11-22 18:00:05,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:05,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:05,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:05,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:05,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120607932] [2024-11-22 18:00:05,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120607932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:05,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:05,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:05,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927115645] [2024-11-22 18:00:05,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:05,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:05,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:05,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:05,365 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 277 [2024-11-22 18:00:05,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 259 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-11-22 18:00:05,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:05,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 277 [2024-11-22 18:00:05,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:05,467 INFO L124 PetriNetUnfolderBase]: 59/648 cut-off events. [2024-11-22 18:00:05,467 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-22 18:00:05,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 760 conditions, 648 events. 59/648 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3423 event pairs, 31 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 707. Up to 89 conditions per place. [2024-11-22 18:00:05,474 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 18 selfloop transitions, 2 changer transitions 0/258 dead transitions. [2024-11-22 18:00:05,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 258 transitions, 564 flow [2024-11-22 18:00:05,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:05,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 762 transitions. [2024-11-22 18:00:05,482 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9169675090252708 [2024-11-22 18:00:05,482 INFO L175 Difference]: Start difference. First operand has 257 places, 259 transitions, 526 flow. Second operand 3 states and 762 transitions. [2024-11-22 18:00:05,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 258 transitions, 564 flow [2024-11-22 18:00:05,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 258 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:05,487 INFO L231 Difference]: Finished difference. Result has 256 places, 258 transitions, 524 flow [2024-11-22 18:00:05,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=520, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=256, PETRI_TRANSITIONS=258} [2024-11-22 18:00:05,490 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -7 predicate places. [2024-11-22 18:00:05,490 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 258 transitions, 524 flow [2024-11-22 18:00:05,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-11-22 18:00:05,491 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:05,491 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] [2024-11-22 18:00:05,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:00:05,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:05,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:05,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1110333792, now seen corresponding path program 1 times [2024-11-22 18:00:05,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:05,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198700883] [2024-11-22 18:00:05,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:05,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:05,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:05,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198700883] [2024-11-22 18:00:05,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198700883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:05,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:05,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:05,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430050855] [2024-11-22 18:00:05,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:05,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:05,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:05,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:05,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:05,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 277 [2024-11-22 18:00:05,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 258 transitions, 524 flow. Second operand has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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-11-22 18:00:05,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:05,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 277 [2024-11-22 18:00:05,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:05,735 INFO L124 PetriNetUnfolderBase]: 125/1218 cut-off events. [2024-11-22 18:00:05,736 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-22 18:00:05,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 1218 events. 125/1218 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7634 event pairs, 54 based on Foata normal form. 0/1017 useless extension candidates. Maximal degree in co-relation 1372. Up to 170 conditions per place. [2024-11-22 18:00:05,743 INFO L140 encePairwiseOnDemand]: 266/277 looper letters, 23 selfloop transitions, 5 changer transitions 0/259 dead transitions. [2024-11-22 18:00:05,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 259 transitions, 584 flow [2024-11-22 18:00:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2024-11-22 18:00:05,745 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.910950661853189 [2024-11-22 18:00:05,745 INFO L175 Difference]: Start difference. First operand has 256 places, 258 transitions, 524 flow. Second operand 3 states and 757 transitions. [2024-11-22 18:00:05,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 259 transitions, 584 flow [2024-11-22 18:00:05,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 259 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:05,749 INFO L231 Difference]: Finished difference. Result has 253 places, 256 transitions, 544 flow [2024-11-22 18:00:05,749 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=544, PETRI_PLACES=253, PETRI_TRANSITIONS=256} [2024-11-22 18:00:05,750 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -10 predicate places. [2024-11-22 18:00:05,750 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 256 transitions, 544 flow [2024-11-22 18:00:05,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.0) internal successors, (726), 3 states have internal predecessors, (726), 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-11-22 18:00:05,751 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:05,751 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] [2024-11-22 18:00:05,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:00:05,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:05,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:05,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1741134985, now seen corresponding path program 1 times [2024-11-22 18:00:05,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:05,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786266072] [2024-11-22 18:00:05,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:05,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:05,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:05,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:05,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786266072] [2024-11-22 18:00:05,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786266072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:05,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:05,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:05,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368869569] [2024-11-22 18:00:05,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:05,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:05,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:05,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:05,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:05,832 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 277 [2024-11-22 18:00:05,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 256 transitions, 544 flow. Second operand has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 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-11-22 18:00:05,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:05,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 277 [2024-11-22 18:00:05,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:05,924 INFO L124 PetriNetUnfolderBase]: 79/1078 cut-off events. [2024-11-22 18:00:05,924 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-22 18:00:05,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 1078 events. 79/1078 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6039 event pairs, 24 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 1038. Up to 82 conditions per place. [2024-11-22 18:00:05,931 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 15 selfloop transitions, 2 changer transitions 0/255 dead transitions. [2024-11-22 18:00:05,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 255 transitions, 576 flow [2024-11-22 18:00:05,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 768 transitions. [2024-11-22 18:00:05,933 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.924187725631769 [2024-11-22 18:00:05,933 INFO L175 Difference]: Start difference. First operand has 253 places, 256 transitions, 544 flow. Second operand 3 states and 768 transitions. [2024-11-22 18:00:05,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 255 transitions, 576 flow [2024-11-22 18:00:05,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 255 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:05,937 INFO L231 Difference]: Finished difference. Result has 252 places, 255 transitions, 536 flow [2024-11-22 18:00:05,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=532, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=252, PETRI_TRANSITIONS=255} [2024-11-22 18:00:05,939 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -11 predicate places. [2024-11-22 18:00:05,939 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 255 transitions, 536 flow [2024-11-22 18:00:05,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 251.33333333333334) internal successors, (754), 3 states have internal predecessors, (754), 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-11-22 18:00:05,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:05,940 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] [2024-11-22 18:00:05,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:00:05,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:05,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:05,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1643693868, now seen corresponding path program 1 times [2024-11-22 18:00:05,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331438701] [2024-11-22 18:00:05,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:05,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:05,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-11-22 18:00:05,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:05,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331438701] [2024-11-22 18:00:05,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331438701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:05,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:05,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:05,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75514044] [2024-11-22 18:00:05,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:05,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:05,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:05,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:05,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:06,009 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 277 [2024-11-22 18:00:06,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 255 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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-11-22 18:00:06,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:06,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 277 [2024-11-22 18:00:06,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:06,090 INFO L124 PetriNetUnfolderBase]: 63/839 cut-off events. [2024-11-22 18:00:06,090 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-22 18:00:06,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 839 events. 63/839 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4004 event pairs, 22 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 887. Up to 69 conditions per place. [2024-11-22 18:00:06,094 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 13 selfloop transitions, 2 changer transitions 0/254 dead transitions. [2024-11-22 18:00:06,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 254 transitions, 564 flow [2024-11-22 18:00:06,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:06,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2024-11-22 18:00:06,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9253910950661853 [2024-11-22 18:00:06,096 INFO L175 Difference]: Start difference. First operand has 252 places, 255 transitions, 536 flow. Second operand 3 states and 769 transitions. [2024-11-22 18:00:06,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 254 transitions, 564 flow [2024-11-22 18:00:06,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 254 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:06,099 INFO L231 Difference]: Finished difference. Result has 251 places, 254 transitions, 534 flow [2024-11-22 18:00:06,099 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=254, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=534, PETRI_PLACES=251, PETRI_TRANSITIONS=254} [2024-11-22 18:00:06,099 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -12 predicate places. [2024-11-22 18:00:06,100 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 254 transitions, 534 flow [2024-11-22 18:00:06,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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-11-22 18:00:06,100 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:06,100 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] [2024-11-22 18:00:06,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:00:06,100 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:06,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:06,101 INFO L85 PathProgramCache]: Analyzing trace with hash 331128094, now seen corresponding path program 1 times [2024-11-22 18:00:06,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:06,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117355340] [2024-11-22 18:00:06,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:06,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:06,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:06,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117355340] [2024-11-22 18:00:06,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117355340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:06,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:06,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:06,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059080074] [2024-11-22 18:00:06,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:06,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:06,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:06,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:06,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:06,157 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 277 [2024-11-22 18:00:06,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 254 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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-11-22 18:00:06,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:06,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 277 [2024-11-22 18:00:06,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:06,225 INFO L124 PetriNetUnfolderBase]: 68/918 cut-off events. [2024-11-22 18:00:06,226 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-22 18:00:06,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 918 events. 68/918 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4605 event pairs, 22 based on Foata normal form. 0/774 useless extension candidates. Maximal degree in co-relation 961. Up to 71 conditions per place. [2024-11-22 18:00:06,231 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 13 selfloop transitions, 2 changer transitions 0/253 dead transitions. [2024-11-22 18:00:06,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 253 transitions, 562 flow [2024-11-22 18:00:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2024-11-22 18:00:06,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9253910950661853 [2024-11-22 18:00:06,233 INFO L175 Difference]: Start difference. First operand has 251 places, 254 transitions, 534 flow. Second operand 3 states and 769 transitions. [2024-11-22 18:00:06,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 253 transitions, 562 flow [2024-11-22 18:00:06,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 253 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:06,237 INFO L231 Difference]: Finished difference. Result has 250 places, 253 transitions, 532 flow [2024-11-22 18:00:06,237 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=250, PETRI_TRANSITIONS=253} [2024-11-22 18:00:06,237 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -13 predicate places. [2024-11-22 18:00:06,238 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 253 transitions, 532 flow [2024-11-22 18:00:06,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.33333333333334) internal successors, (757), 3 states have internal predecessors, (757), 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-11-22 18:00:06,238 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:06,238 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, 1, 1, 1, 1, 1, 1] [2024-11-22 18:00:06,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:00:06,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:06,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash -59739466, now seen corresponding path program 1 times [2024-11-22 18:00:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:06,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512096550] [2024-11-22 18:00:06,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:06,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:06,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-11-22 18:00:06,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:06,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512096550] [2024-11-22 18:00:06,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512096550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:06,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:06,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:06,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610274069] [2024-11-22 18:00:06,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:06,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:06,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:06,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:06,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:06,307 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 277 [2024-11-22 18:00:06,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 253 transitions, 532 flow. Second operand has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 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-11-22 18:00:06,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:06,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 277 [2024-11-22 18:00:06,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:06,418 INFO L124 PetriNetUnfolderBase]: 110/1251 cut-off events. [2024-11-22 18:00:06,419 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-22 18:00:06,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1457 conditions, 1251 events. 110/1251 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7194 event pairs, 20 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 1378. Up to 87 conditions per place. [2024-11-22 18:00:06,424 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 19 selfloop transitions, 4 changer transitions 0/263 dead transitions. [2024-11-22 18:00:06,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 263 transitions, 601 flow [2024-11-22 18:00:06,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:06,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 789 transitions. [2024-11-22 18:00:06,426 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9494584837545126 [2024-11-22 18:00:06,427 INFO L175 Difference]: Start difference. First operand has 250 places, 253 transitions, 532 flow. Second operand 3 states and 789 transitions. [2024-11-22 18:00:06,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 263 transitions, 601 flow [2024-11-22 18:00:06,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 263 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:06,430 INFO L231 Difference]: Finished difference. Result has 252 places, 257 transitions, 562 flow [2024-11-22 18:00:06,430 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=252, PETRI_TRANSITIONS=257} [2024-11-22 18:00:06,431 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -11 predicate places. [2024-11-22 18:00:06,431 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 257 transitions, 562 flow [2024-11-22 18:00:06,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 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-11-22 18:00:06,432 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:06,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:00:06,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 18:00:06,432 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:06,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:06,432 INFO L85 PathProgramCache]: Analyzing trace with hash 486102649, now seen corresponding path program 1 times [2024-11-22 18:00:06,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:06,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766518417] [2024-11-22 18:00:06,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:06,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:06,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:06,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766518417] [2024-11-22 18:00:06,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766518417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:06,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:06,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:06,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234478491] [2024-11-22 18:00:06,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:06,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:06,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:06,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:06,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:06,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 277 [2024-11-22 18:00:06,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 257 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 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-11-22 18:00:06,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:06,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 277 [2024-11-22 18:00:06,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:06,626 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][247], [271#true, 298#true, 76#L762-4true, Black: 295#(= |#race~send~0| 0), Black: 279#true, 215#L726-3true, 293#true, 258#L750-2true]) [2024-11-22 18:00:06,626 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-22 18:00:06,626 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-11-22 18:00:06,626 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-22 18:00:06,626 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2024-11-22 18:00:06,631 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][247], [136#L763-1true, 271#true, 298#true, Black: 295#(= |#race~send~0| 0), Black: 279#true, 293#true, 258#L750-2true]) [2024-11-22 18:00:06,654 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-11-22 18:00:06,654 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2024-11-22 18:00:06,654 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-22 18:00:06,654 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-22 18:00:06,695 INFO L124 PetriNetUnfolderBase]: 217/2261 cut-off events. [2024-11-22 18:00:06,695 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2024-11-22 18:00:06,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2699 conditions, 2261 events. 217/2261 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 16421 event pairs, 41 based on Foata normal form. 0/1899 useless extension candidates. Maximal degree in co-relation 2483. Up to 161 conditions per place. [2024-11-22 18:00:06,706 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 18 selfloop transitions, 4 changer transitions 0/266 dead transitions. [2024-11-22 18:00:06,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 266 transitions, 625 flow [2024-11-22 18:00:06,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:06,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:06,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2024-11-22 18:00:06,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9482551143200962 [2024-11-22 18:00:06,708 INFO L175 Difference]: Start difference. First operand has 252 places, 257 transitions, 562 flow. Second operand 3 states and 788 transitions. [2024-11-22 18:00:06,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 266 transitions, 625 flow [2024-11-22 18:00:06,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 266 transitions, 617 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:06,713 INFO L231 Difference]: Finished difference. Result has 254 places, 261 transitions, 588 flow [2024-11-22 18:00:06,713 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=254, PETRI_TRANSITIONS=261} [2024-11-22 18:00:06,714 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -9 predicate places. [2024-11-22 18:00:06,714 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 261 transitions, 588 flow [2024-11-22 18:00:06,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 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-11-22 18:00:06,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:06,715 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:00:06,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 18:00:06,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:06,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:06,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1559625484, now seen corresponding path program 1 times [2024-11-22 18:00:06,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:06,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376219766] [2024-11-22 18:00:06,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:06,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:06,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:06,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:06,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376219766] [2024-11-22 18:00:06,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376219766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:06,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:06,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:06,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071194686] [2024-11-22 18:00:06,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:06,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:06,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:06,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:06,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:06,768 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 277 [2024-11-22 18:00:06,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 261 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 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-11-22 18:00:06,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:06,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 277 [2024-11-22 18:00:06,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:07,138 INFO L124 PetriNetUnfolderBase]: 464/4095 cut-off events. [2024-11-22 18:00:07,138 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2024-11-22 18:00:07,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5082 conditions, 4095 events. 464/4095 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 38327 event pairs, 115 based on Foata normal form. 0/3529 useless extension candidates. Maximal degree in co-relation 4787. Up to 523 conditions per place. [2024-11-22 18:00:07,160 INFO L140 encePairwiseOnDemand]: 270/277 looper letters, 24 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2024-11-22 18:00:07,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 264 transitions, 649 flow [2024-11-22 18:00:07,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:07,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 766 transitions. [2024-11-22 18:00:07,162 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9217809867629362 [2024-11-22 18:00:07,162 INFO L175 Difference]: Start difference. First operand has 254 places, 261 transitions, 588 flow. Second operand 3 states and 766 transitions. [2024-11-22 18:00:07,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 264 transitions, 649 flow [2024-11-22 18:00:07,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 264 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:07,168 INFO L231 Difference]: Finished difference. Result has 250 places, 258 transitions, 584 flow [2024-11-22 18:00:07,168 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=250, PETRI_TRANSITIONS=258} [2024-11-22 18:00:07,169 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -13 predicate places. [2024-11-22 18:00:07,170 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 258 transitions, 584 flow [2024-11-22 18:00:07,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.66666666666666) internal successors, (740), 3 states have internal predecessors, (740), 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-11-22 18:00:07,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:07,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:00:07,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:00:07,171 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:07,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:07,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1447508622, now seen corresponding path program 1 times [2024-11-22 18:00:07,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:07,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128148083] [2024-11-22 18:00:07,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:07,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:07,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:07,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128148083] [2024-11-22 18:00:07,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128148083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:07,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:07,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:07,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686908659] [2024-11-22 18:00:07,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:07,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:07,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:07,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:07,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:07,230 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 277 [2024-11-22 18:00:07,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 258 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 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-11-22 18:00:07,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:07,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 277 [2024-11-22 18:00:07,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:07,709 INFO L124 PetriNetUnfolderBase]: 668/5213 cut-off events. [2024-11-22 18:00:07,709 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2024-11-22 18:00:07,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6686 conditions, 5213 events. 668/5213 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 49686 event pairs, 119 based on Foata normal form. 0/4602 useless extension candidates. Maximal degree in co-relation 6429. Up to 598 conditions per place. [2024-11-22 18:00:07,738 INFO L140 encePairwiseOnDemand]: 270/277 looper letters, 18 selfloop transitions, 4 changer transitions 0/262 dead transitions. [2024-11-22 18:00:07,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 262 transitions, 637 flow [2024-11-22 18:00:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2024-11-22 18:00:07,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9326113116726835 [2024-11-22 18:00:07,741 INFO L175 Difference]: Start difference. First operand has 250 places, 258 transitions, 584 flow. Second operand 3 states and 775 transitions. [2024-11-22 18:00:07,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 262 transitions, 637 flow [2024-11-22 18:00:07,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 262 transitions, 637 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 18:00:07,745 INFO L231 Difference]: Finished difference. Result has 250 places, 257 transitions, 598 flow [2024-11-22 18:00:07,745 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=250, PETRI_TRANSITIONS=257} [2024-11-22 18:00:07,746 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -13 predicate places. [2024-11-22 18:00:07,746 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 257 transitions, 598 flow [2024-11-22 18:00:07,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 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-11-22 18:00:07,747 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:07,747 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, 1, 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-11-22 18:00:07,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:00:07,747 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:07,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:07,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1411252574, now seen corresponding path program 1 times [2024-11-22 18:00:07,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:07,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108168821] [2024-11-22 18:00:07,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:07,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:07,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:07,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108168821] [2024-11-22 18:00:07,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108168821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:07,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:07,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:00:07,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892299948] [2024-11-22 18:00:07,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:07,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:07,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:07,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:07,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:07,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 277 [2024-11-22 18:00:07,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 257 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 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-11-22 18:00:07,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:07,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 277 [2024-11-22 18:00:07,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:08,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [271#true, Black: 303#true, Black: 307#true, 309#(= |#race~first~0| 0), 76#L762-4true, Black: 295#(= |#race~send~0| 0), Black: 279#true, 215#L726-3true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), 311#true, 258#L750-2true]) [2024-11-22 18:00:08,268 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-22 18:00:08,269 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-22 18:00:08,269 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-22 18:00:08,269 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-22 18:00:08,286 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [136#L763-1true, 271#true, Black: 303#true, Black: 307#true, 309#(= |#race~first~0| 0), Black: 295#(= |#race~send~0| 0), Black: 279#true, 311#true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), 258#L750-2true]) [2024-11-22 18:00:08,286 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-22 18:00:08,286 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-22 18:00:08,286 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-22 18:00:08,287 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-22 18:00:08,440 INFO L124 PetriNetUnfolderBase]: 685/4850 cut-off events. [2024-11-22 18:00:08,442 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-11-22 18:00:08,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6512 conditions, 4850 events. 685/4850 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 45029 event pairs, 291 based on Foata normal form. 0/4248 useless extension candidates. Maximal degree in co-relation 6198. Up to 816 conditions per place. [2024-11-22 18:00:08,467 INFO L140 encePairwiseOnDemand]: 273/277 looper letters, 18 selfloop transitions, 3 changer transitions 0/261 dead transitions. [2024-11-22 18:00:08,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 261 transitions, 650 flow [2024-11-22 18:00:08,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:08,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2024-11-22 18:00:08,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9326113116726835 [2024-11-22 18:00:08,470 INFO L175 Difference]: Start difference. First operand has 250 places, 257 transitions, 598 flow. Second operand 3 states and 775 transitions. [2024-11-22 18:00:08,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 261 transitions, 650 flow [2024-11-22 18:00:08,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 261 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 18:00:08,474 INFO L231 Difference]: Finished difference. Result has 253 places, 258 transitions, 612 flow [2024-11-22 18:00:08,475 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=253, PETRI_TRANSITIONS=258} [2024-11-22 18:00:08,475 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -10 predicate places. [2024-11-22 18:00:08,475 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 258 transitions, 612 flow [2024-11-22 18:00:08,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 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-11-22 18:00:08,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:08,476 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, 1, 1, 1, 1, 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-11-22 18:00:08,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 18:00:08,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:08,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:08,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1222518191, now seen corresponding path program 1 times [2024-11-22 18:00:08,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:08,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288216948] [2024-11-22 18:00:08,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:08,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:08,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:08,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:08,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288216948] [2024-11-22 18:00:08,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288216948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:08,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:08,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:08,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857228397] [2024-11-22 18:00:08,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:08,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:08,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:08,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:08,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:08,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 277 [2024-11-22 18:00:08,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 258 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 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-11-22 18:00:08,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:08,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 277 [2024-11-22 18:00:08,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:09,220 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [316#true, Black: 295#(= |#race~send~0| 0), 215#L726-3true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), 311#true, Black: 303#true, 271#true, Black: 307#true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-22 18:00:09,221 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-22 18:00:09,221 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-22 18:00:09,221 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-22 18:00:09,221 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-22 18:00:09,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [136#L763-1true, Black: 303#true, 271#true, 316#true, Black: 307#true, Black: 295#(= |#race~send~0| 0), Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), 311#true, 258#L750-2true]) [2024-11-22 18:00:09,250 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-22 18:00:09,250 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-22 18:00:09,250 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-22 18:00:09,250 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-22 18:00:09,351 INFO L124 PetriNetUnfolderBase]: 750/5301 cut-off events. [2024-11-22 18:00:09,351 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2024-11-22 18:00:09,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7199 conditions, 5301 events. 750/5301 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 51255 event pairs, 284 based on Foata normal form. 0/4692 useless extension candidates. Maximal degree in co-relation 6889. Up to 853 conditions per place. [2024-11-22 18:00:09,381 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 21 selfloop transitions, 4 changer transitions 0/264 dead transitions. [2024-11-22 18:00:09,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 264 transitions, 676 flow [2024-11-22 18:00:09,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:09,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2024-11-22 18:00:09,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9302045728038508 [2024-11-22 18:00:09,387 INFO L175 Difference]: Start difference. First operand has 253 places, 258 transitions, 612 flow. Second operand 3 states and 773 transitions. [2024-11-22 18:00:09,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 264 transitions, 676 flow [2024-11-22 18:00:09,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 264 transitions, 670 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:09,394 INFO L231 Difference]: Finished difference. Result has 255 places, 261 transitions, 636 flow [2024-11-22 18:00:09,394 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=255, PETRI_TRANSITIONS=261} [2024-11-22 18:00:09,394 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -8 predicate places. [2024-11-22 18:00:09,395 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 261 transitions, 636 flow [2024-11-22 18:00:09,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 252.0) internal successors, (756), 3 states have internal predecessors, (756), 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-11-22 18:00:09,395 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:09,395 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, 1, 1, 1, 1, 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-11-22 18:00:09,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 18:00:09,396 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:09,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:09,396 INFO L85 PathProgramCache]: Analyzing trace with hash -525669491, now seen corresponding path program 1 times [2024-11-22 18:00:09,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:09,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628800646] [2024-11-22 18:00:09,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:09,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:09,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:09,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:09,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628800646] [2024-11-22 18:00:09,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628800646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:09,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:09,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:00:09,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653817650] [2024-11-22 18:00:09,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:09,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:09,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:09,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:09,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:09,446 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 277 [2024-11-22 18:00:09,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 261 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 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-11-22 18:00:09,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:09,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 277 [2024-11-22 18:00:09,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:10,084 INFO L124 PetriNetUnfolderBase]: 759/5667 cut-off events. [2024-11-22 18:00:10,085 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2024-11-22 18:00:10,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7851 conditions, 5667 events. 759/5667 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 54598 event pairs, 306 based on Foata normal form. 0/5018 useless extension candidates. Maximal degree in co-relation 7581. Up to 945 conditions per place. [2024-11-22 18:00:10,120 INFO L140 encePairwiseOnDemand]: 273/277 looper letters, 18 selfloop transitions, 3 changer transitions 0/264 dead transitions. [2024-11-22 18:00:10,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 264 transitions, 683 flow [2024-11-22 18:00:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:10,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:10,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 775 transitions. [2024-11-22 18:00:10,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9326113116726835 [2024-11-22 18:00:10,124 INFO L175 Difference]: Start difference. First operand has 255 places, 261 transitions, 636 flow. Second operand 3 states and 775 transitions. [2024-11-22 18:00:10,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 264 transitions, 683 flow [2024-11-22 18:00:10,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 264 transitions, 673 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:10,130 INFO L231 Difference]: Finished difference. Result has 257 places, 261 transitions, 640 flow [2024-11-22 18:00:10,130 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=640, PETRI_PLACES=257, PETRI_TRANSITIONS=261} [2024-11-22 18:00:10,131 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -6 predicate places. [2024-11-22 18:00:10,132 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 261 transitions, 640 flow [2024-11-22 18:00:10,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 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-11-22 18:00:10,132 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:10,132 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, 1, 1, 1, 1, 1, 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-11-22 18:00:10,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 18:00:10,133 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:10,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:10,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1667446457, now seen corresponding path program 1 times [2024-11-22 18:00:10,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:10,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062099181] [2024-11-22 18:00:10,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:10,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:10,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:10,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062099181] [2024-11-22 18:00:10,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062099181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:10,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:10,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:10,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322125212] [2024-11-22 18:00:10,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:10,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:10,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:10,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:10,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:10,195 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-22 18:00:10,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 261 transitions, 640 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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-11-22 18:00:10,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:10,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-22 18:00:10,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:10,645 INFO L124 PetriNetUnfolderBase]: 521/4516 cut-off events. [2024-11-22 18:00:10,645 INFO L125 PetriNetUnfolderBase]: For 231/295 co-relation queries the response was YES. [2024-11-22 18:00:10,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6263 conditions, 4516 events. 521/4516 cut-off events. For 231/295 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 41178 event pairs, 169 based on Foata normal form. 1/4058 useless extension candidates. Maximal degree in co-relation 5962. Up to 614 conditions per place. [2024-11-22 18:00:10,668 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 19 selfloop transitions, 5 changer transitions 0/267 dead transitions. [2024-11-22 18:00:10,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 267 transitions, 704 flow [2024-11-22 18:00:10,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:10,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:10,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 781 transitions. [2024-11-22 18:00:10,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9398315282791817 [2024-11-22 18:00:10,670 INFO L175 Difference]: Start difference. First operand has 257 places, 261 transitions, 640 flow. Second operand 3 states and 781 transitions. [2024-11-22 18:00:10,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 267 transitions, 704 flow [2024-11-22 18:00:10,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 267 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:10,675 INFO L231 Difference]: Finished difference. Result has 259 places, 264 transitions, 670 flow [2024-11-22 18:00:10,676 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=259, PETRI_TRANSITIONS=264} [2024-11-22 18:00:10,676 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -4 predicate places. [2024-11-22 18:00:10,676 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 264 transitions, 670 flow [2024-11-22 18:00:10,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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-11-22 18:00:10,677 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:10,677 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, 1, 1, 1, 1, 1, 1, 1, 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-11-22 18:00:10,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 18:00:10,677 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:10,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:10,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1780176859, now seen corresponding path program 1 times [2024-11-22 18:00:10,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:10,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907461164] [2024-11-22 18:00:10,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:10,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:10,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:10,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:10,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907461164] [2024-11-22 18:00:10,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907461164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:10,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:10,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:10,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246890877] [2024-11-22 18:00:10,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:10,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:10,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:10,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:10,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:10,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-22 18:00:10,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 264 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 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-11-22 18:00:10,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:10,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-22 18:00:10,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:11,307 INFO L124 PetriNetUnfolderBase]: 666/5678 cut-off events. [2024-11-22 18:00:11,307 INFO L125 PetriNetUnfolderBase]: For 377/382 co-relation queries the response was YES. [2024-11-22 18:00:11,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8004 conditions, 5678 events. 666/5678 cut-off events. For 377/382 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 55416 event pairs, 200 based on Foata normal form. 1/5116 useless extension candidates. Maximal degree in co-relation 7724. Up to 765 conditions per place. [2024-11-22 18:00:11,331 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 19 selfloop transitions, 5 changer transitions 0/270 dead transitions. [2024-11-22 18:00:11,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 270 transitions, 733 flow [2024-11-22 18:00:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:11,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 781 transitions. [2024-11-22 18:00:11,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9398315282791817 [2024-11-22 18:00:11,333 INFO L175 Difference]: Start difference. First operand has 259 places, 264 transitions, 670 flow. Second operand 3 states and 781 transitions. [2024-11-22 18:00:11,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 270 transitions, 733 flow [2024-11-22 18:00:11,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 270 transitions, 721 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:11,340 INFO L231 Difference]: Finished difference. Result has 261 places, 267 transitions, 694 flow [2024-11-22 18:00:11,341 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=261, PETRI_TRANSITIONS=267} [2024-11-22 18:00:11,342 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -2 predicate places. [2024-11-22 18:00:11,342 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 267 transitions, 694 flow [2024-11-22 18:00:11,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.66666666666666) internal successors, (767), 3 states have internal predecessors, (767), 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-11-22 18:00:11,342 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:11,342 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 18:00:11,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 18:00:11,343 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:11,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:11,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1436557164, now seen corresponding path program 1 times [2024-11-22 18:00:11,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:11,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040092633] [2024-11-22 18:00:11,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:11,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:11,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:11,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:11,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040092633] [2024-11-22 18:00:11,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040092633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:11,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:11,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:11,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974395342] [2024-11-22 18:00:11,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:11,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:11,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:11,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:11,414 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 277 [2024-11-22 18:00:11,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 267 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 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-11-22 18:00:11,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:11,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 277 [2024-11-22 18:00:11,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:11,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 336#true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 215#L726-3true, 331#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 271#true, Black: 307#true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-22 18:00:11,845 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-22 18:00:11,845 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-22 18:00:11,845 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-22 18:00:11,845 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-22 18:00:11,870 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 336#true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 331#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 136#L763-1true, Black: 303#true, 271#true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-22 18:00:11,870 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-22 18:00:11,870 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-22 18:00:11,870 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-22 18:00:11,870 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-22 18:00:11,958 INFO L124 PetriNetUnfolderBase]: 707/6116 cut-off events. [2024-11-22 18:00:11,959 INFO L125 PetriNetUnfolderBase]: For 433/437 co-relation queries the response was YES. [2024-11-22 18:00:11,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8704 conditions, 6116 events. 707/6116 cut-off events. For 433/437 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 61220 event pairs, 243 based on Foata normal form. 0/5564 useless extension candidates. Maximal degree in co-relation 8429. Up to 869 conditions per place. [2024-11-22 18:00:11,996 INFO L140 encePairwiseOnDemand]: 274/277 looper letters, 19 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-11-22 18:00:11,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 269 transitions, 741 flow [2024-11-22 18:00:11,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 771 transitions. [2024-11-22 18:00:11,998 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.927797833935018 [2024-11-22 18:00:11,998 INFO L175 Difference]: Start difference. First operand has 261 places, 267 transitions, 694 flow. Second operand 3 states and 771 transitions. [2024-11-22 18:00:11,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 269 transitions, 741 flow [2024-11-22 18:00:12,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 269 transitions, 729 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:12,006 INFO L231 Difference]: Finished difference. Result has 260 places, 266 transitions, 684 flow [2024-11-22 18:00:12,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=260, PETRI_TRANSITIONS=266} [2024-11-22 18:00:12,007 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -3 predicate places. [2024-11-22 18:00:12,007 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 266 transitions, 684 flow [2024-11-22 18:00:12,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.33333333333334) internal successors, (760), 3 states have internal predecessors, (760), 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-11-22 18:00:12,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:12,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 18:00:12,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 18:00:12,008 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:12,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:12,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2055462730, now seen corresponding path program 1 times [2024-11-22 18:00:12,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:12,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828805281] [2024-11-22 18:00:12,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:12,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:12,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:12,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828805281] [2024-11-22 18:00:12,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828805281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:12,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:12,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:12,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497748229] [2024-11-22 18:00:12,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:12,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:12,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:12,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:12,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:12,057 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-22 18:00:12,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 266 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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-11-22 18:00:12,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:12,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-22 18:00:12,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:12,605 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 336#true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 339#true, 215#L726-3true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 271#true, Black: 307#true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-22 18:00:12,605 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-22 18:00:12,605 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-22 18:00:12,605 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-22 18:00:12,605 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-22 18:00:12,641 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 336#true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 339#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 136#L763-1true, Black: 303#true, 271#true, Black: 307#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, 258#L750-2true]) [2024-11-22 18:00:12,641 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-22 18:00:12,641 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-22 18:00:12,641 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-22 18:00:12,641 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-22 18:00:12,781 INFO L124 PetriNetUnfolderBase]: 721/6192 cut-off events. [2024-11-22 18:00:12,781 INFO L125 PetriNetUnfolderBase]: For 694/719 co-relation queries the response was YES. [2024-11-22 18:00:12,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8906 conditions, 6192 events. 721/6192 cut-off events. For 694/719 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 61616 event pairs, 185 based on Foata normal form. 5/5618 useless extension candidates. Maximal degree in co-relation 8612. Up to 804 conditions per place. [2024-11-22 18:00:12,827 INFO L140 encePairwiseOnDemand]: 271/277 looper letters, 19 selfloop transitions, 9 changer transitions 0/275 dead transitions. [2024-11-22 18:00:12,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 275 transitions, 772 flow [2024-11-22 18:00:12,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:12,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2024-11-22 18:00:12,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.941034897713598 [2024-11-22 18:00:12,830 INFO L175 Difference]: Start difference. First operand has 260 places, 266 transitions, 684 flow. Second operand 3 states and 782 transitions. [2024-11-22 18:00:12,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 275 transitions, 772 flow [2024-11-22 18:00:12,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 275 transitions, 768 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:12,839 INFO L231 Difference]: Finished difference. Result has 262 places, 272 transitions, 754 flow [2024-11-22 18:00:12,840 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=262, PETRI_TRANSITIONS=272} [2024-11-22 18:00:12,840 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -1 predicate places. [2024-11-22 18:00:12,840 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 272 transitions, 754 flow [2024-11-22 18:00:12,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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-11-22 18:00:12,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:12,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 18:00:12,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 18:00:12,842 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1796013029, now seen corresponding path program 1 times [2024-11-22 18:00:12,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:12,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55686743] [2024-11-22 18:00:12,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:12,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:12,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:12,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55686743] [2024-11-22 18:00:12,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55686743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:12,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:12,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:12,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881642079] [2024-11-22 18:00:12,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:12,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:12,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:12,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:12,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:12,899 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-22 18:00:12,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 272 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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-11-22 18:00:12,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:12,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-22 18:00:12,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:13,154 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L707-2-->L707-3: Formula: (= |v_#race~buffer_size~0_4| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_4|} AuxVars[] AssignedVars[#race~buffer_size~0][165], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, 339#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, 271#true, Black: 303#true, 195#L695-7true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true]) [2024-11-22 18:00:13,155 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-22 18:00:13,155 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-22 18:00:13,155 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-22 18:00:13,155 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-22 18:00:13,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, 339#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, 271#true, Black: 303#true, 195#L695-7true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true]) [2024-11-22 18:00:13,203 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-22 18:00:13,203 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-22 18:00:13,203 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-22 18:00:13,203 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-22 18:00:13,203 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([760] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 339#true, 344#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, 271#true, Black: 303#true, 195#L695-7true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true]) [2024-11-22 18:00:13,203 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-22 18:00:13,203 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-22 18:00:13,203 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-22 18:00:13,203 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-22 18:00:13,204 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-22 18:00:13,217 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([657] L707-2-->L707-3: Formula: (= |v_#race~buffer_size~0_4| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_4|} AuxVars[] AssignedVars[#race~buffer_size~0][165], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, 339#true, Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, 271#true, Black: 303#true, 195#L695-7true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true]) [2024-11-22 18:00:13,218 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-22 18:00:13,218 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-22 18:00:13,218 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-22 18:00:13,218 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-22 18:00:13,218 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-22 18:00:13,686 INFO L124 PetriNetUnfolderBase]: 835/6437 cut-off events. [2024-11-22 18:00:13,687 INFO L125 PetriNetUnfolderBase]: For 1027/1063 co-relation queries the response was YES. [2024-11-22 18:00:13,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9613 conditions, 6437 events. 835/6437 cut-off events. For 1027/1063 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 64361 event pairs, 194 based on Foata normal form. 6/5832 useless extension candidates. Maximal degree in co-relation 9316. Up to 870 conditions per place. [2024-11-22 18:00:13,728 INFO L140 encePairwiseOnDemand]: 271/277 looper letters, 19 selfloop transitions, 9 changer transitions 0/281 dead transitions. [2024-11-22 18:00:13,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 281 transitions, 841 flow [2024-11-22 18:00:13,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 782 transitions. [2024-11-22 18:00:13,731 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.941034897713598 [2024-11-22 18:00:13,731 INFO L175 Difference]: Start difference. First operand has 262 places, 272 transitions, 754 flow. Second operand 3 states and 782 transitions. [2024-11-22 18:00:13,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 281 transitions, 841 flow [2024-11-22 18:00:13,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 281 transitions, 823 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:13,739 INFO L231 Difference]: Finished difference. Result has 264 places, 278 transitions, 810 flow [2024-11-22 18:00:13,740 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=264, PETRI_TRANSITIONS=278} [2024-11-22 18:00:13,740 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 1 predicate places. [2024-11-22 18:00:13,740 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 278 transitions, 810 flow [2024-11-22 18:00:13,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.33333333333334) internal successors, (766), 3 states have internal predecessors, (766), 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-11-22 18:00:13,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:13,741 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 18:00:13,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 18:00:13,741 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:13,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:13,741 INFO L85 PathProgramCache]: Analyzing trace with hash 974831784, now seen corresponding path program 1 times [2024-11-22 18:00:13,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:13,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692474634] [2024-11-22 18:00:13,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:13,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:13,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:13,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692474634] [2024-11-22 18:00:13,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692474634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:13,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:13,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:13,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536725291] [2024-11-22 18:00:13,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:13,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:13,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:13,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:13,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:13,848 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 247 out of 277 [2024-11-22 18:00:13,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 278 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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-11-22 18:00:13,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:13,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 277 [2024-11-22 18:00:13,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:14,337 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L727-->L727-1: Formula: (= |v_#race~send~0_4| 0) InVars {} OutVars{#race~send~0=|v_#race~send~0_4|} AuxVars[] AssignedVars[#race~send~0][219], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 248#L748-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, 263#L727-1true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 271#true, Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true]) [2024-11-22 18:00:14,337 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-22 18:00:14,337 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-22 18:00:14,337 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-22 18:00:14,338 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-22 18:00:14,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, 215#L726-3true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 271#true, Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true, 258#L750-2true]) [2024-11-22 18:00:14,482 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-22 18:00:14,482 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-22 18:00:14,482 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-22 18:00:14,482 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-22 18:00:14,519 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 136#L763-1true, 271#true, Black: 303#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true, 258#L750-2true]) [2024-11-22 18:00:14,519 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-22 18:00:14,519 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-22 18:00:14,519 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-22 18:00:14,519 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-22 18:00:14,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L731-2-->L731-3: Formula: (= |v_#race~receive~0_4| |v_t1Thread1of1ForFork0_#t~nondet14#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} OutVars{#race~receive~0=|v_#race~receive~0_4|, t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~receive~0][260], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 72#L731-3true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 295#(= |#race~send~0| 0), 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 344#true, 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 271#true, Black: 307#true, Black: 339#true, 76#L762-4true, 168#L747-3true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|)]) [2024-11-22 18:00:14,680 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2024-11-22 18:00:14,681 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-22 18:00:14,681 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-22 18:00:14,681 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-22 18:00:14,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([804] L748-2-->L748-3: Formula: (= |v_#race~send~0_10| |v_t2Thread1of1ForFork1_#t~nondet20#1_3|) InVars {t2Thread1of1ForFork1_#t~nondet20#1=|v_t2Thread1of1ForFork1_#t~nondet20#1_3|} OutVars{t2Thread1of1ForFork1_#t~nondet20#1=|v_t2Thread1of1ForFork1_#t~nondet20#1_3|, #race~send~0=|v_#race~send~0_10|} AuxVars[] AssignedVars[#race~send~0][251], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 88#L730-4true, Black: 295#(= |#race~send~0| 0), 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 21#L748-3true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 344#true]) [2024-11-22 18:00:14,689 INFO L294 olderBase$Statistics]: this new event has 222 ancestors and is cut-off event [2024-11-22 18:00:14,689 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-22 18:00:14,689 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-22 18:00:14,689 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-22 18:00:14,704 INFO L124 PetriNetUnfolderBase]: 1225/8602 cut-off events. [2024-11-22 18:00:14,705 INFO L125 PetriNetUnfolderBase]: For 1486/1546 co-relation queries the response was YES. [2024-11-22 18:00:14,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13466 conditions, 8602 events. 1225/8602 cut-off events. For 1486/1546 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 90297 event pairs, 360 based on Foata normal form. 6/7945 useless extension candidates. Maximal degree in co-relation 13122. Up to 1437 conditions per place. [2024-11-22 18:00:14,748 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 25 selfloop transitions, 5 changer transitions 0/285 dead transitions. [2024-11-22 18:00:14,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 285 transitions, 890 flow [2024-11-22 18:00:14,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:14,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:14,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 769 transitions. [2024-11-22 18:00:14,750 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9253910950661853 [2024-11-22 18:00:14,750 INFO L175 Difference]: Start difference. First operand has 264 places, 278 transitions, 810 flow. Second operand 3 states and 769 transitions. [2024-11-22 18:00:14,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 285 transitions, 890 flow [2024-11-22 18:00:14,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 285 transitions, 872 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:14,760 INFO L231 Difference]: Finished difference. Result has 266 places, 282 transitions, 834 flow [2024-11-22 18:00:14,760 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=266, PETRI_TRANSITIONS=282} [2024-11-22 18:00:14,760 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 3 predicate places. [2024-11-22 18:00:14,761 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 282 transitions, 834 flow [2024-11-22 18:00:14,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 250.66666666666666) internal successors, (752), 3 states have internal predecessors, (752), 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-11-22 18:00:14,761 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:14,761 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 18:00:14,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 18:00:14,761 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:14,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:14,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1916336386, now seen corresponding path program 1 times [2024-11-22 18:00:14,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:14,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493569884] [2024-11-22 18:00:14,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:14,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:14,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:14,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493569884] [2024-11-22 18:00:14,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493569884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:14,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:14,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:14,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961533815] [2024-11-22 18:00:14,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:14,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:14,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:14,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:14,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:14,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 277 [2024-11-22 18:00:14,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 282 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 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-11-22 18:00:14,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:14,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 277 [2024-11-22 18:00:14,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:15,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L707-2-->L707-3: Formula: (= |v_#race~buffer_size~0_4| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_4|} AuxVars[] AssignedVars[#race~buffer_size~0][165], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, 271#true, Black: 303#true, 195#L695-7true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true]) [2024-11-22 18:00:15,109 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-22 18:00:15,109 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-22 18:00:15,109 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-22 18:00:15,109 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-22 18:00:15,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([760] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 271#true, 195#L695-7true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true]) [2024-11-22 18:00:15,120 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-22 18:00:15,120 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-22 18:00:15,120 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-22 18:00:15,120 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-22 18:00:15,153 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([760] L695-6-->L695-7: Formula: (= |v_#race~buffer_size~0_16| 0) InVars {} OutVars{#race~buffer_size~0=|v_#race~buffer_size~0_16|} AuxVars[] AssignedVars[#race~buffer_size~0][171], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 298#true, 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 253#L707-3true, Black: 303#true, 271#true, 195#L695-7true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, 354#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|)]) [2024-11-22 18:00:15,153 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-22 18:00:15,153 INFO L297 olderBase$Statistics]: existing Event has 115 ancestors and is cut-off event [2024-11-22 18:00:15,153 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-22 18:00:15,153 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-22 18:00:15,153 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-22 18:00:15,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([640] L727-->L727-1: Formula: (= |v_#race~send~0_4| 0) InVars {} OutVars{#race~send~0=|v_#race~send~0_4|} AuxVars[] AssignedVars[#race~send~0][219], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 248#L748-4true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), Black: 293#true, 349#true, Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 263#L727-1true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true]) [2024-11-22 18:00:15,370 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-22 18:00:15,370 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-22 18:00:15,370 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-22 18:00:15,370 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-22 18:00:15,531 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 215#L726-3true, Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 76#L762-4true, 354#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), 258#L750-2true]) [2024-11-22 18:00:15,531 INFO L294 olderBase$Statistics]: this new event has 175 ancestors and is cut-off event [2024-11-22 18:00:15,531 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-22 18:00:15,531 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-11-22 18:00:15,531 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-22 18:00:15,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([741] L743-4-->L750-2: Formula: (and (= |v_t2Thread1of1ForFork1_#t~ret21#1_1| 0) (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_25| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_25|) |v_~#m~0.offset_25| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_25|, t2Thread1of1ForFork1_#t~ret21#1=|v_t2Thread1of1ForFork1_#t~ret21#1_1|, ~#m~0.offset=|v_~#m~0.offset_25|} AuxVars[] AssignedVars[#pthreadsMutex, t2Thread1of1ForFork1_#t~ret21#1][122], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 136#L763-1true, Black: 303#true, 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), 258#L750-2true]) [2024-11-22 18:00:15,588 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-22 18:00:15,588 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-11-22 18:00:15,588 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2024-11-22 18:00:15,588 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-22 18:00:15,648 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([804] L748-2-->L748-3: Formula: (= |v_#race~send~0_10| |v_t2Thread1of1ForFork1_#t~nondet20#1_3|) InVars {t2Thread1of1ForFork1_#t~nondet20#1=|v_t2Thread1of1ForFork1_#t~nondet20#1_3|} OutVars{t2Thread1of1ForFork1_#t~nondet20#1=|v_t2Thread1of1ForFork1_#t~nondet20#1_3|, #race~send~0=|v_#race~send~0_10|} AuxVars[] AssignedVars[#race~send~0][228], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 88#L730-4true, 349#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 271#true, Black: 307#true, Black: 341#(= |t1Thread1of1ForFork0_#t~nondet14#1| |#race~receive~0|), 354#true, 76#L762-4true, 21#L748-3true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 279#true, Black: 344#true]) [2024-11-22 18:00:15,649 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2024-11-22 18:00:15,649 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-22 18:00:15,649 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-22 18:00:15,649 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-22 18:00:15,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L731-2-->L731-3: Formula: (= |v_#race~receive~0_4| |v_t1Thread1of1ForFork0_#t~nondet14#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} OutVars{#race~receive~0=|v_#race~receive~0_4|, t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~receive~0][243], [Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), 72#L731-3true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), 305#(= |#race~buffer_size~0| 0), Black: 300#(= |#race~receive~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), Black: 303#true, 271#true, Black: 307#true, Black: 339#true, 354#true, 76#L762-4true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), 168#L747-3true, Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), Black: 279#true]) [2024-11-22 18:00:15,706 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2024-11-22 18:00:15,706 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-22 18:00:15,706 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-22 18:00:15,706 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2024-11-22 18:00:15,862 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([703] L731-2-->L731-3: Formula: (= |v_#race~receive~0_4| |v_t1Thread1of1ForFork0_#t~nondet14#1_3|) InVars {t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} OutVars{#race~receive~0=|v_#race~receive~0_4|, t1Thread1of1ForFork0_#t~nondet14#1=|v_t1Thread1of1ForFork0_#t~nondet14#1_3|} AuxVars[] AssignedVars[#race~receive~0][243], [Black: 351#(= |#race~next~0| |t1Thread1of1ForFork0_insertLogElement_#t~nondet10#1|), Black: 318#(or (and (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0 (- 4294967296))) |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1|) (<= 2147483648 (mod ~next~0 4294967296))) (and (= |t1Thread1of1ForFork0_insertLogElement_#t~nondet9#1| (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (* (div ~next~0 4294967296) (- 4294967296)) ~next~0))) (<= (mod ~next~0 4294967296) 2147483647))), 72#L731-3true, Black: 323#(not |t2Thread1of1ForFork1_removeLogElement_#t~short4#1|), 349#true, Black: 295#(= |#race~send~0| 0), Black: 328#(= |t1Thread1of1ForFork0_#t~nondet13#1| |#race~send~0|), Black: 300#(= |#race~receive~0| 0), 305#(= |#race~buffer_size~0| 0), Black: 333#(= |t2Thread1of1ForFork1_#t~nondet19#1| |#race~receive~0|), 271#true, Black: 303#true, Black: 339#true, Black: 307#true, 76#L762-4true, 168#L747-3true, Black: 313#(not |t1Thread1of1ForFork0_insertLogElement_#t~short8#1|), Black: 346#(= |t2Thread1of1ForFork1_#t~nondet20#1| |#race~send~0|), 356#(or (and (<= 2147483648 (mod (+ ~first~0 4294967295) 4294967296)) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| (- 1) ~first~0 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0)) (and (<= (mod (+ ~first~0 4294967295) 4294967296) 2147483647) (= (select (select |#race| |~#buffer~0.base|) (+ |~#buffer~0.offset| ~first~0 4294967295 (* (div (+ ~first~0 4294967295) 4294967296) (- 4294967296)))) 0))), Black: 279#true]) [2024-11-22 18:00:15,862 INFO L294 olderBase$Statistics]: this new event has 202 ancestors and is cut-off event [2024-11-22 18:00:15,862 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-22 18:00:15,862 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2024-11-22 18:00:15,862 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-11-22 18:00:15,911 INFO L124 PetriNetUnfolderBase]: 1164/10054 cut-off events. [2024-11-22 18:00:15,912 INFO L125 PetriNetUnfolderBase]: For 1892/2017 co-relation queries the response was YES. [2024-11-22 18:00:15,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15364 conditions, 10054 events. 1164/10054 cut-off events. For 1892/2017 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 112906 event pairs, 192 based on Foata normal form. 10/9264 useless extension candidates. Maximal degree in co-relation 15068. Up to 745 conditions per place. [2024-11-22 18:00:15,991 INFO L140 encePairwiseOnDemand]: 272/277 looper letters, 19 selfloop transitions, 5 changer transitions 0/290 dead transitions. [2024-11-22 18:00:15,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 290 transitions, 901 flow [2024-11-22 18:00:15,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:15,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 783 transitions. [2024-11-22 18:00:15,993 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9422382671480144 [2024-11-22 18:00:15,993 INFO L175 Difference]: Start difference. First operand has 266 places, 282 transitions, 834 flow. Second operand 3 states and 783 transitions. [2024-11-22 18:00:15,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 290 transitions, 901 flow [2024-11-22 18:00:16,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 290 transitions, 891 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:16,006 INFO L231 Difference]: Finished difference. Result has 268 places, 285 transitions, 860 flow [2024-11-22 18:00:16,006 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=268, PETRI_TRANSITIONS=285} [2024-11-22 18:00:16,007 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, 5 predicate places. [2024-11-22 18:00:16,007 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 285 transitions, 860 flow [2024-11-22 18:00:16,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 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-11-22 18:00:16,007 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:16,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-22 18:00:16,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 18:00:16,008 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-22 18:00:16,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash 678113696, now seen corresponding path program 1 times [2024-11-22 18:00:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:16,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503264876] [2024-11-22 18:00:16,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:16,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:00:16,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:16,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503264876] [2024-11-22 18:00:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503264876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:16,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:00:16,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914693891] [2024-11-22 18:00:16,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:16,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:16,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:16,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:16,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:16,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 277 [2024-11-22 18:00:16,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 285 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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-11-22 18:00:16,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:16,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 277 [2024-11-22 18:00:16,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:16,277 INFO L124 PetriNetUnfolderBase]: 151/1883 cut-off events. [2024-11-22 18:00:16,277 INFO L125 PetriNetUnfolderBase]: For 295/295 co-relation queries the response was YES. [2024-11-22 18:00:16,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2785 conditions, 1883 events. 151/1883 cut-off events. For 295/295 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 13723 event pairs, 17 based on Foata normal form. 40/1816 useless extension candidates. Maximal degree in co-relation 2100. Up to 98 conditions per place. [2024-11-22 18:00:16,283 INFO L140 encePairwiseOnDemand]: 273/277 looper letters, 0 selfloop transitions, 0 changer transitions 244/244 dead transitions. [2024-11-22 18:00:16,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 244 transitions, 669 flow [2024-11-22 18:00:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:16,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 790 transitions. [2024-11-22 18:00:16,284 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.950661853188929 [2024-11-22 18:00:16,284 INFO L175 Difference]: Start difference. First operand has 268 places, 285 transitions, 860 flow. Second operand 3 states and 790 transitions. [2024-11-22 18:00:16,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 244 transitions, 669 flow [2024-11-22 18:00:16,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 244 transitions, 585 flow, removed 21 selfloop flow, removed 16 redundant places. [2024-11-22 18:00:16,288 INFO L231 Difference]: Finished difference. Result has 244 places, 0 transitions, 0 flow [2024-11-22 18:00:16,289 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=277, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=244, PETRI_TRANSITIONS=0} [2024-11-22 18:00:16,289 INFO L277 CegarLoopForPetriNet]: 263 programPoint places, -19 predicate places. [2024-11-22 18:00:16,289 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 0 transitions, 0 flow [2024-11-22 18:00:16,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 261.0) internal successors, (783), 3 states have internal predecessors, (783), 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-11-22 18:00:16,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (53 of 54 remaining) [2024-11-22 18:00:16,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining) [2024-11-22 18:00:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining) [2024-11-22 18:00:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining) [2024-11-22 18:00:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining) [2024-11-22 18:00:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining) [2024-11-22 18:00:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 54 remaining) [2024-11-22 18:00:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 54 remaining) [2024-11-22 18:00:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining) [2024-11-22 18:00:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining) [2024-11-22 18:00:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining) [2024-11-22 18:00:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining) [2024-11-22 18:00:16,293 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (37 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (26 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (25 of 54 remaining) [2024-11-22 18:00:16,294 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining) [2024-11-22 18:00:16,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (23 of 54 remaining) [2024-11-22 18:00:16,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONDATA_RACE (22 of 54 remaining) [2024-11-22 18:00:16,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONDATA_RACE (21 of 54 remaining) [2024-11-22 18:00:16,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONDATA_RACE (20 of 54 remaining) [2024-11-22 18:00:16,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONDATA_RACE (19 of 54 remaining) [2024-11-22 18:00:16,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err4ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining) [2024-11-22 18:00:16,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err5ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining) [2024-11-22 18:00:16,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err6ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining) [2024-11-22 18:00:16,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err11ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining) [2024-11-22 18:00:16,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err7ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining) [2024-11-22 18:00:16,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err8ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining) [2024-11-22 18:00:16,295 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err12ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining) [2024-11-22 18:00:16,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err9ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining) [2024-11-22 18:00:16,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err10ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining) [2024-11-22 18:00:16,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining) [2024-11-22 18:00:16,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining) [2024-11-22 18:00:16,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining) [2024-11-22 18:00:16,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining) [2024-11-22 18:00:16,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err4ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining) [2024-11-22 18:00:16,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err5ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining) [2024-11-22 18:00:16,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err8ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining) [2024-11-22 18:00:16,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err6ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining) [2024-11-22 18:00:16,296 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err7ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining) [2024-11-22 18:00:16,297 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err9ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining) [2024-11-22 18:00:16,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 18:00:16,297 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:00:16,304 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 18:00:16,304 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 18:00:16,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 06:00:16 BasicIcfg [2024-11-22 18:00:16,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 18:00:16,309 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 18:00:16,309 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 18:00:16,309 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 18:00:16,310 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:00:04" (3/4) ... [2024-11-22 18:00:16,311 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 18:00:16,313 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t1 [2024-11-22 18:00:16,313 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure t2 [2024-11-22 18:00:16,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-22 18:00:16,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-22 18:00:16,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 18:00:16,317 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 18:00:16,391 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 18:00:16,392 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 18:00:16,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 18:00:16,392 INFO L158 Benchmark]: Toolchain (without parser) took 13117.97ms. Allocated memory was 180.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 149.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 141.7MB. Max. memory is 16.1GB. [2024-11-22 18:00:16,393 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 18:00:16,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.51ms. Allocated memory is still 180.4MB. Free memory was 149.0MB in the beginning and 128.2MB in the end (delta: 20.8MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. [2024-11-22 18:00:16,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.80ms. Allocated memory is still 180.4MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:00:16,393 INFO L158 Benchmark]: Boogie Preprocessor took 44.80ms. Allocated memory is still 180.4MB. Free memory was 126.1MB in the beginning and 124.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 18:00:16,393 INFO L158 Benchmark]: RCFGBuilder took 581.29ms. Allocated memory is still 180.4MB. Free memory was 124.0MB in the beginning and 98.1MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-22 18:00:16,393 INFO L158 Benchmark]: TraceAbstraction took 11892.83ms. Allocated memory was 180.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 97.6MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-11-22 18:00:16,393 INFO L158 Benchmark]: Witness Printer took 82.80ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 18:00:16,394 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 134.2MB. Free memory is still 98.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 460.51ms. Allocated memory is still 180.4MB. Free memory was 149.0MB in the beginning and 128.2MB in the end (delta: 20.8MB). Peak memory consumption was 23.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.80ms. Allocated memory is still 180.4MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.80ms. Allocated memory is still 180.4MB. Free memory was 126.1MB in the beginning and 124.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 581.29ms. Allocated memory is still 180.4MB. Free memory was 124.0MB in the beginning and 98.1MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11892.83ms. Allocated memory was 180.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 97.6MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. * Witness Printer took 82.80ms. Allocated memory is still 1.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 690]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 759]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 760]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 727]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 707]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 730]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 731]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 712]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 743]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 747]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 698]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 698]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 748]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 434 locations, 54 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.7s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 705 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 248 mSDsluCounter, 172 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 885 IncrementalHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 172 mSDtfsCounter, 885 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=20, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1915 NumberOfCodeBlocks, 1915 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1894 ConstructedInterpolants, 0 QuantifiedInterpolants, 2199 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-22 18:00:16,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE