./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/weaver/array-eq-trans.wvr.c -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 e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:56:04,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:56:04,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:56:04,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:56:04,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:56:04,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:56:04,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:56:04,437 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:56:04,437 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:56:04,437 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:56:04,438 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:56:04,438 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:56:04,438 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:56:04,439 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:56:04,439 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:56:04,439 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:56:04,439 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:56:04,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:56:04,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:56:04,440 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:56:04,440 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:56:04,448 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:56:04,448 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:56:04,449 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:56:04,449 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:56:04,449 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:56:04,449 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:56:04,449 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:56:04,450 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:56:04,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:56:04,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:56:04,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:56:04,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:56:04,451 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:56:04,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:56:04,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:56:04,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:56:04,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:56:04,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:56:04,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:56:04,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:56:04,453 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 -> e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe [2024-11-19 05:56:04,639 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:56:04,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:56:04,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:56:04,668 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:56:04,668 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:56:04,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2024-11-19 05:56:05,971 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:56:06,127 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:56:06,127 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2024-11-19 05:56:06,133 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6028688d8/363f2397f5ff4218b3a201cf7acede4d/FLAG32a35f2d7 [2024-11-19 05:56:06,145 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6028688d8/363f2397f5ff4218b3a201cf7acede4d [2024-11-19 05:56:06,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:56:06,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:56:06,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:56:06,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:56:06,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:56:06,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:56:06" (1/1) ... [2024-11-19 05:56:06,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@688e5118 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:06, skipping insertion in model container [2024-11-19 05:56:06,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:56:06" (1/1) ... [2024-11-19 05:56:06,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:56:06,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:56:06,404 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:56:06,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:56:06,469 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:56:06,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:06 WrapperNode [2024-11-19 05:56:06,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:56:06,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:56:06,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:56:06,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:56:06,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:06" (1/1) ... [2024-11-19 05:56:06,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:06" (1/1) ... [2024-11-19 05:56:06,523 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 11, calls inlined = 15, statements flattened = 325 [2024-11-19 05:56:06,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:56:06,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:56:06,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:56:06,524 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:56:06,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:06" (1/1) ... [2024-11-19 05:56:06,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:06" (1/1) ... [2024-11-19 05:56:06,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:06" (1/1) ... [2024-11-19 05:56:06,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:06" (1/1) ... [2024-11-19 05:56:06,562 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:06" (1/1) ... [2024-11-19 05:56:06,570 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:06" (1/1) ... [2024-11-19 05:56:06,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:06" (1/1) ... [2024-11-19 05:56:06,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:06" (1/1) ... [2024-11-19 05:56:06,583 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:56:06,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:56:06,591 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:56:06,591 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:56:06,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:06" (1/1) ... [2024-11-19 05:56:06,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:56:06,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:56:06,626 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-19 05:56:06,634 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-19 05:56:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:56:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:56:06,678 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:56:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:56:06,678 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:56:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:56:06,678 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:56:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:56:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:56:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:56:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:56:06,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:56:06,679 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:56:06,681 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:56:06,779 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:56:06,781 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:56:07,407 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:56:07,407 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:56:07,433 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:56:07,434 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 05:56:07,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:07 BoogieIcfgContainer [2024-11-19 05:56:07,434 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:56:07,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:56:07,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:56:07,439 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:56:07,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:56:06" (1/3) ... [2024-11-19 05:56:07,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b51b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:56:07, skipping insertion in model container [2024-11-19 05:56:07,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:06" (2/3) ... [2024-11-19 05:56:07,442 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b51b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:56:07, skipping insertion in model container [2024-11-19 05:56:07,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:07" (3/3) ... [2024-11-19 05:56:07,444 INFO L112 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2024-11-19 05:56:07,460 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:56:07,460 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2024-11-19 05:56:07,460 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:56:07,594 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:56:07,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 602 places, 625 transitions, 1271 flow [2024-11-19 05:56:07,787 INFO L124 PetriNetUnfolderBase]: 33/622 cut-off events. [2024-11-19 05:56:07,788 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:56:07,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 622 events. 33/622 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1409 event pairs, 0 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 371. Up to 3 conditions per place. [2024-11-19 05:56:07,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 602 places, 625 transitions, 1271 flow [2024-11-19 05:56:07,807 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 577 places, 597 transitions, 1212 flow [2024-11-19 05:56:07,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:56:07,821 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;@6706bc9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:56:07,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 117 error locations. [2024-11-19 05:56:07,827 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:56:07,827 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-19 05:56:07,827 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:56:07,828 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:07,828 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] [2024-11-19 05:56:07,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:07,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:07,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1762537566, now seen corresponding path program 1 times [2024-11-19 05:56:07,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:07,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829384233] [2024-11-19 05:56:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:07,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:08,012 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-19 05:56:08,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:08,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829384233] [2024-11-19 05:56:08,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829384233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:08,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:08,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:08,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602738553] [2024-11-19 05:56:08,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:08,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:08,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:08,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:08,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:08,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 625 [2024-11-19 05:56:08,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 597 transitions, 1212 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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-19 05:56:08,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:08,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 625 [2024-11-19 05:56:08,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:08,273 INFO L124 PetriNetUnfolderBase]: 30/787 cut-off events. [2024-11-19 05:56:08,274 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 05:56:08,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 836 conditions, 787 events. 30/787 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2557 event pairs, 5 based on Foata normal form. 30/670 useless extension candidates. Maximal degree in co-relation 440. Up to 28 conditions per place. [2024-11-19 05:56:08,287 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 14 selfloop transitions, 2 changer transitions 8/582 dead transitions. [2024-11-19 05:56:08,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 582 transitions, 1214 flow [2024-11-19 05:56:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:08,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2024-11-19 05:56:08,308 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621333333333333 [2024-11-19 05:56:08,310 INFO L175 Difference]: Start difference. First operand has 577 places, 597 transitions, 1212 flow. Second operand 3 states and 1804 transitions. [2024-11-19 05:56:08,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 582 transitions, 1214 flow [2024-11-19 05:56:08,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 582 transitions, 1202 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:56:08,326 INFO L231 Difference]: Finished difference. Result has 572 places, 574 transitions, 1158 flow [2024-11-19 05:56:08,329 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1170, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1158, PETRI_PLACES=572, PETRI_TRANSITIONS=574} [2024-11-19 05:56:08,332 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -5 predicate places. [2024-11-19 05:56:08,333 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 574 transitions, 1158 flow [2024-11-19 05:56:08,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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-19 05:56:08,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:08,335 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] [2024-11-19 05:56:08,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:56:08,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:08,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:08,336 INFO L85 PathProgramCache]: Analyzing trace with hash 687983715, now seen corresponding path program 1 times [2024-11-19 05:56:08,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:08,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627774524] [2024-11-19 05:56:08,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:08,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:08,387 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-19 05:56:08,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:08,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627774524] [2024-11-19 05:56:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627774524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:08,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:08,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:08,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568096420] [2024-11-19 05:56:08,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:08,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:08,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:08,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:08,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:08,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 625 [2024-11-19 05:56:08,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 574 transitions, 1158 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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-19 05:56:08,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:08,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 625 [2024-11-19 05:56:08,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:08,593 INFO L124 PetriNetUnfolderBase]: 38/919 cut-off events. [2024-11-19 05:56:08,594 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:56:08,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 919 events. 38/919 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3645 event pairs, 7 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 929. Up to 31 conditions per place. [2024-11-19 05:56:08,604 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 14 selfloop transitions, 2 changer transitions 0/573 dead transitions. [2024-11-19 05:56:08,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 573 transitions, 1188 flow [2024-11-19 05:56:08,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:08,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1790 transitions. [2024-11-19 05:56:08,610 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9546666666666667 [2024-11-19 05:56:08,610 INFO L175 Difference]: Start difference. First operand has 572 places, 574 transitions, 1158 flow. Second operand 3 states and 1790 transitions. [2024-11-19 05:56:08,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 573 transitions, 1188 flow [2024-11-19 05:56:08,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 573 transitions, 1184 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:08,619 INFO L231 Difference]: Finished difference. Result has 563 places, 573 transitions, 1156 flow [2024-11-19 05:56:08,621 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=561, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=563, PETRI_TRANSITIONS=573} [2024-11-19 05:56:08,621 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -14 predicate places. [2024-11-19 05:56:08,622 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 573 transitions, 1156 flow [2024-11-19 05:56:08,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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-19 05:56:08,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:08,624 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] [2024-11-19 05:56:08,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:56:08,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:08,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:08,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1999099141, now seen corresponding path program 1 times [2024-11-19 05:56:08,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:08,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252735386] [2024-11-19 05:56:08,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:08,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:08,687 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-19 05:56:08,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:08,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252735386] [2024-11-19 05:56:08,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252735386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:08,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:08,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:08,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472558914] [2024-11-19 05:56:08,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:08,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:08,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:08,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:08,731 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 625 [2024-11-19 05:56:08,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 573 transitions, 1156 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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-19 05:56:08,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:08,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 625 [2024-11-19 05:56:08,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:08,834 INFO L124 PetriNetUnfolderBase]: 26/652 cut-off events. [2024-11-19 05:56:08,835 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:56:08,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 652 events. 26/652 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1737 event pairs, 7 based on Foata normal form. 0/546 useless extension candidates. Maximal degree in co-relation 648. Up to 28 conditions per place. [2024-11-19 05:56:08,843 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 14 selfloop transitions, 2 changer transitions 0/572 dead transitions. [2024-11-19 05:56:08,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 572 transitions, 1186 flow [2024-11-19 05:56:08,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1790 transitions. [2024-11-19 05:56:08,847 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9546666666666667 [2024-11-19 05:56:08,847 INFO L175 Difference]: Start difference. First operand has 563 places, 573 transitions, 1156 flow. Second operand 3 states and 1790 transitions. [2024-11-19 05:56:08,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 572 transitions, 1186 flow [2024-11-19 05:56:08,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 572 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:08,854 INFO L231 Difference]: Finished difference. Result has 562 places, 572 transitions, 1154 flow [2024-11-19 05:56:08,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1150, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=572, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=562, PETRI_TRANSITIONS=572} [2024-11-19 05:56:08,858 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -15 predicate places. [2024-11-19 05:56:08,858 INFO L471 AbstractCegarLoop]: Abstraction has has 562 places, 572 transitions, 1154 flow [2024-11-19 05:56:08,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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-19 05:56:08,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:08,859 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-19 05:56:08,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:56:08,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:08,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:08,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1198139045, now seen corresponding path program 1 times [2024-11-19 05:56:08,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:08,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877466042] [2024-11-19 05:56:08,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:08,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:08,910 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-19 05:56:08,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:08,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877466042] [2024-11-19 05:56:08,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877466042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:08,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:08,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:08,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513436217] [2024-11-19 05:56:08,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:08,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:08,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:08,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:08,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:08,938 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 625 [2024-11-19 05:56:08,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 572 transitions, 1154 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 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-19 05:56:08,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:08,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 625 [2024-11-19 05:56:08,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:09,103 INFO L124 PetriNetUnfolderBase]: 48/971 cut-off events. [2024-11-19 05:56:09,103 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:56:09,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1032 conditions, 971 events. 48/971 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4104 event pairs, 12 based on Foata normal form. 0/796 useless extension candidates. Maximal degree in co-relation 982. Up to 48 conditions per place. [2024-11-19 05:56:09,117 INFO L140 encePairwiseOnDemand]: 619/625 looper letters, 16 selfloop transitions, 1 changer transitions 0/567 dead transitions. [2024-11-19 05:56:09,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 567 transitions, 1178 flow [2024-11-19 05:56:09,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2024-11-19 05:56:09,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9509333333333333 [2024-11-19 05:56:09,122 INFO L175 Difference]: Start difference. First operand has 562 places, 572 transitions, 1154 flow. Second operand 3 states and 1783 transitions. [2024-11-19 05:56:09,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 567 transitions, 1178 flow [2024-11-19 05:56:09,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 557 places, 567 transitions, 1174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:09,129 INFO L231 Difference]: Finished difference. Result has 557 places, 567 transitions, 1142 flow [2024-11-19 05:56:09,130 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1140, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=567, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=557, PETRI_TRANSITIONS=567} [2024-11-19 05:56:09,131 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -20 predicate places. [2024-11-19 05:56:09,132 INFO L471 AbstractCegarLoop]: Abstraction has has 557 places, 567 transitions, 1142 flow [2024-11-19 05:56:09,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 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-19 05:56:09,133 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:09,133 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] [2024-11-19 05:56:09,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:56:09,133 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:09,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:09,134 INFO L85 PathProgramCache]: Analyzing trace with hash 341110075, now seen corresponding path program 1 times [2024-11-19 05:56:09,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:09,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349738594] [2024-11-19 05:56:09,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:09,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:09,605 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-19 05:56:09,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:09,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349738594] [2024-11-19 05:56:09,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349738594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:09,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:09,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:09,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301652652] [2024-11-19 05:56:09,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:09,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:09,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:09,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:09,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:09,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 513 out of 625 [2024-11-19 05:56:09,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 557 places, 567 transitions, 1142 flow. Second operand has 6 states, 6 states have (on average 514.5) internal successors, (3087), 6 states have internal predecessors, (3087), 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-19 05:56:09,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:09,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 513 of 625 [2024-11-19 05:56:09,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:11,703 INFO L124 PetriNetUnfolderBase]: 2269/12731 cut-off events. [2024-11-19 05:56:11,703 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2024-11-19 05:56:11,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15684 conditions, 12731 events. 2269/12731 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 149095 event pairs, 1520 based on Foata normal form. 0/10038 useless extension candidates. Maximal degree in co-relation 15635. Up to 2844 conditions per place. [2024-11-19 05:56:11,798 INFO L140 encePairwiseOnDemand]: 607/625 looper letters, 78 selfloop transitions, 15 changer transitions 0/564 dead transitions. [2024-11-19 05:56:11,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 564 transitions, 1322 flow [2024-11-19 05:56:11,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:11,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3174 transitions. [2024-11-19 05:56:11,803 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8464 [2024-11-19 05:56:11,804 INFO L175 Difference]: Start difference. First operand has 557 places, 567 transitions, 1142 flow. Second operand 6 states and 3174 transitions. [2024-11-19 05:56:11,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 564 transitions, 1322 flow [2024-11-19 05:56:11,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 564 transitions, 1321 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:11,810 INFO L231 Difference]: Finished difference. Result has 558 places, 564 transitions, 1165 flow [2024-11-19 05:56:11,811 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1135, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1165, PETRI_PLACES=558, PETRI_TRANSITIONS=564} [2024-11-19 05:56:11,812 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -19 predicate places. [2024-11-19 05:56:11,812 INFO L471 AbstractCegarLoop]: Abstraction has has 558 places, 564 transitions, 1165 flow [2024-11-19 05:56:11,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 514.5) internal successors, (3087), 6 states have internal predecessors, (3087), 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-19 05:56:11,814 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:11,814 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] [2024-11-19 05:56:11,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:56:11,814 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:11,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash -717972352, now seen corresponding path program 1 times [2024-11-19 05:56:11,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:11,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337150709] [2024-11-19 05:56:11,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:11,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:11,840 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-19 05:56:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:11,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337150709] [2024-11-19 05:56:11,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337150709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:11,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:11,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:11,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959927383] [2024-11-19 05:56:11,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:11,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:11,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:11,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:11,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:11,862 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 625 [2024-11-19 05:56:11,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 564 transitions, 1165 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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-19 05:56:11,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:11,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 625 [2024-11-19 05:56:11,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:11,927 INFO L124 PetriNetUnfolderBase]: 27/710 cut-off events. [2024-11-19 05:56:11,928 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 05:56:11,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 710 events. 27/710 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2156 event pairs, 5 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 711. Up to 24 conditions per place. [2024-11-19 05:56:11,934 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 13 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2024-11-19 05:56:11,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 563 transitions, 1193 flow [2024-11-19 05:56:11,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2024-11-19 05:56:11,937 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557333333333333 [2024-11-19 05:56:11,937 INFO L175 Difference]: Start difference. First operand has 558 places, 564 transitions, 1165 flow. Second operand 3 states and 1792 transitions. [2024-11-19 05:56:11,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 563 transitions, 1193 flow [2024-11-19 05:56:11,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 563 transitions, 1163 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:56:11,944 INFO L231 Difference]: Finished difference. Result has 554 places, 563 transitions, 1137 flow [2024-11-19 05:56:11,945 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1133, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1137, PETRI_PLACES=554, PETRI_TRANSITIONS=563} [2024-11-19 05:56:11,948 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -23 predicate places. [2024-11-19 05:56:11,948 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 563 transitions, 1137 flow [2024-11-19 05:56:11,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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-19 05:56:11,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:11,949 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] [2024-11-19 05:56:11,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:56:11,949 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:11,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:11,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1166514757, now seen corresponding path program 1 times [2024-11-19 05:56:11,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:11,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422179226] [2024-11-19 05:56:11,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:11,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:11,986 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-19 05:56:11,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:11,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422179226] [2024-11-19 05:56:11,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422179226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:11,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:11,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:11,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640786207] [2024-11-19 05:56:11,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:11,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:11,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:11,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:11,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:12,005 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 625 [2024-11-19 05:56:12,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 563 transitions, 1137 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 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-19 05:56:12,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:12,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 625 [2024-11-19 05:56:12,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:12,228 INFO L124 PetriNetUnfolderBase]: 73/1294 cut-off events. [2024-11-19 05:56:12,228 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-19 05:56:12,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1379 conditions, 1294 events. 73/1294 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7105 event pairs, 20 based on Foata normal form. 0/1064 useless extension candidates. Maximal degree in co-relation 1329. Up to 65 conditions per place. [2024-11-19 05:56:12,245 INFO L140 encePairwiseOnDemand]: 619/625 looper letters, 16 selfloop transitions, 1 changer transitions 0/558 dead transitions. [2024-11-19 05:56:12,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 558 transitions, 1161 flow [2024-11-19 05:56:12,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:12,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2024-11-19 05:56:12,249 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9509333333333333 [2024-11-19 05:56:12,249 INFO L175 Difference]: Start difference. First operand has 554 places, 563 transitions, 1137 flow. Second operand 3 states and 1783 transitions. [2024-11-19 05:56:12,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 558 transitions, 1161 flow [2024-11-19 05:56:12,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 558 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:12,257 INFO L231 Difference]: Finished difference. Result has 549 places, 558 transitions, 1125 flow [2024-11-19 05:56:12,258 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1125, PETRI_PLACES=549, PETRI_TRANSITIONS=558} [2024-11-19 05:56:12,259 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2024-11-19 05:56:12,259 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 558 transitions, 1125 flow [2024-11-19 05:56:12,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 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-19 05:56:12,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:12,260 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-19 05:56:12,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:56:12,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:12,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:12,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1867829806, now seen corresponding path program 1 times [2024-11-19 05:56:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:12,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672232223] [2024-11-19 05:56:12,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:12,292 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-19 05:56:12,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:12,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672232223] [2024-11-19 05:56:12,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672232223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:12,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:12,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:12,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647760966] [2024-11-19 05:56:12,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:12,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:12,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:12,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:12,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:12,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 625 [2024-11-19 05:56:12,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 558 transitions, 1125 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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-19 05:56:12,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:12,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 625 [2024-11-19 05:56:12,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:12,417 INFO L124 PetriNetUnfolderBase]: 35/840 cut-off events. [2024-11-19 05:56:12,417 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 05:56:12,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 840 events. 35/840 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3063 event pairs, 7 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 830. Up to 27 conditions per place. [2024-11-19 05:56:12,424 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 13 selfloop transitions, 2 changer transitions 0/557 dead transitions. [2024-11-19 05:56:12,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 557 transitions, 1153 flow [2024-11-19 05:56:12,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2024-11-19 05:56:12,428 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557333333333333 [2024-11-19 05:56:12,428 INFO L175 Difference]: Start difference. First operand has 549 places, 558 transitions, 1125 flow. Second operand 3 states and 1792 transitions. [2024-11-19 05:56:12,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 557 transitions, 1153 flow [2024-11-19 05:56:12,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 557 transitions, 1152 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:12,436 INFO L231 Difference]: Finished difference. Result has 549 places, 557 transitions, 1126 flow [2024-11-19 05:56:12,437 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=549, PETRI_TRANSITIONS=557} [2024-11-19 05:56:12,437 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2024-11-19 05:56:12,437 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 557 transitions, 1126 flow [2024-11-19 05:56:12,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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-19 05:56:12,439 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:12,439 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-19 05:56:12,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:56:12,439 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:12,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:12,440 INFO L85 PathProgramCache]: Analyzing trace with hash -887836552, now seen corresponding path program 1 times [2024-11-19 05:56:12,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:12,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617050133] [2024-11-19 05:56:12,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:12,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:12,473 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-19 05:56:12,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:12,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617050133] [2024-11-19 05:56:12,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617050133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:12,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:12,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:12,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41289483] [2024-11-19 05:56:12,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:12,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:12,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:12,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:12,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:12,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 587 out of 625 [2024-11-19 05:56:12,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 557 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 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-19 05:56:12,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:12,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 587 of 625 [2024-11-19 05:56:12,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:12,671 INFO L124 PetriNetUnfolderBase]: 70/1155 cut-off events. [2024-11-19 05:56:12,671 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-19 05:56:12,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 1155 events. 70/1155 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5650 event pairs, 20 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1185. Up to 67 conditions per place. [2024-11-19 05:56:12,682 INFO L140 encePairwiseOnDemand]: 619/625 looper letters, 16 selfloop transitions, 1 changer transitions 0/552 dead transitions. [2024-11-19 05:56:12,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 546 places, 552 transitions, 1150 flow [2024-11-19 05:56:12,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1783 transitions. [2024-11-19 05:56:12,685 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9509333333333333 [2024-11-19 05:56:12,685 INFO L175 Difference]: Start difference. First operand has 549 places, 557 transitions, 1126 flow. Second operand 3 states and 1783 transitions. [2024-11-19 05:56:12,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 546 places, 552 transitions, 1150 flow [2024-11-19 05:56:12,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 552 transitions, 1146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:12,691 INFO L231 Difference]: Finished difference. Result has 544 places, 552 transitions, 1114 flow [2024-11-19 05:56:12,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1114, PETRI_PLACES=544, PETRI_TRANSITIONS=552} [2024-11-19 05:56:12,692 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2024-11-19 05:56:12,692 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 552 transitions, 1114 flow [2024-11-19 05:56:12,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 588.0) internal successors, (1764), 3 states have internal predecessors, (1764), 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-19 05:56:12,694 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:12,695 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:12,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:56:12,695 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:12,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:12,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1769071424, now seen corresponding path program 1 times [2024-11-19 05:56:12,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:12,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412856919] [2024-11-19 05:56:12,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:12,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:12,740 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-19 05:56:12,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:12,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412856919] [2024-11-19 05:56:12,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412856919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:12,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:12,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:12,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531550350] [2024-11-19 05:56:12,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:12,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:12,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:12,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:12,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:12,761 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 625 [2024-11-19 05:56:12,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 552 transitions, 1114 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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-19 05:56:12,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:12,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 625 [2024-11-19 05:56:12,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:12,821 INFO L124 PetriNetUnfolderBase]: 26/629 cut-off events. [2024-11-19 05:56:12,822 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:56:12,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 629 events. 26/629 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1691 event pairs, 7 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 617. Up to 27 conditions per place. [2024-11-19 05:56:12,827 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 13 selfloop transitions, 2 changer transitions 0/551 dead transitions. [2024-11-19 05:56:12,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 551 transitions, 1142 flow [2024-11-19 05:56:12,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:12,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:12,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2024-11-19 05:56:12,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9557333333333333 [2024-11-19 05:56:12,830 INFO L175 Difference]: Start difference. First operand has 544 places, 552 transitions, 1114 flow. Second operand 3 states and 1792 transitions. [2024-11-19 05:56:12,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 551 transitions, 1142 flow [2024-11-19 05:56:12,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 551 transitions, 1141 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:12,837 INFO L231 Difference]: Finished difference. Result has 544 places, 551 transitions, 1115 flow [2024-11-19 05:56:12,839 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1111, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1115, PETRI_PLACES=544, PETRI_TRANSITIONS=551} [2024-11-19 05:56:12,840 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -33 predicate places. [2024-11-19 05:56:12,840 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 551 transitions, 1115 flow [2024-11-19 05:56:12,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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-19 05:56:12,841 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:12,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:12,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:56:12,842 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash 553067102, now seen corresponding path program 1 times [2024-11-19 05:56:12,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:12,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726861933] [2024-11-19 05:56:12,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:12,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:12,880 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-19 05:56:12,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:12,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726861933] [2024-11-19 05:56:12,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726861933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:12,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:12,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:12,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496821839] [2024-11-19 05:56:12,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:12,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:12,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:12,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:12,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:12,907 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-19 05:56:12,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 551 transitions, 1115 flow. Second operand has 3 states, 3 states have (on average 576.0) internal successors, (1728), 3 states have internal predecessors, (1728), 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-19 05:56:12,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:12,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-19 05:56:12,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:12,976 INFO L124 PetriNetUnfolderBase]: 44/682 cut-off events. [2024-11-19 05:56:12,977 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:56:12,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 682 events. 44/682 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2075 event pairs, 2 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 737. Up to 63 conditions per place. [2024-11-19 05:56:12,983 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 25 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2024-11-19 05:56:12,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 544 transitions, 1157 flow [2024-11-19 05:56:12,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:12,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2024-11-19 05:56:12,986 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9392 [2024-11-19 05:56:12,986 INFO L175 Difference]: Start difference. First operand has 544 places, 551 transitions, 1115 flow. Second operand 3 states and 1761 transitions. [2024-11-19 05:56:12,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 544 transitions, 1157 flow [2024-11-19 05:56:12,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 544 transitions, 1153 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:12,993 INFO L231 Difference]: Finished difference. Result has 535 places, 542 transitions, 1097 flow [2024-11-19 05:56:12,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1097, PETRI_PLACES=535, PETRI_TRANSITIONS=542} [2024-11-19 05:56:12,996 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -42 predicate places. [2024-11-19 05:56:12,996 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 542 transitions, 1097 flow [2024-11-19 05:56:12,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.0) internal successors, (1728), 3 states have internal predecessors, (1728), 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-19 05:56:12,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:12,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:12,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:56:12,997 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:12,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:12,999 INFO L85 PathProgramCache]: Analyzing trace with hash -468622058, now seen corresponding path program 1 times [2024-11-19 05:56:12,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:13,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138756385] [2024-11-19 05:56:13,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:13,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:13,042 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-19 05:56:13,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:13,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138756385] [2024-11-19 05:56:13,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138756385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:13,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:13,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:13,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056302258] [2024-11-19 05:56:13,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:13,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:13,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:13,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:13,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:13,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-19 05:56:13,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 542 transitions, 1097 flow. Second operand has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 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-19 05:56:13,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:13,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-19 05:56:13,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:13,161 INFO L124 PetriNetUnfolderBase]: 47/735 cut-off events. [2024-11-19 05:56:13,162 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-19 05:56:13,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 735 events. 47/735 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2545 event pairs, 18 based on Foata normal form. 0/654 useless extension candidates. Maximal degree in co-relation 779. Up to 62 conditions per place. [2024-11-19 05:56:13,170 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 25 selfloop transitions, 2 changer transitions 0/535 dead transitions. [2024-11-19 05:56:13,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 535 transitions, 1139 flow [2024-11-19 05:56:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2024-11-19 05:56:13,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9392 [2024-11-19 05:56:13,174 INFO L175 Difference]: Start difference. First operand has 535 places, 542 transitions, 1097 flow. Second operand 3 states and 1761 transitions. [2024-11-19 05:56:13,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 535 transitions, 1139 flow [2024-11-19 05:56:13,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 535 transitions, 1135 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:13,184 INFO L231 Difference]: Finished difference. Result has 526 places, 533 transitions, 1079 flow [2024-11-19 05:56:13,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1079, PETRI_PLACES=526, PETRI_TRANSITIONS=533} [2024-11-19 05:56:13,187 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -51 predicate places. [2024-11-19 05:56:13,188 INFO L471 AbstractCegarLoop]: Abstraction has has 526 places, 533 transitions, 1079 flow [2024-11-19 05:56:13,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.3333333333334) internal successors, (1729), 3 states have internal predecessors, (1729), 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-19 05:56:13,189 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:13,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:13,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:56:13,190 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:13,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:13,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1272747947, now seen corresponding path program 1 times [2024-11-19 05:56:13,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:13,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001312702] [2024-11-19 05:56:13,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:13,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:13,238 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-19 05:56:13,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:13,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001312702] [2024-11-19 05:56:13,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001312702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:13,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:13,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:56:13,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144713961] [2024-11-19 05:56:13,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:13,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:13,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:13,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:13,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:13,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 625 [2024-11-19 05:56:13,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 533 transitions, 1079 flow. Second operand has 3 states, 3 states have (on average 596.6666666666666) internal successors, (1790), 3 states have internal predecessors, (1790), 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-19 05:56:13,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:13,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 625 [2024-11-19 05:56:13,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:13,338 INFO L124 PetriNetUnfolderBase]: 38/670 cut-off events. [2024-11-19 05:56:13,339 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:56:13,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 670 events. 38/670 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1885 event pairs, 12 based on Foata normal form. 0/603 useless extension candidates. Maximal degree in co-relation 699. Up to 39 conditions per place. [2024-11-19 05:56:13,345 INFO L140 encePairwiseOnDemand]: 621/625 looper letters, 14 selfloop transitions, 3 changer transitions 0/536 dead transitions. [2024-11-19 05:56:13,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 536 transitions, 1121 flow [2024-11-19 05:56:13,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:13,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:13,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2024-11-19 05:56:13,348 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9616 [2024-11-19 05:56:13,349 INFO L175 Difference]: Start difference. First operand has 526 places, 533 transitions, 1079 flow. Second operand 3 states and 1803 transitions. [2024-11-19 05:56:13,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 536 transitions, 1121 flow [2024-11-19 05:56:13,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 536 transitions, 1117 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:13,359 INFO L231 Difference]: Finished difference. Result has 528 places, 534 transitions, 1093 flow [2024-11-19 05:56:13,360 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=524, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1093, PETRI_PLACES=528, PETRI_TRANSITIONS=534} [2024-11-19 05:56:13,360 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -49 predicate places. [2024-11-19 05:56:13,360 INFO L471 AbstractCegarLoop]: Abstraction has has 528 places, 534 transitions, 1093 flow [2024-11-19 05:56:13,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 596.6666666666666) internal successors, (1790), 3 states have internal predecessors, (1790), 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-19 05:56:13,362 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:13,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:13,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:56:13,362 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:13,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:13,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1913422954, now seen corresponding path program 1 times [2024-11-19 05:56:13,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:13,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943094645] [2024-11-19 05:56:13,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:13,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:13,407 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-19 05:56:13,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:13,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943094645] [2024-11-19 05:56:13,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943094645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:13,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:13,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:13,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146804515] [2024-11-19 05:56:13,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:13,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:13,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:13,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:13,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:13,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-19 05:56:13,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 534 transitions, 1093 flow. Second operand has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 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-19 05:56:13,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:13,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-19 05:56:13,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:13,505 INFO L124 PetriNetUnfolderBase]: 44/665 cut-off events. [2024-11-19 05:56:13,505 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-19 05:56:13,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 665 events. 44/665 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2165 event pairs, 2 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 704. Up to 61 conditions per place. [2024-11-19 05:56:13,511 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 25 selfloop transitions, 2 changer transitions 0/527 dead transitions. [2024-11-19 05:56:13,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 527 transitions, 1135 flow [2024-11-19 05:56:13,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1761 transitions. [2024-11-19 05:56:13,515 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9392 [2024-11-19 05:56:13,515 INFO L175 Difference]: Start difference. First operand has 528 places, 534 transitions, 1093 flow. Second operand 3 states and 1761 transitions. [2024-11-19 05:56:13,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 527 transitions, 1135 flow [2024-11-19 05:56:13,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 527 transitions, 1129 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:13,521 INFO L231 Difference]: Finished difference. Result has 519 places, 525 transitions, 1073 flow [2024-11-19 05:56:13,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1073, PETRI_PLACES=519, PETRI_TRANSITIONS=525} [2024-11-19 05:56:13,523 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -58 predicate places. [2024-11-19 05:56:13,523 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 525 transitions, 1073 flow [2024-11-19 05:56:13,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 576.6666666666666) internal successors, (1730), 3 states have internal predecessors, (1730), 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-19 05:56:13,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:13,525 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:13,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:56:13,525 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:13,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:13,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1167087741, now seen corresponding path program 1 times [2024-11-19 05:56:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:13,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929369894] [2024-11-19 05:56:13,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:13,559 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-19 05:56:13,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:13,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929369894] [2024-11-19 05:56:13,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929369894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:13,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:13,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:13,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616893230] [2024-11-19 05:56:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:13,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:13,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:13,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:13,575 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 625 [2024-11-19 05:56:13,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 525 transitions, 1073 flow. Second operand has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 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-19 05:56:13,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:13,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 625 [2024-11-19 05:56:13,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:13,686 INFO L124 PetriNetUnfolderBase]: 62/1077 cut-off events. [2024-11-19 05:56:13,686 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 05:56:13,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 1077 events. 62/1077 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4740 event pairs, 2 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1136. Up to 52 conditions per place. [2024-11-19 05:56:13,695 INFO L140 encePairwiseOnDemand]: 617/625 looper letters, 20 selfloop transitions, 4 changer transitions 0/530 dead transitions. [2024-11-19 05:56:13,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 530 transitions, 1136 flow [2024-11-19 05:56:13,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2024-11-19 05:56:13,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9589333333333333 [2024-11-19 05:56:13,699 INFO L175 Difference]: Start difference. First operand has 519 places, 525 transitions, 1073 flow. Second operand 3 states and 1798 transitions. [2024-11-19 05:56:13,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 530 transitions, 1136 flow [2024-11-19 05:56:13,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 530 transitions, 1132 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:13,705 INFO L231 Difference]: Finished difference. Result has 516 places, 525 transitions, 1089 flow [2024-11-19 05:56:13,705 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1061, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1089, PETRI_PLACES=516, PETRI_TRANSITIONS=525} [2024-11-19 05:56:13,706 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -61 predicate places. [2024-11-19 05:56:13,706 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 525 transitions, 1089 flow [2024-11-19 05:56:13,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.3333333333334) internal successors, (1774), 3 states have internal predecessors, (1774), 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-19 05:56:13,707 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:13,707 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:13,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:56:13,707 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:13,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:13,708 INFO L85 PathProgramCache]: Analyzing trace with hash 152646627, now seen corresponding path program 1 times [2024-11-19 05:56:13,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:13,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177930005] [2024-11-19 05:56:13,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:13,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:13,742 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-19 05:56:13,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:13,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177930005] [2024-11-19 05:56:13,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177930005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:13,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:13,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:56:13,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717787378] [2024-11-19 05:56:13,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:13,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:13,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:13,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:13,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:13,752 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 625 [2024-11-19 05:56:13,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 525 transitions, 1089 flow. Second operand has 3 states, 3 states have (on average 597.0) internal successors, (1791), 3 states have internal predecessors, (1791), 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-19 05:56:13,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:13,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 625 [2024-11-19 05:56:13,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:13,848 INFO L124 PetriNetUnfolderBase]: 63/919 cut-off events. [2024-11-19 05:56:13,848 INFO L125 PetriNetUnfolderBase]: For 21/49 co-relation queries the response was YES. [2024-11-19 05:56:13,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 919 events. 63/919 cut-off events. For 21/49 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3803 event pairs, 18 based on Foata normal form. 1/832 useless extension candidates. Maximal degree in co-relation 987. Up to 57 conditions per place. [2024-11-19 05:56:13,859 INFO L140 encePairwiseOnDemand]: 621/625 looper letters, 14 selfloop transitions, 3 changer transitions 0/528 dead transitions. [2024-11-19 05:56:13,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 528 transitions, 1131 flow [2024-11-19 05:56:13,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2024-11-19 05:56:13,862 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9616 [2024-11-19 05:56:13,862 INFO L175 Difference]: Start difference. First operand has 516 places, 525 transitions, 1089 flow. Second operand 3 states and 1803 transitions. [2024-11-19 05:56:13,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 528 transitions, 1131 flow [2024-11-19 05:56:13,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 528 transitions, 1131 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:13,869 INFO L231 Difference]: Finished difference. Result has 520 places, 526 transitions, 1107 flow [2024-11-19 05:56:13,869 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1107, PETRI_PLACES=520, PETRI_TRANSITIONS=526} [2024-11-19 05:56:13,870 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -57 predicate places. [2024-11-19 05:56:13,870 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 526 transitions, 1107 flow [2024-11-19 05:56:13,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.0) internal successors, (1791), 3 states have internal predecessors, (1791), 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-19 05:56:13,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:13,872 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:13,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:56:13,872 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:13,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:13,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2048101838, now seen corresponding path program 1 times [2024-11-19 05:56:13,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:13,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728514094] [2024-11-19 05:56:13,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:13,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:13,914 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-19 05:56:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728514094] [2024-11-19 05:56:13,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728514094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:13,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:13,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:13,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973689169] [2024-11-19 05:56:13,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:13,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:13,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:13,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:13,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:13,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 625 [2024-11-19 05:56:13,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 526 transitions, 1107 flow. Second operand has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 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-19 05:56:13,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:13,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 625 [2024-11-19 05:56:13,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:14,112 INFO L124 PetriNetUnfolderBase]: 107/1690 cut-off events. [2024-11-19 05:56:14,112 INFO L125 PetriNetUnfolderBase]: For 21/29 co-relation queries the response was YES. [2024-11-19 05:56:14,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1920 conditions, 1690 events. 107/1690 cut-off events. For 21/29 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9637 event pairs, 8 based on Foata normal form. 1/1548 useless extension candidates. Maximal degree in co-relation 1868. Up to 76 conditions per place. [2024-11-19 05:56:14,133 INFO L140 encePairwiseOnDemand]: 617/625 looper letters, 20 selfloop transitions, 4 changer transitions 0/531 dead transitions. [2024-11-19 05:56:14,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 531 transitions, 1170 flow [2024-11-19 05:56:14,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2024-11-19 05:56:14,136 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9589333333333333 [2024-11-19 05:56:14,136 INFO L175 Difference]: Start difference. First operand has 520 places, 526 transitions, 1107 flow. Second operand 3 states and 1798 transitions. [2024-11-19 05:56:14,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 531 transitions, 1170 flow [2024-11-19 05:56:14,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 531 transitions, 1164 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:14,143 INFO L231 Difference]: Finished difference. Result has 517 places, 526 transitions, 1121 flow [2024-11-19 05:56:14,143 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1093, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1121, PETRI_PLACES=517, PETRI_TRANSITIONS=526} [2024-11-19 05:56:14,144 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -60 predicate places. [2024-11-19 05:56:14,144 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 526 transitions, 1121 flow [2024-11-19 05:56:14,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 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-19 05:56:14,145 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:14,145 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:14,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:56:14,146 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:14,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:14,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1282534743, now seen corresponding path program 1 times [2024-11-19 05:56:14,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:14,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628006106] [2024-11-19 05:56:14,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:14,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:14,332 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-19 05:56:14,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:14,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628006106] [2024-11-19 05:56:14,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628006106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:14,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:14,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:14,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993226446] [2024-11-19 05:56:14,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:14,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:14,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:14,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:14,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:14,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-19 05:56:14,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 526 transitions, 1121 flow. Second operand has 8 states, 8 states have (on average 568.125) internal successors, (4545), 8 states have internal predecessors, (4545), 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-19 05:56:14,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:14,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-19 05:56:14,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:15,327 INFO L124 PetriNetUnfolderBase]: 161/2336 cut-off events. [2024-11-19 05:56:15,328 INFO L125 PetriNetUnfolderBase]: For 14/58 co-relation queries the response was YES. [2024-11-19 05:56:15,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2851 conditions, 2336 events. 161/2336 cut-off events. For 14/58 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 14606 event pairs, 14 based on Foata normal form. 7/2180 useless extension candidates. Maximal degree in co-relation 2796. Up to 115 conditions per place. [2024-11-19 05:56:15,349 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 79 selfloop transitions, 19 changer transitions 0/578 dead transitions. [2024-11-19 05:56:15,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 578 transitions, 1452 flow [2024-11-19 05:56:15,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 05:56:15,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 05:56:15,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6866 transitions. [2024-11-19 05:56:15,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9154666666666667 [2024-11-19 05:56:15,357 INFO L175 Difference]: Start difference. First operand has 517 places, 526 transitions, 1121 flow. Second operand 12 states and 6866 transitions. [2024-11-19 05:56:15,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 578 transitions, 1452 flow [2024-11-19 05:56:15,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 528 places, 578 transitions, 1452 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:15,365 INFO L231 Difference]: Finished difference. Result has 533 places, 537 transitions, 1228 flow [2024-11-19 05:56:15,365 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=510, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1228, PETRI_PLACES=533, PETRI_TRANSITIONS=537} [2024-11-19 05:56:15,366 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -44 predicate places. [2024-11-19 05:56:15,366 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 537 transitions, 1228 flow [2024-11-19 05:56:15,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.125) internal successors, (4545), 8 states have internal predecessors, (4545), 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-19 05:56:15,367 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:15,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:15,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:56:15,367 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:15,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:15,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1974661260, now seen corresponding path program 1 times [2024-11-19 05:56:15,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:15,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717188348] [2024-11-19 05:56:15,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:15,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:15,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:15,533 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-19 05:56:15,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:15,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717188348] [2024-11-19 05:56:15,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717188348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:15,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:15,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:15,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638133455] [2024-11-19 05:56:15,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:15,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:15,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:15,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:15,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:16,106 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-19 05:56:16,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 537 transitions, 1228 flow. Second operand has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 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-19 05:56:16,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:16,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-19 05:56:16,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:17,057 INFO L124 PetriNetUnfolderBase]: 396/5290 cut-off events. [2024-11-19 05:56:17,057 INFO L125 PetriNetUnfolderBase]: For 214/302 co-relation queries the response was YES. [2024-11-19 05:56:17,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6466 conditions, 5290 events. 396/5290 cut-off events. For 214/302 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 47127 event pairs, 62 based on Foata normal form. 14/4853 useless extension candidates. Maximal degree in co-relation 6400. Up to 201 conditions per place. [2024-11-19 05:56:17,117 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 74 selfloop transitions, 19 changer transitions 0/579 dead transitions. [2024-11-19 05:56:17,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 579 transitions, 1528 flow [2024-11-19 05:56:17,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 05:56:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 05:56:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6856 transitions. [2024-11-19 05:56:17,129 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9141333333333334 [2024-11-19 05:56:17,129 INFO L175 Difference]: Start difference. First operand has 533 places, 537 transitions, 1228 flow. Second operand 12 states and 6856 transitions. [2024-11-19 05:56:17,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 579 transitions, 1528 flow [2024-11-19 05:56:17,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 579 transitions, 1528 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:17,141 INFO L231 Difference]: Finished difference. Result has 549 places, 548 transitions, 1335 flow [2024-11-19 05:56:17,142 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1335, PETRI_PLACES=549, PETRI_TRANSITIONS=548} [2024-11-19 05:56:17,142 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -28 predicate places. [2024-11-19 05:56:17,142 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 548 transitions, 1335 flow [2024-11-19 05:56:17,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 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-19 05:56:17,144 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:17,144 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:17,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:56:17,144 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:17,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:17,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1349613047, now seen corresponding path program 1 times [2024-11-19 05:56:17,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:17,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375122650] [2024-11-19 05:56:17,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:17,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:17,190 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-19 05:56:17,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:17,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375122650] [2024-11-19 05:56:17,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375122650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:17,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:17,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:56:17,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100955084] [2024-11-19 05:56:17,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:17,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:17,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:17,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:17,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:17,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 625 [2024-11-19 05:56:17,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 548 transitions, 1335 flow. Second operand has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 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-19 05:56:17,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:17,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 625 [2024-11-19 05:56:17,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:17,874 INFO L124 PetriNetUnfolderBase]: 618/5400 cut-off events. [2024-11-19 05:56:17,874 INFO L125 PetriNetUnfolderBase]: For 453/585 co-relation queries the response was YES. [2024-11-19 05:56:17,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6776 conditions, 5400 events. 618/5400 cut-off events. For 453/585 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 48379 event pairs, 209 based on Foata normal form. 0/4816 useless extension candidates. Maximal degree in co-relation 6702. Up to 631 conditions per place. [2024-11-19 05:56:17,907 INFO L140 encePairwiseOnDemand]: 621/625 looper letters, 14 selfloop transitions, 3 changer transitions 0/551 dead transitions. [2024-11-19 05:56:17,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 551 transitions, 1377 flow [2024-11-19 05:56:17,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1803 transitions. [2024-11-19 05:56:17,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9616 [2024-11-19 05:56:17,910 INFO L175 Difference]: Start difference. First operand has 549 places, 548 transitions, 1335 flow. Second operand 3 states and 1803 transitions. [2024-11-19 05:56:17,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 551 transitions, 1377 flow [2024-11-19 05:56:17,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 551 places, 551 transitions, 1377 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:17,917 INFO L231 Difference]: Finished difference. Result has 553 places, 549 transitions, 1353 flow [2024-11-19 05:56:17,918 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=549, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=548, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1353, PETRI_PLACES=553, PETRI_TRANSITIONS=549} [2024-11-19 05:56:17,918 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -24 predicate places. [2024-11-19 05:56:17,918 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 549 transitions, 1353 flow [2024-11-19 05:56:17,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.3333333333334) internal successors, (1792), 3 states have internal predecessors, (1792), 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-19 05:56:17,919 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:17,919 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:17,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:56:17,919 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:17,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1645222537, now seen corresponding path program 1 times [2024-11-19 05:56:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:17,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940781643] [2024-11-19 05:56:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:17,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:18,067 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-19 05:56:18,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:18,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940781643] [2024-11-19 05:56:18,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940781643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:18,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:18,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:18,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100289076] [2024-11-19 05:56:18,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:18,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:18,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:18,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:18,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:18,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-19 05:56:18,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 549 transitions, 1353 flow. Second operand has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 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-19 05:56:18,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:18,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-19 05:56:18,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:19,449 INFO L124 PetriNetUnfolderBase]: 663/7300 cut-off events. [2024-11-19 05:56:19,449 INFO L125 PetriNetUnfolderBase]: For 637/745 co-relation queries the response was YES. [2024-11-19 05:56:19,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9268 conditions, 7300 events. 663/7300 cut-off events. For 637/745 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 72732 event pairs, 135 based on Foata normal form. 9/6617 useless extension candidates. Maximal degree in co-relation 9189. Up to 372 conditions per place. [2024-11-19 05:56:19,495 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 86 selfloop transitions, 22 changer transitions 0/601 dead transitions. [2024-11-19 05:56:19,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 565 places, 601 transitions, 1748 flow [2024-11-19 05:56:19,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 05:56:19,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-19 05:56:19,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7431 transitions. [2024-11-19 05:56:19,506 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9145846153846153 [2024-11-19 05:56:19,507 INFO L175 Difference]: Start difference. First operand has 553 places, 549 transitions, 1353 flow. Second operand 13 states and 7431 transitions. [2024-11-19 05:56:19,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 565 places, 601 transitions, 1748 flow [2024-11-19 05:56:19,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 601 transitions, 1732 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:19,517 INFO L231 Difference]: Finished difference. Result has 566 places, 556 transitions, 1439 flow [2024-11-19 05:56:19,517 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1439, PETRI_PLACES=566, PETRI_TRANSITIONS=556} [2024-11-19 05:56:19,518 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -11 predicate places. [2024-11-19 05:56:19,518 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 556 transitions, 1439 flow [2024-11-19 05:56:19,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 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-19 05:56:19,519 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:19,519 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:19,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:56:19,519 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:19,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:19,520 INFO L85 PathProgramCache]: Analyzing trace with hash -959702866, now seen corresponding path program 1 times [2024-11-19 05:56:19,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:19,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165555704] [2024-11-19 05:56:19,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:19,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:56:19,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:19,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165555704] [2024-11-19 05:56:19,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165555704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:19,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:19,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:19,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585102940] [2024-11-19 05:56:19,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:19,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:19,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:19,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:19,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:20,003 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-19 05:56:20,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 556 transitions, 1439 flow. Second operand has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 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-19 05:56:20,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:20,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-19 05:56:20,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:20,781 INFO L124 PetriNetUnfolderBase]: 284/5297 cut-off events. [2024-11-19 05:56:20,781 INFO L125 PetriNetUnfolderBase]: For 242/371 co-relation queries the response was YES. [2024-11-19 05:56:20,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6597 conditions, 5297 events. 284/5297 cut-off events. For 242/371 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 42447 event pairs, 37 based on Foata normal form. 13/4948 useless extension candidates. Maximal degree in co-relation 6510. Up to 193 conditions per place. [2024-11-19 05:56:20,817 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 79 selfloop transitions, 24 changer transitions 0/597 dead transitions. [2024-11-19 05:56:20,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 597 transitions, 1789 flow [2024-11-19 05:56:20,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 05:56:20,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 05:56:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6859 transitions. [2024-11-19 05:56:20,825 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9145333333333333 [2024-11-19 05:56:20,825 INFO L175 Difference]: Start difference. First operand has 566 places, 556 transitions, 1439 flow. Second operand 12 states and 6859 transitions. [2024-11-19 05:56:20,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 597 transitions, 1789 flow [2024-11-19 05:56:20,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 597 transitions, 1772 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:56:20,833 INFO L231 Difference]: Finished difference. Result has 574 places, 563 transitions, 1545 flow [2024-11-19 05:56:20,834 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=560, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1545, PETRI_PLACES=574, PETRI_TRANSITIONS=563} [2024-11-19 05:56:20,834 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -3 predicate places. [2024-11-19 05:56:20,834 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 563 transitions, 1545 flow [2024-11-19 05:56:20,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.25) internal successors, (4546), 8 states have internal predecessors, (4546), 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-19 05:56:20,835 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:20,835 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:20,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 05:56:20,836 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:20,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1473674557, now seen corresponding path program 1 times [2024-11-19 05:56:20,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:20,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766286729] [2024-11-19 05:56:20,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:20,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:20,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:56:20,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:20,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766286729] [2024-11-19 05:56:20,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766286729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:20,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:20,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:20,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881312043] [2024-11-19 05:56:20,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:20,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:20,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:20,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:20,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:21,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-19 05:56:21,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 563 transitions, 1545 flow. Second operand has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 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-19 05:56:21,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:21,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-19 05:56:21,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:23,007 INFO L124 PetriNetUnfolderBase]: 611/8988 cut-off events. [2024-11-19 05:56:23,008 INFO L125 PetriNetUnfolderBase]: For 811/985 co-relation queries the response was YES. [2024-11-19 05:56:23,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11486 conditions, 8988 events. 611/8988 cut-off events. For 811/985 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 89869 event pairs, 119 based on Foata normal form. 22/8299 useless extension candidates. Maximal degree in co-relation 11390. Up to 264 conditions per place. [2024-11-19 05:56:23,102 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 73 selfloop transitions, 27 changer transitions 0/601 dead transitions. [2024-11-19 05:56:23,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 601 transitions, 1884 flow [2024-11-19 05:56:23,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 05:56:23,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-19 05:56:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7416 transitions. [2024-11-19 05:56:23,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9127384615384615 [2024-11-19 05:56:23,111 INFO L175 Difference]: Start difference. First operand has 574 places, 563 transitions, 1545 flow. Second operand 13 states and 7416 transitions. [2024-11-19 05:56:23,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 601 transitions, 1884 flow [2024-11-19 05:56:23,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 601 transitions, 1867 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:56:23,123 INFO L231 Difference]: Finished difference. Result has 585 places, 575 transitions, 1676 flow [2024-11-19 05:56:23,123 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1676, PETRI_PLACES=585, PETRI_TRANSITIONS=575} [2024-11-19 05:56:23,124 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 8 predicate places. [2024-11-19 05:56:23,124 INFO L471 AbstractCegarLoop]: Abstraction has has 585 places, 575 transitions, 1676 flow [2024-11-19 05:56:23,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.375) internal successors, (4547), 8 states have internal predecessors, (4547), 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-19 05:56:23,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:23,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:23,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 05:56:23,125 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:23,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:23,126 INFO L85 PathProgramCache]: Analyzing trace with hash 2128874492, now seen corresponding path program 1 times [2024-11-19 05:56:23,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:23,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412954743] [2024-11-19 05:56:23,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:23,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:23,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:56:23,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:23,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412954743] [2024-11-19 05:56:23,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412954743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:23,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:23,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 05:56:23,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858781230] [2024-11-19 05:56:23,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:23,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 05:56:23,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:23,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 05:56:23,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 05:56:23,766 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 564 out of 625 [2024-11-19 05:56:23,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 575 transitions, 1676 flow. Second operand has 8 states, 8 states have (on average 568.5) internal successors, (4548), 8 states have internal predecessors, (4548), 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-19 05:56:23,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:23,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 564 of 625 [2024-11-19 05:56:23,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:25,037 INFO L124 PetriNetUnfolderBase]: 659/8213 cut-off events. [2024-11-19 05:56:25,037 INFO L125 PetriNetUnfolderBase]: For 1123/1229 co-relation queries the response was YES. [2024-11-19 05:56:25,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10829 conditions, 8213 events. 659/8213 cut-off events. For 1123/1229 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 82171 event pairs, 147 based on Foata normal form. 11/7526 useless extension candidates. Maximal degree in co-relation 10722. Up to 389 conditions per place. [2024-11-19 05:56:25,102 INFO L140 encePairwiseOnDemand]: 608/625 looper letters, 73 selfloop transitions, 24 changer transitions 0/604 dead transitions. [2024-11-19 05:56:25,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 604 transitions, 1984 flow [2024-11-19 05:56:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 05:56:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 05:56:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6848 transitions. [2024-11-19 05:56:25,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9130666666666667 [2024-11-19 05:56:25,106 INFO L175 Difference]: Start difference. First operand has 585 places, 575 transitions, 1676 flow. Second operand 12 states and 6848 transitions. [2024-11-19 05:56:25,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 604 transitions, 1984 flow [2024-11-19 05:56:25,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 604 transitions, 1980 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:25,118 INFO L231 Difference]: Finished difference. Result has 598 places, 581 transitions, 1787 flow [2024-11-19 05:56:25,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1787, PETRI_PLACES=598, PETRI_TRANSITIONS=581} [2024-11-19 05:56:25,119 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 21 predicate places. [2024-11-19 05:56:25,120 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 581 transitions, 1787 flow [2024-11-19 05:56:25,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 568.5) internal successors, (4548), 8 states have internal predecessors, (4548), 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-19 05:56:25,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:25,121 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:25,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 05:56:25,121 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:25,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:25,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1524999539, now seen corresponding path program 1 times [2024-11-19 05:56:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:25,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513676533] [2024-11-19 05:56:25,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:25,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:25,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:25,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:25,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513676533] [2024-11-19 05:56:25,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513676533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:25,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:25,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:25,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880401414] [2024-11-19 05:56:25,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:25,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:25,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:25,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:25,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:25,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-19 05:56:25,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 581 transitions, 1787 flow. Second operand has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 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-19 05:56:25,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:25,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-19 05:56:25,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:27,135 INFO L124 PetriNetUnfolderBase]: 307/8437 cut-off events. [2024-11-19 05:56:27,136 INFO L125 PetriNetUnfolderBase]: For 654/727 co-relation queries the response was YES. [2024-11-19 05:56:27,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10321 conditions, 8437 events. 307/8437 cut-off events. For 654/727 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 76625 event pairs, 16 based on Foata normal form. 20/7889 useless extension candidates. Maximal degree in co-relation 10207. Up to 177 conditions per place. [2024-11-19 05:56:27,206 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 38 selfloop transitions, 10 changer transitions 0/594 dead transitions. [2024-11-19 05:56:27,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 594 transitions, 1920 flow [2024-11-19 05:56:27,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:27,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2024-11-19 05:56:27,208 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9330666666666667 [2024-11-19 05:56:27,208 INFO L175 Difference]: Start difference. First operand has 598 places, 581 transitions, 1787 flow. Second operand 6 states and 3499 transitions. [2024-11-19 05:56:27,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 594 transitions, 1920 flow [2024-11-19 05:56:27,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 594 transitions, 1901 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-19 05:56:27,219 INFO L231 Difference]: Finished difference. Result has 598 places, 583 transitions, 1816 flow [2024-11-19 05:56:27,219 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1764, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1816, PETRI_PLACES=598, PETRI_TRANSITIONS=583} [2024-11-19 05:56:27,220 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 21 predicate places. [2024-11-19 05:56:27,220 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 583 transitions, 1816 flow [2024-11-19 05:56:27,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 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-19 05:56:27,221 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:27,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:27,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 05:56:27,221 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:27,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:27,221 INFO L85 PathProgramCache]: Analyzing trace with hash -249904346, now seen corresponding path program 1 times [2024-11-19 05:56:27,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:27,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287134869] [2024-11-19 05:56:27,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:27,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:27,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:27,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287134869] [2024-11-19 05:56:27,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287134869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:27,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:27,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:27,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845280808] [2024-11-19 05:56:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:27,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:27,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:27,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:27,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:28,030 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-19 05:56:28,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 583 transitions, 1816 flow. Second operand has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 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-19 05:56:28,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:28,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-19 05:56:28,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:29,593 INFO L124 PetriNetUnfolderBase]: 407/10840 cut-off events. [2024-11-19 05:56:29,593 INFO L125 PetriNetUnfolderBase]: For 723/958 co-relation queries the response was YES. [2024-11-19 05:56:29,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13244 conditions, 10840 events. 407/10840 cut-off events. For 723/958 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 107244 event pairs, 18 based on Foata normal form. 35/10181 useless extension candidates. Maximal degree in co-relation 13127. Up to 294 conditions per place. [2024-11-19 05:56:29,695 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 37 selfloop transitions, 10 changer transitions 0/595 dead transitions. [2024-11-19 05:56:29,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 595 transitions, 1944 flow [2024-11-19 05:56:29,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3498 transitions. [2024-11-19 05:56:29,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9328 [2024-11-19 05:56:29,698 INFO L175 Difference]: Start difference. First operand has 598 places, 583 transitions, 1816 flow. Second operand 6 states and 3498 transitions. [2024-11-19 05:56:29,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 595 transitions, 1944 flow [2024-11-19 05:56:29,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 595 transitions, 1940 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:29,711 INFO L231 Difference]: Finished difference. Result has 604 places, 585 transitions, 1860 flow [2024-11-19 05:56:29,712 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1860, PETRI_PLACES=604, PETRI_TRANSITIONS=585} [2024-11-19 05:56:29,712 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 27 predicate places. [2024-11-19 05:56:29,712 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 585 transitions, 1860 flow [2024-11-19 05:56:29,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 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-19 05:56:29,714 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:29,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:29,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 05:56:29,714 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:29,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:29,715 INFO L85 PathProgramCache]: Analyzing trace with hash 360140776, now seen corresponding path program 1 times [2024-11-19 05:56:29,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:29,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709115682] [2024-11-19 05:56:29,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:29,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:29,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:29,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:29,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709115682] [2024-11-19 05:56:29,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709115682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:29,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:29,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:29,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522060794] [2024-11-19 05:56:29,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:29,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:29,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:29,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:29,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:29,773 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 625 [2024-11-19 05:56:29,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 585 transitions, 1860 flow. Second operand has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 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-19 05:56:29,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:29,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 625 [2024-11-19 05:56:29,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:32,861 INFO L124 PetriNetUnfolderBase]: 863/16330 cut-off events. [2024-11-19 05:56:32,861 INFO L125 PetriNetUnfolderBase]: For 1342/1363 co-relation queries the response was YES. [2024-11-19 05:56:33,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20836 conditions, 16330 events. 863/16330 cut-off events. For 1342/1363 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 183319 event pairs, 169 based on Foata normal form. 0/15345 useless extension candidates. Maximal degree in co-relation 20717. Up to 946 conditions per place. [2024-11-19 05:56:33,058 INFO L140 encePairwiseOnDemand]: 617/625 looper letters, 19 selfloop transitions, 4 changer transitions 0/589 dead transitions. [2024-11-19 05:56:33,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 589 transitions, 1918 flow [2024-11-19 05:56:33,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:33,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:33,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1797 transitions. [2024-11-19 05:56:33,060 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9584 [2024-11-19 05:56:33,060 INFO L175 Difference]: Start difference. First operand has 604 places, 585 transitions, 1860 flow. Second operand 3 states and 1797 transitions. [2024-11-19 05:56:33,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 589 transitions, 1918 flow [2024-11-19 05:56:33,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 589 transitions, 1914 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:33,083 INFO L231 Difference]: Finished difference. Result has 602 places, 585 transitions, 1876 flow [2024-11-19 05:56:33,083 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1876, PETRI_PLACES=602, PETRI_TRANSITIONS=585} [2024-11-19 05:56:33,084 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 25 predicate places. [2024-11-19 05:56:33,084 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 585 transitions, 1876 flow [2024-11-19 05:56:33,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.6666666666666) internal successors, (1775), 3 states have internal predecessors, (1775), 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-19 05:56:33,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:33,085 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:33,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 05:56:33,085 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:33,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:33,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1643432235, now seen corresponding path program 1 times [2024-11-19 05:56:33,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:33,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697475838] [2024-11-19 05:56:33,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:33,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:33,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:33,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:33,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697475838] [2024-11-19 05:56:33,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697475838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:33,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:33,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:33,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279275870] [2024-11-19 05:56:33,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:33,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:33,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:33,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:33,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:33,838 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-19 05:56:33,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 602 places, 585 transitions, 1876 flow. Second operand has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 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-19 05:56:33,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:33,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-19 05:56:33,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:35,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1597] thread3EXIT-->L97: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][552], [Black: 646#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork1_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 781#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 787#(and (not |thread2Thread1of1ForFork1_#t~short6|) (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 661#true, Black: 770#(= ~i_BC~0 0), Black: 774#(and (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 768#true, 654#(= |#race~A~0| 0), 522#L97true, Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 667#(= ~i_AB~0 0), Black: 684#(and (<= ~An~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 801#(and (= ~i_AC~0 0) (<= ~Cn~0 0)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), Black: 814#(and (not |thread3Thread1of1ForFork2_#t~short11|) (= ~i_AC~0 0) (<= ~Cn~0 0)), Black: 818#true, Black: 822#(and (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0)), 616#(= |#race~An~0| 0), Black: 820#(= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0), Black: 821#(and (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0)), Black: 830#(= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0), Black: 832#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset 1)) 0)), Black: 831#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset 1)) 0)), Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 709#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork1_#t~short6|) (= ~i_BC~0 0)), 722#(= ~i_AC~0 0), Black: 692#(= ~i_BC~0 0), Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 838#true, 628#(= |#race~Bn~0| 0), Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 665#true, Black: 717#(not |thread3Thread1of1ForFork2_#t~short11|), 797#(= ~i_AC~0 0), 847#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) 3 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 1)) 0)), Black: 739#(and (not |thread3Thread1of1ForFork2_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 745#true, 828#true, Black: 764#(and (<= ~Bn~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), 663#(= |#race~B~0| 0), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0)), Black: 747#(= ~i_AB~0 0)]) [2024-11-19 05:56:35,572 INFO L294 olderBase$Statistics]: this new event has 436 ancestors and is cut-off event [2024-11-19 05:56:35,572 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-19 05:56:35,572 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-19 05:56:35,572 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-11-19 05:56:35,685 INFO L124 PetriNetUnfolderBase]: 446/11911 cut-off events. [2024-11-19 05:56:35,685 INFO L125 PetriNetUnfolderBase]: For 859/1036 co-relation queries the response was YES. [2024-11-19 05:56:35,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15286 conditions, 11911 events. 446/11911 cut-off events. For 859/1036 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 119998 event pairs, 25 based on Foata normal form. 64/11418 useless extension candidates. Maximal degree in co-relation 15164. Up to 273 conditions per place. [2024-11-19 05:56:35,828 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 38 selfloop transitions, 10 changer transitions 0/598 dead transitions. [2024-11-19 05:56:35,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 598 transitions, 2009 flow [2024-11-19 05:56:35,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:35,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2024-11-19 05:56:35,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9330666666666667 [2024-11-19 05:56:35,831 INFO L175 Difference]: Start difference. First operand has 602 places, 585 transitions, 1876 flow. Second operand 6 states and 3499 transitions. [2024-11-19 05:56:35,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 598 transitions, 2009 flow [2024-11-19 05:56:35,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 598 transitions, 2009 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:35,846 INFO L231 Difference]: Finished difference. Result has 609 places, 587 transitions, 1924 flow [2024-11-19 05:56:35,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1872, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1924, PETRI_PLACES=609, PETRI_TRANSITIONS=587} [2024-11-19 05:56:35,847 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 32 predicate places. [2024-11-19 05:56:35,847 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 587 transitions, 1924 flow [2024-11-19 05:56:35,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 577.8333333333334) internal successors, (3467), 6 states have internal predecessors, (3467), 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-19 05:56:35,848 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:35,849 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:35,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 05:56:35,849 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:35,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:35,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1765257389, now seen corresponding path program 1 times [2024-11-19 05:56:35,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:35,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676928645] [2024-11-19 05:56:35,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:35,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:36,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:36,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676928645] [2024-11-19 05:56:36,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676928645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:36,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:36,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:36,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442332919] [2024-11-19 05:56:36,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:36,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:36,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:36,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:36,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-19 05:56:36,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 587 transitions, 1924 flow. Second operand has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 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-19 05:56:36,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:36,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-19 05:56:36,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:39,756 INFO L124 PetriNetUnfolderBase]: 936/17156 cut-off events. [2024-11-19 05:56:39,756 INFO L125 PetriNetUnfolderBase]: For 1488/1543 co-relation queries the response was YES. [2024-11-19 05:56:39,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22790 conditions, 17156 events. 936/17156 cut-off events. For 1488/1543 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 198062 event pairs, 75 based on Foata normal form. 4/16363 useless extension candidates. Maximal degree in co-relation 22664. Up to 660 conditions per place. [2024-11-19 05:56:39,872 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 36 selfloop transitions, 10 changer transitions 0/598 dead transitions. [2024-11-19 05:56:39,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 598 transitions, 2047 flow [2024-11-19 05:56:39,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:39,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3497 transitions. [2024-11-19 05:56:39,874 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9325333333333333 [2024-11-19 05:56:39,874 INFO L175 Difference]: Start difference. First operand has 609 places, 587 transitions, 1924 flow. Second operand 6 states and 3497 transitions. [2024-11-19 05:56:39,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 598 transitions, 2047 flow [2024-11-19 05:56:39,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 598 transitions, 2043 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:39,891 INFO L231 Difference]: Finished difference. Result has 615 places, 589 transitions, 1968 flow [2024-11-19 05:56:39,892 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1916, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1968, PETRI_PLACES=615, PETRI_TRANSITIONS=589} [2024-11-19 05:56:39,892 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 38 predicate places. [2024-11-19 05:56:39,892 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 589 transitions, 1968 flow [2024-11-19 05:56:39,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 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-19 05:56:39,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:39,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:39,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 05:56:39,894 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:39,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash 181317134, now seen corresponding path program 1 times [2024-11-19 05:56:39,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:39,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185021483] [2024-11-19 05:56:39,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:39,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:40,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:40,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:40,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185021483] [2024-11-19 05:56:40,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185021483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:40,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:40,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:40,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208741427] [2024-11-19 05:56:40,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:40,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:40,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:40,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:40,677 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-19 05:56:40,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 589 transitions, 1968 flow. Second operand has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 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-19 05:56:40,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:40,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-19 05:56:40,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:43,404 INFO L124 PetriNetUnfolderBase]: 613/15272 cut-off events. [2024-11-19 05:56:43,404 INFO L125 PetriNetUnfolderBase]: For 1263/1644 co-relation queries the response was YES. [2024-11-19 05:56:43,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20836 conditions, 15272 events. 613/15272 cut-off events. For 1263/1644 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 164110 event pairs, 40 based on Foata normal form. 52/14784 useless extension candidates. Maximal degree in co-relation 20706. Up to 416 conditions per place. [2024-11-19 05:56:43,594 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 37 selfloop transitions, 10 changer transitions 0/601 dead transitions. [2024-11-19 05:56:43,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 601 transitions, 2096 flow [2024-11-19 05:56:43,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:43,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:43,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3498 transitions. [2024-11-19 05:56:43,596 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9328 [2024-11-19 05:56:43,596 INFO L175 Difference]: Start difference. First operand has 615 places, 589 transitions, 1968 flow. Second operand 6 states and 3498 transitions. [2024-11-19 05:56:43,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 601 transitions, 2096 flow [2024-11-19 05:56:43,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 601 transitions, 2092 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:43,617 INFO L231 Difference]: Finished difference. Result has 621 places, 591 transitions, 2012 flow [2024-11-19 05:56:43,618 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1960, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2012, PETRI_PLACES=621, PETRI_TRANSITIONS=591} [2024-11-19 05:56:43,618 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 44 predicate places. [2024-11-19 05:56:43,618 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 591 transitions, 2012 flow [2024-11-19 05:56:43,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.0) internal successors, (3468), 6 states have internal predecessors, (3468), 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-19 05:56:43,618 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:43,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:43,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 05:56:43,619 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:43,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:43,619 INFO L85 PathProgramCache]: Analyzing trace with hash 830114333, now seen corresponding path program 1 times [2024-11-19 05:56:43,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:43,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007815436] [2024-11-19 05:56:43,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:43,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:43,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:43,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007815436] [2024-11-19 05:56:43,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007815436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:43,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:43,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:43,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892832594] [2024-11-19 05:56:43,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:43,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:43,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:43,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:43,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:43,699 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 625 [2024-11-19 05:56:43,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 591 transitions, 2012 flow. Second operand has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 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-19 05:56:43,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:43,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 625 [2024-11-19 05:56:43,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:46,353 INFO L124 PetriNetUnfolderBase]: 570/15087 cut-off events. [2024-11-19 05:56:46,354 INFO L125 PetriNetUnfolderBase]: For 1320/1733 co-relation queries the response was YES. [2024-11-19 05:56:46,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21315 conditions, 15087 events. 570/15087 cut-off events. For 1320/1733 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 158717 event pairs, 101 based on Foata normal form. 7/14601 useless extension candidates. Maximal degree in co-relation 21183. Up to 712 conditions per place. [2024-11-19 05:56:46,530 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 19 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2024-11-19 05:56:46,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 592 transitions, 2058 flow [2024-11-19 05:56:46,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:46,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1789 transitions. [2024-11-19 05:56:46,532 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9541333333333334 [2024-11-19 05:56:46,532 INFO L175 Difference]: Start difference. First operand has 621 places, 591 transitions, 2012 flow. Second operand 3 states and 1789 transitions. [2024-11-19 05:56:46,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 592 transitions, 2058 flow [2024-11-19 05:56:46,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 592 transitions, 2054 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:46,556 INFO L231 Difference]: Finished difference. Result has 621 places, 590 transitions, 2010 flow [2024-11-19 05:56:46,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=2006, PETRI_DIFFERENCE_MINUEND_PLACES=619, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2010, PETRI_PLACES=621, PETRI_TRANSITIONS=590} [2024-11-19 05:56:46,557 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 44 predicate places. [2024-11-19 05:56:46,557 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 590 transitions, 2010 flow [2024-11-19 05:56:46,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.0) internal successors, (1776), 3 states have internal predecessors, (1776), 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-19 05:56:46,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:46,558 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:46,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 05:56:46,558 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:46,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:46,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1988634443, now seen corresponding path program 1 times [2024-11-19 05:56:46,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:46,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101102630] [2024-11-19 05:56:46,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:46,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:46,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101102630] [2024-11-19 05:56:46,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101102630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:46,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:46,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:56:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708782707] [2024-11-19 05:56:46,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:46,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:56:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:46,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:56:46,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:56:47,312 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 575 out of 625 [2024-11-19 05:56:47,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 590 transitions, 2010 flow. Second operand has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 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-19 05:56:47,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:47,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 575 of 625 [2024-11-19 05:56:47,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:51,293 INFO L124 PetriNetUnfolderBase]: 939/17051 cut-off events. [2024-11-19 05:56:51,293 INFO L125 PetriNetUnfolderBase]: For 1874/1932 co-relation queries the response was YES. [2024-11-19 05:56:51,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24197 conditions, 17051 events. 939/17051 cut-off events. For 1874/1932 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 195352 event pairs, 61 based on Foata normal form. 76/16474 useless extension candidates. Maximal degree in co-relation 24062. Up to 606 conditions per place. [2024-11-19 05:56:51,577 INFO L140 encePairwiseOnDemand]: 614/625 looper letters, 29 selfloop transitions, 6 changer transitions 173/601 dead transitions. [2024-11-19 05:56:51,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 601 transitions, 2131 flow [2024-11-19 05:56:51,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:56:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:56:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3496 transitions. [2024-11-19 05:56:51,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9322666666666667 [2024-11-19 05:56:51,579 INFO L175 Difference]: Start difference. First operand has 621 places, 590 transitions, 2010 flow. Second operand 6 states and 3496 transitions. [2024-11-19 05:56:51,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 601 transitions, 2131 flow [2024-11-19 05:56:51,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 601 transitions, 2127 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:51,609 INFO L231 Difference]: Finished difference. Result has 622 places, 420 transitions, 1411 flow [2024-11-19 05:56:51,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=2002, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1411, PETRI_PLACES=622, PETRI_TRANSITIONS=420} [2024-11-19 05:56:51,610 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, 45 predicate places. [2024-11-19 05:56:51,611 INFO L471 AbstractCegarLoop]: Abstraction has has 622 places, 420 transitions, 1411 flow [2024-11-19 05:56:51,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.1666666666666) internal successors, (3469), 6 states have internal predecessors, (3469), 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-19 05:56:51,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:51,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:51,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-19 05:56:51,612 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:51,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:51,612 INFO L85 PathProgramCache]: Analyzing trace with hash 2012694518, now seen corresponding path program 1 times [2024-11-19 05:56:51,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:51,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173874887] [2024-11-19 05:56:51,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:51,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:51,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:51,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173874887] [2024-11-19 05:56:51,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173874887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:51,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:51,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:51,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324940725] [2024-11-19 05:56:51,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:51,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:51,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:51,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:51,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:51,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 625 [2024-11-19 05:56:51,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 420 transitions, 1411 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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-19 05:56:51,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:51,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 625 [2024-11-19 05:56:51,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:52,641 INFO L124 PetriNetUnfolderBase]: 407/4947 cut-off events. [2024-11-19 05:56:52,642 INFO L125 PetriNetUnfolderBase]: For 1417/1429 co-relation queries the response was YES. [2024-11-19 05:56:52,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8375 conditions, 4947 events. 407/4947 cut-off events. For 1417/1429 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 38324 event pairs, 208 based on Foata normal form. 0/4694 useless extension candidates. Maximal degree in co-relation 8242. Up to 520 conditions per place. [2024-11-19 05:56:52,721 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 14 selfloop transitions, 2 changer transitions 10/421 dead transitions. [2024-11-19 05:56:52,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 498 places, 421 transitions, 1447 flow [2024-11-19 05:56:52,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:52,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2024-11-19 05:56:52,723 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9514666666666667 [2024-11-19 05:56:52,723 INFO L175 Difference]: Start difference. First operand has 622 places, 420 transitions, 1411 flow. Second operand 3 states and 1784 transitions. [2024-11-19 05:56:52,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 498 places, 421 transitions, 1447 flow [2024-11-19 05:56:52,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 442 places, 421 transitions, 1297 flow, removed 5 selfloop flow, removed 56 redundant places. [2024-11-19 05:56:52,737 INFO L231 Difference]: Finished difference. Result has 442 places, 409 transitions, 1191 flow [2024-11-19 05:56:52,737 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=442, PETRI_TRANSITIONS=409} [2024-11-19 05:56:52,738 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -135 predicate places. [2024-11-19 05:56:52,738 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 409 transitions, 1191 flow [2024-11-19 05:56:52,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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-19 05:56:52,738 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:52,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 05:56:52,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 05:56:52,739 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-19 05:56:52,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:52,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1499121597, now seen corresponding path program 1 times [2024-11-19 05:56:52,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:52,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501177400] [2024-11-19 05:56:52,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 05:56:52,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:52,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501177400] [2024-11-19 05:56:52,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501177400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:52,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:52,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:52,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175819439] [2024-11-19 05:56:52,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:52,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:52,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:52,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:52,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:52,811 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 589 out of 625 [2024-11-19 05:56:52,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 409 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 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-19 05:56:52,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:52,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 589 of 625 [2024-11-19 05:56:52,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:53,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1596] thread2EXIT-->L96: Formula: (and (= 0 v_thread2Thread1of1ForFork1_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork1_thidvar0_4) (= 0 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar2=v_thread2Thread1of1ForFork1_thidvar2_4, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[][268], [Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 709#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork1_#t~short6|) (= ~i_BC~0 0)), Black: 692#(= ~i_BC~0 0), Black: 646#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 838#true, 628#(= |#race~Bn~0| 0), Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 717#(not |thread3Thread1of1ForFork2_#t~short11|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork1_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 661#true, Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 720#true, 768#true, 256#L96true, 654#(= |#race~A~0| 0), 884#true, Black: 739#(and (not |thread3Thread1of1ForFork2_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), Black: 722#(= ~i_AC~0 0), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 747#(= ~i_AB~0 0), Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 684#(and (<= ~An~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), 115#L71-3true, 667#(= ~i_AB~0 0), 881#true, 616#(= |#race~An~0| 0), Black: 764#(and (<= ~Bn~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), 663#(= |#race~B~0| 0), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0))]) [2024-11-19 05:56:53,368 INFO L294 olderBase$Statistics]: this new event has 441 ancestors and is cut-off event [2024-11-19 05:56:53,368 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2024-11-19 05:56:53,368 INFO L297 olderBase$Statistics]: existing Event has 368 ancestors and is cut-off event [2024-11-19 05:56:53,369 INFO L297 olderBase$Statistics]: existing Event has 396 ancestors and is cut-off event [2024-11-19 05:56:53,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1559] L71-10-->L71-11: Formula: (= |v_#race~C~0_4| 0) InVars {} OutVars{#race~C~0=|v_#race~C~0_4|} AuxVars[] AssignedVars[#race~C~0][358], [113#L95-1true, 407#L60-11true, Black: 701#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 709#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork1_#t~short6|) (= ~i_BC~0 0)), Black: 692#(= ~i_BC~0 0), Black: 646#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 696#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 838#true, 628#(= |#race~Bn~0| 0), Black: 703#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 717#(not |thread3Thread1of1ForFork2_#t~short11|), Black: 652#true, 840#(= |#race~C~0| 0), Black: 658#(not |thread2Thread1of1ForFork1_#t~short6|), 634#(= |#race~Cn~0| 0), Black: 661#true, 720#true, Black: 779#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 768#true, 654#(= |#race~A~0| 0), 884#true, Black: 739#(and (not |thread3Thread1of1ForFork2_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), Black: 722#(= ~i_AC~0 0), Black: 726#(and (= ~i_AC~0 0) (<= ~An~0 0)), 747#(= ~i_AB~0 0), 252#L71-11true, Black: 678#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 684#(and (<= ~An~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 671#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 676#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), 667#(= ~i_AB~0 0), 881#true, 616#(= |#race~An~0| 0), Black: 764#(and (<= ~Bn~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), 663#(= |#race~B~0| 0), Black: 751#(and (<= ~Bn~0 0) (= ~i_AB~0 0))]) [2024-11-19 05:56:53,377 INFO L294 olderBase$Statistics]: this new event has 434 ancestors and is cut-off event [2024-11-19 05:56:53,377 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-19 05:56:53,377 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-11-19 05:56:53,377 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-19 05:56:53,392 INFO L124 PetriNetUnfolderBase]: 489/4087 cut-off events. [2024-11-19 05:56:53,393 INFO L125 PetriNetUnfolderBase]: For 712/740 co-relation queries the response was YES. [2024-11-19 05:56:53,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5913 conditions, 4087 events. 489/4087 cut-off events. For 712/740 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 32274 event pairs, 216 based on Foata normal form. 0/3853 useless extension candidates. Maximal degree in co-relation 5813. Up to 517 conditions per place. [2024-11-19 05:56:53,440 INFO L140 encePairwiseOnDemand]: 622/625 looper letters, 0 selfloop transitions, 0 changer transitions 410/410 dead transitions. [2024-11-19 05:56:53,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 410 transitions, 1227 flow [2024-11-19 05:56:53,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:53,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:53,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1784 transitions. [2024-11-19 05:56:53,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9514666666666667 [2024-11-19 05:56:53,442 INFO L175 Difference]: Start difference. First operand has 442 places, 409 transitions, 1191 flow. Second operand 3 states and 1784 transitions. [2024-11-19 05:56:53,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 410 transitions, 1227 flow [2024-11-19 05:56:53,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 410 transitions, 1194 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-11-19 05:56:53,447 INFO L231 Difference]: Finished difference. Result has 426 places, 0 transitions, 0 flow [2024-11-19 05:56:53,447 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=625, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=426, PETRI_TRANSITIONS=0} [2024-11-19 05:56:53,448 INFO L277 CegarLoopForPetriNet]: 577 programPoint places, -151 predicate places. [2024-11-19 05:56:53,448 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 0 transitions, 0 flow [2024-11-19 05:56:53,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 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-19 05:56:53,450 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (116 of 117 remaining) [2024-11-19 05:56:53,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (115 of 117 remaining) [2024-11-19 05:56:53,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (114 of 117 remaining) [2024-11-19 05:56:53,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (113 of 117 remaining) [2024-11-19 05:56:53,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (112 of 117 remaining) [2024-11-19 05:56:53,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (111 of 117 remaining) [2024-11-19 05:56:53,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (110 of 117 remaining) [2024-11-19 05:56:53,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (109 of 117 remaining) [2024-11-19 05:56:53,451 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (108 of 117 remaining) [2024-11-19 05:56:53,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (107 of 117 remaining) [2024-11-19 05:56:53,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (106 of 117 remaining) [2024-11-19 05:56:53,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (105 of 117 remaining) [2024-11-19 05:56:53,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (104 of 117 remaining) [2024-11-19 05:56:53,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (103 of 117 remaining) [2024-11-19 05:56:53,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (102 of 117 remaining) [2024-11-19 05:56:53,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (101 of 117 remaining) [2024-11-19 05:56:53,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (100 of 117 remaining) [2024-11-19 05:56:53,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (99 of 117 remaining) [2024-11-19 05:56:53,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (98 of 117 remaining) [2024-11-19 05:56:53,452 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (97 of 117 remaining) [2024-11-19 05:56:53,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (96 of 117 remaining) [2024-11-19 05:56:53,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (95 of 117 remaining) [2024-11-19 05:56:53,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (94 of 117 remaining) [2024-11-19 05:56:53,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (93 of 117 remaining) [2024-11-19 05:56:53,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (92 of 117 remaining) [2024-11-19 05:56:53,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (91 of 117 remaining) [2024-11-19 05:56:53,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (90 of 117 remaining) [2024-11-19 05:56:53,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (89 of 117 remaining) [2024-11-19 05:56:53,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (88 of 117 remaining) [2024-11-19 05:56:53,453 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (87 of 117 remaining) [2024-11-19 05:56:53,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (86 of 117 remaining) [2024-11-19 05:56:53,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (85 of 117 remaining) [2024-11-19 05:56:53,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (84 of 117 remaining) [2024-11-19 05:56:53,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (83 of 117 remaining) [2024-11-19 05:56:53,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (82 of 117 remaining) [2024-11-19 05:56:53,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (81 of 117 remaining) [2024-11-19 05:56:53,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (80 of 117 remaining) [2024-11-19 05:56:53,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (79 of 117 remaining) [2024-11-19 05:56:53,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (78 of 117 remaining) [2024-11-19 05:56:53,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (77 of 117 remaining) [2024-11-19 05:56:53,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (76 of 117 remaining) [2024-11-19 05:56:53,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (75 of 117 remaining) [2024-11-19 05:56:53,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (74 of 117 remaining) [2024-11-19 05:56:53,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (73 of 117 remaining) [2024-11-19 05:56:53,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (72 of 117 remaining) [2024-11-19 05:56:53,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (71 of 117 remaining) [2024-11-19 05:56:53,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (70 of 117 remaining) [2024-11-19 05:56:53,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (69 of 117 remaining) [2024-11-19 05:56:53,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (68 of 117 remaining) [2024-11-19 05:56:53,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (67 of 117 remaining) [2024-11-19 05:56:53,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (66 of 117 remaining) [2024-11-19 05:56:53,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (65 of 117 remaining) [2024-11-19 05:56:53,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (64 of 117 remaining) [2024-11-19 05:56:53,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (63 of 117 remaining) [2024-11-19 05:56:53,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (62 of 117 remaining) [2024-11-19 05:56:53,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (61 of 117 remaining) [2024-11-19 05:56:53,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (60 of 117 remaining) [2024-11-19 05:56:53,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (59 of 117 remaining) [2024-11-19 05:56:53,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (58 of 117 remaining) [2024-11-19 05:56:53,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (57 of 117 remaining) [2024-11-19 05:56:53,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (56 of 117 remaining) [2024-11-19 05:56:53,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (55 of 117 remaining) [2024-11-19 05:56:53,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (54 of 117 remaining) [2024-11-19 05:56:53,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (53 of 117 remaining) [2024-11-19 05:56:53,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (52 of 117 remaining) [2024-11-19 05:56:53,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (51 of 117 remaining) [2024-11-19 05:56:53,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (50 of 117 remaining) [2024-11-19 05:56:53,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (49 of 117 remaining) [2024-11-19 05:56:53,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (48 of 117 remaining) [2024-11-19 05:56:53,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (47 of 117 remaining) [2024-11-19 05:56:53,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (46 of 117 remaining) [2024-11-19 05:56:53,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (45 of 117 remaining) [2024-11-19 05:56:53,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (44 of 117 remaining) [2024-11-19 05:56:53,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (43 of 117 remaining) [2024-11-19 05:56:53,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (42 of 117 remaining) [2024-11-19 05:56:53,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (41 of 117 remaining) [2024-11-19 05:56:53,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (40 of 117 remaining) [2024-11-19 05:56:53,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (39 of 117 remaining) [2024-11-19 05:56:53,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 117 remaining) [2024-11-19 05:56:53,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 117 remaining) [2024-11-19 05:56:53,458 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 117 remaining) [2024-11-19 05:56:53,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (35 of 117 remaining) [2024-11-19 05:56:53,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (34 of 117 remaining) [2024-11-19 05:56:53,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (33 of 117 remaining) [2024-11-19 05:56:53,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (32 of 117 remaining) [2024-11-19 05:56:53,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (31 of 117 remaining) [2024-11-19 05:56:53,459 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (30 of 117 remaining) [2024-11-19 05:56:53,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (29 of 117 remaining) [2024-11-19 05:56:53,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (28 of 117 remaining) [2024-11-19 05:56:53,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (27 of 117 remaining) [2024-11-19 05:56:53,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (26 of 117 remaining) [2024-11-19 05:56:53,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (25 of 117 remaining) [2024-11-19 05:56:53,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (24 of 117 remaining) [2024-11-19 05:56:53,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 117 remaining) [2024-11-19 05:56:53,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 117 remaining) [2024-11-19 05:56:53,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 117 remaining) [2024-11-19 05:56:53,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 117 remaining) [2024-11-19 05:56:53,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (19 of 117 remaining) [2024-11-19 05:56:53,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 117 remaining) [2024-11-19 05:56:53,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (17 of 117 remaining) [2024-11-19 05:56:53,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 117 remaining) [2024-11-19 05:56:53,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (15 of 117 remaining) [2024-11-19 05:56:53,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (14 of 117 remaining) [2024-11-19 05:56:53,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (13 of 117 remaining) [2024-11-19 05:56:53,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (12 of 117 remaining) [2024-11-19 05:56:53,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (11 of 117 remaining) [2024-11-19 05:56:53,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (10 of 117 remaining) [2024-11-19 05:56:53,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 117 remaining) [2024-11-19 05:56:53,461 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (8 of 117 remaining) [2024-11-19 05:56:53,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (7 of 117 remaining) [2024-11-19 05:56:53,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (6 of 117 remaining) [2024-11-19 05:56:53,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (5 of 117 remaining) [2024-11-19 05:56:53,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 117 remaining) [2024-11-19 05:56:53,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (3 of 117 remaining) [2024-11-19 05:56:53,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (2 of 117 remaining) [2024-11-19 05:56:53,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (1 of 117 remaining) [2024-11-19 05:56:53,462 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (0 of 117 remaining) [2024-11-19 05:56:53,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 05:56:53,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:53,469 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:56:53,469 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:56:53,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:56:53 BasicIcfg [2024-11-19 05:56:53,474 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:56:53,475 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:56:53,475 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:56:53,475 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:56:53,475 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:07" (3/4) ... [2024-11-19 05:56:53,477 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:56:53,479 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:56:53,479 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:56:53,479 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 05:56:53,488 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2024-11-19 05:56:53,490 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:56:53,491 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 05:56:53,491 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:56:53,569 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:56:53,570 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:56:53,570 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:56:53,570 INFO L158 Benchmark]: Toolchain (without parser) took 47421.75ms. Allocated memory was 180.4MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 129.8MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-19 05:56:53,570 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 180.4MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:56:53,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.33ms. Allocated memory is still 180.4MB. Free memory was 129.1MB in the beginning and 114.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 05:56:53,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.02ms. Allocated memory is still 180.4MB. Free memory was 114.4MB in the beginning and 111.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:56:53,571 INFO L158 Benchmark]: Boogie Preprocessor took 65.16ms. Allocated memory is still 180.4MB. Free memory was 111.0MB in the beginning and 107.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:56:53,571 INFO L158 Benchmark]: RCFGBuilder took 844.13ms. Allocated memory is still 180.4MB. Free memory was 107.4MB in the beginning and 60.6MB in the end (delta: 46.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-11-19 05:56:53,571 INFO L158 Benchmark]: TraceAbstraction took 46037.62ms. Allocated memory was 180.4MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 59.9MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 984.4MB. Max. memory is 16.1GB. [2024-11-19 05:56:53,571 INFO L158 Benchmark]: Witness Printer took 94.99ms. Allocated memory is still 3.5GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 05:56:53,572 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.17ms. Allocated memory is still 180.4MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.33ms. Allocated memory is still 180.4MB. Free memory was 129.1MB in the beginning and 114.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.02ms. Allocated memory is still 180.4MB. Free memory was 114.4MB in the beginning and 111.0MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.16ms. Allocated memory is still 180.4MB. Free memory was 111.0MB in the beginning and 107.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 844.13ms. Allocated memory is still 180.4MB. Free memory was 107.4MB in the beginning and 60.6MB in the end (delta: 46.7MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 46037.62ms. Allocated memory was 180.4MB in the beginning and 3.5GB in the end (delta: 3.3GB). Free memory was 59.9MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 984.4MB. Max. memory is 16.1GB. * Witness Printer took 94.99ms. Allocated memory is still 3.5GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: 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 7 procedures, 788 locations, 117 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: 45.8s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 40.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7105 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4471 mSDsluCounter, 4508 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3576 mSDsCounter, 1378 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12231 IncrementalHoareTripleChecker+Invalid, 13609 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1378 mSolverCounterUnsat, 932 mSDtfsCounter, 12231 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2012occurred in iteration=30, InterpolantAutomatonStates: 179, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 5389 NumberOfCodeBlocks, 5389 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5355 ConstructedInterpolants, 0 QuantifiedInterpolants, 10193 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 23/23 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 78 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:56:53,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE