./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp2x6.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d 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/bench-exp2x6.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 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:58:25,452 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:58:25,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:58:25,534 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:58:25,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:58:25,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:58:25,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:58:25,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:58:25,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:58:25,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:58:25,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:58:25,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:58:25,572 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:58:25,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:58:25,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:58:25,574 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:58:25,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:58:25,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:58:25,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:58:25,579 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:58:25,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:58:25,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:58:25,580 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:58:25,580 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:58:25,580 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:58:25,580 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:58:25,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:58:25,581 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:58:25,581 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:58:25,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:58:25,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:58:25,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:58:25,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:58:25,582 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:58:25,582 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:58:25,583 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:58:25,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:58:25,583 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:58:25,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:58:25,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:58:25,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:58:25,586 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 -> 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 [2024-11-09 06:58:25,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:58:25,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:58:25,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:58:25,795 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:58:25,795 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:58:25,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2024-11-09 06:58:27,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:58:27,643 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:58:27,643 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2024-11-09 06:58:27,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2056d820/d60595112ebc43ce91ae2cc7365732f5/FLAG560b119c3 [2024-11-09 06:58:27,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2056d820/d60595112ebc43ce91ae2cc7365732f5 [2024-11-09 06:58:27,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:58:27,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:58:27,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:58:27,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:58:27,701 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:58:27,706 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:58:27" (1/1) ... [2024-11-09 06:58:27,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32cff072 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:27, skipping insertion in model container [2024-11-09 06:58:27,708 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:58:27" (1/1) ... [2024-11-09 06:58:27,761 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:58:28,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:58:28,137 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:58:28,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:58:28,184 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:58:28,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:28 WrapperNode [2024-11-09 06:58:28,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:58:28,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:58:28,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:58:28,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:58:28,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:28" (1/1) ... [2024-11-09 06:58:28,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:28" (1/1) ... [2024-11-09 06:58:28,234 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2024-11-09 06:58:28,234 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:58:28,235 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:58:28,235 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:58:28,236 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:58:28,245 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:28" (1/1) ... [2024-11-09 06:58:28,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:28" (1/1) ... [2024-11-09 06:58:28,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:28" (1/1) ... [2024-11-09 06:58:28,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:28" (1/1) ... [2024-11-09 06:58:28,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:28" (1/1) ... [2024-11-09 06:58:28,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:28" (1/1) ... [2024-11-09 06:58:28,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:28" (1/1) ... [2024-11-09 06:58:28,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:28" (1/1) ... [2024-11-09 06:58:28,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:58:28,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:58:28,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:58:28,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:58:28,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:28" (1/1) ... [2024-11-09 06:58:28,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:58:28,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:58:28,354 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-09 06:58:28,358 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-09 06:58:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:58:28,412 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 06:58:28,412 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 06:58:28,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 06:58:28,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 06:58:28,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 06:58:28,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 06:58:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-09 06:58:28,414 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-09 06:58:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:58:28,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:58:28,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:58:28,416 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:58:28,558 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:58:28,563 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:58:28,945 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:58:28,945 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:58:28,968 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:58:28,968 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 06:58:28,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:28 BoogieIcfgContainer [2024-11-09 06:58:28,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:58:28,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:58:28,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:58:28,973 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:58:28,973 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:58:27" (1/3) ... [2024-11-09 06:58:28,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c9043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:58:28, skipping insertion in model container [2024-11-09 06:58:28,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:58:28" (2/3) ... [2024-11-09 06:58:28,974 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18c9043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:58:28, skipping insertion in model container [2024-11-09 06:58:28,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:28" (3/3) ... [2024-11-09 06:58:28,975 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2024-11-09 06:58:28,989 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:58:28,989 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2024-11-09 06:58:28,990 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:58:29,231 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-09 06:58:29,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 402 places, 403 transitions, 834 flow [2024-11-09 06:58:29,392 INFO L124 PetriNetUnfolderBase]: 14/399 cut-off events. [2024-11-09 06:58:29,393 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 06:58:29,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 399 events. 14/399 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1161 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 305. Up to 2 conditions per place. [2024-11-09 06:58:29,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 402 places, 403 transitions, 834 flow [2024-11-09 06:58:29,422 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 380 places, 379 transitions, 782 flow [2024-11-09 06:58:29,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:58:29,443 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;@7c95b03d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:58:29,443 INFO L334 AbstractCegarLoop]: Starting to check reachability of 131 error locations. [2024-11-09 06:58:29,450 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:58:29,451 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-11-09 06:58:29,451 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:58:29,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:29,452 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] [2024-11-09 06:58:29,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:29,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:29,458 INFO L85 PathProgramCache]: Analyzing trace with hash 712131987, now seen corresponding path program 1 times [2024-11-09 06:58:29,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:29,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248500401] [2024-11-09 06:58:29,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:29,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:29,666 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-09 06:58:29,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:29,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248500401] [2024-11-09 06:58:29,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248500401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:29,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:29,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:29,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250927302] [2024-11-09 06:58:29,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:29,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:29,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:29,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:29,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:29,811 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 403 [2024-11-09 06:58:29,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 379 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 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-09 06:58:29,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:29,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 403 [2024-11-09 06:58:29,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:29,955 INFO L124 PetriNetUnfolderBase]: 49/589 cut-off events. [2024-11-09 06:58:29,955 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-11-09 06:58:29,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 589 events. 49/589 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2873 event pairs, 39 based on Foata normal form. 91/555 useless extension candidates. Maximal degree in co-relation 653. Up to 109 conditions per place. [2024-11-09 06:58:29,970 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 27 selfloop transitions, 2 changer transitions 1/373 dead transitions. [2024-11-09 06:58:29,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 373 transitions, 828 flow [2024-11-09 06:58:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2024-11-09 06:58:29,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9346567411083541 [2024-11-09 06:58:29,987 INFO L175 Difference]: Start difference. First operand has 380 places, 379 transitions, 782 flow. Second operand 3 states and 1130 transitions. [2024-11-09 06:58:29,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 373 transitions, 828 flow [2024-11-09 06:58:29,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 373 transitions, 812 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 06:58:29,998 INFO L231 Difference]: Finished difference. Result has 373 places, 372 transitions, 756 flow [2024-11-09 06:58:30,000 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=373, PETRI_TRANSITIONS=372} [2024-11-09 06:58:30,004 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -7 predicate places. [2024-11-09 06:58:30,004 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 372 transitions, 756 flow [2024-11-09 06:58:30,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 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-09 06:58:30,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:30,006 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] [2024-11-09 06:58:30,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:58:30,006 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:30,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:30,007 INFO L85 PathProgramCache]: Analyzing trace with hash -407433873, now seen corresponding path program 1 times [2024-11-09 06:58:30,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:30,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300847177] [2024-11-09 06:58:30,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:30,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:30,038 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-09 06:58:30,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:30,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300847177] [2024-11-09 06:58:30,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300847177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:30,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:30,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:30,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662950410] [2024-11-09 06:58:30,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:30,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:30,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:30,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:30,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:30,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 403 [2024-11-09 06:58:30,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 372 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 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-09 06:58:30,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:30,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 403 [2024-11-09 06:58:30,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:30,228 INFO L124 PetriNetUnfolderBase]: 49/587 cut-off events. [2024-11-09 06:58:30,228 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-09 06:58:30,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 587 events. 49/587 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2928 event pairs, 39 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 701. Up to 108 conditions per place. [2024-11-09 06:58:30,276 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 26 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2024-11-09 06:58:30,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 371 transitions, 810 flow [2024-11-09 06:58:30,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:30,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2024-11-09 06:58:30,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9321753515301903 [2024-11-09 06:58:30,280 INFO L175 Difference]: Start difference. First operand has 373 places, 372 transitions, 756 flow. Second operand 3 states and 1127 transitions. [2024-11-09 06:58:30,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 371 transitions, 810 flow [2024-11-09 06:58:30,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 371 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:30,288 INFO L231 Difference]: Finished difference. Result has 371 places, 371 transitions, 754 flow [2024-11-09 06:58:30,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=371, PETRI_TRANSITIONS=371} [2024-11-09 06:58:30,291 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -9 predicate places. [2024-11-09 06:58:30,291 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 371 transitions, 754 flow [2024-11-09 06:58:30,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 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-09 06:58:30,292 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:30,292 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] [2024-11-09 06:58:30,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:58:30,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:30,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:30,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1514659761, now seen corresponding path program 1 times [2024-11-09 06:58:30,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:30,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702226926] [2024-11-09 06:58:30,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:30,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:30,330 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-09 06:58:30,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:30,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702226926] [2024-11-09 06:58:30,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702226926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:30,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:30,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:30,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907807014] [2024-11-09 06:58:30,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:30,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:30,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:30,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:30,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:30,566 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 403 [2024-11-09 06:58:30,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 371 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 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-09 06:58:30,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:30,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 403 [2024-11-09 06:58:30,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:30,654 INFO L124 PetriNetUnfolderBase]: 49/541 cut-off events. [2024-11-09 06:58:30,654 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-09 06:58:30,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 541 events. 49/541 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2522 event pairs, 39 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 636. Up to 109 conditions per place. [2024-11-09 06:58:30,668 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2024-11-09 06:58:30,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 370 transitions, 810 flow [2024-11-09 06:58:30,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1125 transitions. [2024-11-09 06:58:30,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9305210918114144 [2024-11-09 06:58:30,673 INFO L175 Difference]: Start difference. First operand has 371 places, 371 transitions, 754 flow. Second operand 3 states and 1125 transitions. [2024-11-09 06:58:30,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 370 transitions, 810 flow [2024-11-09 06:58:30,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 370 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:30,678 INFO L231 Difference]: Finished difference. Result has 370 places, 370 transitions, 752 flow [2024-11-09 06:58:30,678 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=370, PETRI_TRANSITIONS=370} [2024-11-09 06:58:30,679 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -10 predicate places. [2024-11-09 06:58:30,680 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 370 transitions, 752 flow [2024-11-09 06:58:30,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 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-09 06:58:30,681 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:30,681 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:30,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:58:30,682 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:30,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:30,682 INFO L85 PathProgramCache]: Analyzing trace with hash -540435884, now seen corresponding path program 1 times [2024-11-09 06:58:30,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:30,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373089808] [2024-11-09 06:58:30,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:30,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:30,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:30,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:30,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373089808] [2024-11-09 06:58:30,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373089808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:30,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:30,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:30,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742964406] [2024-11-09 06:58:30,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:30,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:30,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:30,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:30,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:30,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 403 [2024-11-09 06:58:30,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 370 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 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-09 06:58:30,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:30,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 403 [2024-11-09 06:58:30,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:30,950 INFO L124 PetriNetUnfolderBase]: 49/495 cut-off events. [2024-11-09 06:58:30,950 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-09 06:58:30,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 495 events. 49/495 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2050 event pairs, 39 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 569. Up to 108 conditions per place. [2024-11-09 06:58:30,964 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 26 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2024-11-09 06:58:30,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 369 transitions, 806 flow [2024-11-09 06:58:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:30,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:30,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2024-11-09 06:58:30,968 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9321753515301903 [2024-11-09 06:58:30,968 INFO L175 Difference]: Start difference. First operand has 370 places, 370 transitions, 752 flow. Second operand 3 states and 1127 transitions. [2024-11-09 06:58:30,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 369 transitions, 806 flow [2024-11-09 06:58:30,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 369 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:30,975 INFO L231 Difference]: Finished difference. Result has 369 places, 369 transitions, 750 flow [2024-11-09 06:58:30,976 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=369, PETRI_TRANSITIONS=369} [2024-11-09 06:58:30,977 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2024-11-09 06:58:30,977 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 369 transitions, 750 flow [2024-11-09 06:58:30,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 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-09 06:58:30,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:30,979 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] [2024-11-09 06:58:30,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:58:30,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:30,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:30,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1419192477, now seen corresponding path program 1 times [2024-11-09 06:58:30,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:30,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770109198] [2024-11-09 06:58:30,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:30,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:31,049 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-09 06:58:31,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770109198] [2024-11-09 06:58:31,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770109198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:31,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:31,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:31,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745864889] [2024-11-09 06:58:31,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:31,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:31,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:31,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:31,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:31,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 403 [2024-11-09 06:58:31,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 369 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 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-09 06:58:31,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:31,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 403 [2024-11-09 06:58:31,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:31,415 INFO L124 PetriNetUnfolderBase]: 102/2206 cut-off events. [2024-11-09 06:58:31,415 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-09 06:58:31,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 2206 events. 102/2206 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 18712 event pairs, 51 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 2320. Up to 144 conditions per place. [2024-11-09 06:58:31,465 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 15 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2024-11-09 06:58:31,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 368 transitions, 782 flow [2024-11-09 06:58:31,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1149 transitions. [2024-11-09 06:58:31,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9503722084367245 [2024-11-09 06:58:31,468 INFO L175 Difference]: Start difference. First operand has 369 places, 369 transitions, 750 flow. Second operand 3 states and 1149 transitions. [2024-11-09 06:58:31,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 368 transitions, 782 flow [2024-11-09 06:58:31,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 368 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:31,476 INFO L231 Difference]: Finished difference. Result has 368 places, 368 transitions, 748 flow [2024-11-09 06:58:31,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=368, PETRI_TRANSITIONS=368} [2024-11-09 06:58:31,477 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -12 predicate places. [2024-11-09 06:58:31,477 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 368 transitions, 748 flow [2024-11-09 06:58:31,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 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-09 06:58:31,478 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:31,478 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] [2024-11-09 06:58:31,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:58:31,478 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:31,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:31,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1862157651, now seen corresponding path program 1 times [2024-11-09 06:58:31,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:31,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607900698] [2024-11-09 06:58:31,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:31,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:31,526 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-09 06:58:31,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:31,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607900698] [2024-11-09 06:58:31,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607900698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:31,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:31,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:31,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210837826] [2024-11-09 06:58:31,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:31,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:31,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:31,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:31,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:31,581 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 403 [2024-11-09 06:58:31,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 368 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 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-09 06:58:31,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:31,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 403 [2024-11-09 06:58:31,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:31,712 INFO L124 PetriNetUnfolderBase]: 76/573 cut-off events. [2024-11-09 06:58:31,712 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:58:31,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 573 events. 76/573 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2975 event pairs, 54 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 763. Up to 144 conditions per place. [2024-11-09 06:58:31,722 INFO L140 encePairwiseOnDemand]: 382/403 looper letters, 32 selfloop transitions, 9 changer transitions 0/360 dead transitions. [2024-11-09 06:58:31,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 360 transitions, 817 flow [2024-11-09 06:58:31,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:31,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:31,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions. [2024-11-09 06:58:31,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9048800661703887 [2024-11-09 06:58:31,725 INFO L175 Difference]: Start difference. First operand has 368 places, 368 transitions, 748 flow. Second operand 3 states and 1094 transitions. [2024-11-09 06:58:31,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 360 transitions, 817 flow [2024-11-09 06:58:31,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 813 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:31,733 INFO L231 Difference]: Finished difference. Result has 357 places, 357 transitions, 751 flow [2024-11-09 06:58:31,734 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=357, PETRI_TRANSITIONS=357} [2024-11-09 06:58:31,735 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -23 predicate places. [2024-11-09 06:58:31,735 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 357 transitions, 751 flow [2024-11-09 06:58:31,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 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-09 06:58:31,736 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:31,736 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] [2024-11-09 06:58:31,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:58:31,737 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:31,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1467833337, now seen corresponding path program 1 times [2024-11-09 06:58:31,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:31,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675280211] [2024-11-09 06:58:31,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:31,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:31,767 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-09 06:58:31,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:31,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675280211] [2024-11-09 06:58:31,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675280211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:31,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:31,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:31,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052777916] [2024-11-09 06:58:31,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:31,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:31,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:31,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:31,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:31,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 403 [2024-11-09 06:58:31,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 357 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 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-09 06:58:31,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:31,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 403 [2024-11-09 06:58:31,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:31,940 INFO L124 PetriNetUnfolderBase]: 76/563 cut-off events. [2024-11-09 06:58:31,940 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-09 06:58:31,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 563 events. 76/563 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3001 event pairs, 54 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 694. Up to 142 conditions per place. [2024-11-09 06:58:31,957 INFO L140 encePairwiseOnDemand]: 383/403 looper letters, 30 selfloop transitions, 9 changer transitions 0/350 dead transitions. [2024-11-09 06:58:31,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 350 transitions, 818 flow [2024-11-09 06:58:31,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:31,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2024-11-09 06:58:31,960 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9098428453267163 [2024-11-09 06:58:31,960 INFO L175 Difference]: Start difference. First operand has 357 places, 357 transitions, 751 flow. Second operand 3 states and 1100 transitions. [2024-11-09 06:58:31,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 350 transitions, 818 flow [2024-11-09 06:58:31,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 350 transitions, 809 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:58:31,966 INFO L231 Difference]: Finished difference. Result has 348 places, 347 transitions, 751 flow [2024-11-09 06:58:31,966 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=348, PETRI_TRANSITIONS=347} [2024-11-09 06:58:31,967 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -32 predicate places. [2024-11-09 06:58:31,967 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 347 transitions, 751 flow [2024-11-09 06:58:31,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 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-09 06:58:31,968 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:31,968 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] [2024-11-09 06:58:31,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:58:31,968 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:31,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:31,969 INFO L85 PathProgramCache]: Analyzing trace with hash 914972423, now seen corresponding path program 1 times [2024-11-09 06:58:31,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:31,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199438081] [2024-11-09 06:58:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:31,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:32,018 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-09 06:58:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199438081] [2024-11-09 06:58:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199438081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:32,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:32,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:32,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530741453] [2024-11-09 06:58:32,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:32,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:32,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:32,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:32,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:32,070 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 403 [2024-11-09 06:58:32,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 347 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 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-09 06:58:32,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:32,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 403 [2024-11-09 06:58:32,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:32,180 INFO L124 PetriNetUnfolderBase]: 83/744 cut-off events. [2024-11-09 06:58:32,180 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-11-09 06:58:32,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 744 events. 83/744 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4298 event pairs, 12 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 851. Up to 148 conditions per place. [2024-11-09 06:58:32,195 INFO L140 encePairwiseOnDemand]: 381/403 looper letters, 35 selfloop transitions, 10 changer transitions 0/343 dead transitions. [2024-11-09 06:58:32,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 343 transitions, 839 flow [2024-11-09 06:58:32,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1098 transitions. [2024-11-09 06:58:32,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9081885856079405 [2024-11-09 06:58:32,198 INFO L175 Difference]: Start difference. First operand has 348 places, 347 transitions, 751 flow. Second operand 3 states and 1098 transitions. [2024-11-09 06:58:32,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 343 transitions, 839 flow [2024-11-09 06:58:32,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 343 transitions, 830 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:58:32,204 INFO L231 Difference]: Finished difference. Result has 338 places, 337 transitions, 756 flow [2024-11-09 06:58:32,204 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=338, PETRI_TRANSITIONS=337} [2024-11-09 06:58:32,207 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -42 predicate places. [2024-11-09 06:58:32,207 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 337 transitions, 756 flow [2024-11-09 06:58:32,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 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-09 06:58:32,208 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:32,208 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] [2024-11-09 06:58:32,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:58:32,208 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:32,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:32,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1179774638, now seen corresponding path program 1 times [2024-11-09 06:58:32,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:32,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542574060] [2024-11-09 06:58:32,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:32,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:32,278 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-09 06:58:32,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542574060] [2024-11-09 06:58:32,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542574060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:32,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:32,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:58:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447250699] [2024-11-09 06:58:32,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:32,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:58:32,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:32,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:58:32,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:58:32,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 403 [2024-11-09 06:58:32,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 337 transitions, 756 flow. Second operand has 4 states, 4 states have (on average 377.25) internal successors, (1509), 4 states have internal predecessors, (1509), 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-09 06:58:32,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:32,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 403 [2024-11-09 06:58:32,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:32,430 INFO L124 PetriNetUnfolderBase]: 12/569 cut-off events. [2024-11-09 06:58:32,430 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 06:58:32,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 569 events. 12/569 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2425 event pairs, 0 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 474. Up to 26 conditions per place. [2024-11-09 06:58:32,438 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 19 selfloop transitions, 5 changer transitions 0/342 dead transitions. [2024-11-09 06:58:32,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 342 transitions, 814 flow [2024-11-09 06:58:32,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:58:32,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 06:58:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1905 transitions. [2024-11-09 06:58:32,443 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9454094292803971 [2024-11-09 06:58:32,443 INFO L175 Difference]: Start difference. First operand has 338 places, 337 transitions, 756 flow. Second operand 5 states and 1905 transitions. [2024-11-09 06:58:32,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 342 transitions, 814 flow [2024-11-09 06:58:32,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 342 transitions, 804 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:58:32,449 INFO L231 Difference]: Finished difference. Result has 345 places, 341 transitions, 784 flow [2024-11-09 06:58:32,450 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=784, PETRI_PLACES=345, PETRI_TRANSITIONS=341} [2024-11-09 06:58:32,451 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -35 predicate places. [2024-11-09 06:58:32,451 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 341 transitions, 784 flow [2024-11-09 06:58:32,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 377.25) internal successors, (1509), 4 states have internal predecessors, (1509), 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-09 06:58:32,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:32,452 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] [2024-11-09 06:58:32,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:58:32,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:32,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:32,453 INFO L85 PathProgramCache]: Analyzing trace with hash 155302156, now seen corresponding path program 1 times [2024-11-09 06:58:32,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:32,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972804955] [2024-11-09 06:58:32,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:32,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:32,491 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-09 06:58:32,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:32,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972804955] [2024-11-09 06:58:32,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972804955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:32,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:32,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:32,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140129863] [2024-11-09 06:58:32,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:32,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:32,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:32,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:32,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:32,547 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 403 [2024-11-09 06:58:32,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 341 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 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-09 06:58:32,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:32,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 403 [2024-11-09 06:58:32,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:32,766 INFO L124 PetriNetUnfolderBase]: 133/1059 cut-off events. [2024-11-09 06:58:32,767 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2024-11-09 06:58:32,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 1059 events. 133/1059 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 7162 event pairs, 20 based on Foata normal form. 1/979 useless extension candidates. Maximal degree in co-relation 1115. Up to 236 conditions per place. [2024-11-09 06:58:32,786 INFO L140 encePairwiseOnDemand]: 383/403 looper letters, 31 selfloop transitions, 9 changer transitions 10/338 dead transitions. [2024-11-09 06:58:32,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 338 transitions, 869 flow [2024-11-09 06:58:32,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:32,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:32,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2024-11-09 06:58:32,789 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.91232423490488 [2024-11-09 06:58:32,789 INFO L175 Difference]: Start difference. First operand has 345 places, 341 transitions, 784 flow. Second operand 3 states and 1103 transitions. [2024-11-09 06:58:32,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 338 transitions, 869 flow [2024-11-09 06:58:32,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 338 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:58:32,799 INFO L231 Difference]: Finished difference. Result has 337 places, 321 transitions, 772 flow [2024-11-09 06:58:32,800 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=337, PETRI_TRANSITIONS=321} [2024-11-09 06:58:32,801 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -43 predicate places. [2024-11-09 06:58:32,801 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 321 transitions, 772 flow [2024-11-09 06:58:32,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 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-09 06:58:32,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:32,802 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-09 06:58:32,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 06:58:32,803 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:32,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:32,803 INFO L85 PathProgramCache]: Analyzing trace with hash 658913523, now seen corresponding path program 1 times [2024-11-09 06:58:32,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:32,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514660763] [2024-11-09 06:58:32,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:32,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:32,868 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-09 06:58:32,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:32,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514660763] [2024-11-09 06:58:32,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514660763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:32,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:32,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259214243] [2024-11-09 06:58:32,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:32,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:32,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:32,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:32,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:32,891 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 403 [2024-11-09 06:58:32,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 321 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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-09 06:58:32,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:32,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 403 [2024-11-09 06:58:32,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:34,698 INFO L124 PetriNetUnfolderBase]: 751/9298 cut-off events. [2024-11-09 06:58:34,698 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2024-11-09 06:58:34,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12087 conditions, 9298 events. 751/9298 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 115215 event pairs, 349 based on Foata normal form. 0/8251 useless extension candidates. Maximal degree in co-relation 9115. Up to 1015 conditions per place. [2024-11-09 06:58:34,786 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 19 selfloop transitions, 4 changer transitions 0/324 dead transitions. [2024-11-09 06:58:34,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 324 transitions, 827 flow [2024-11-09 06:58:34,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2024-11-09 06:58:34,790 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9528535980148883 [2024-11-09 06:58:34,790 INFO L175 Difference]: Start difference. First operand has 337 places, 321 transitions, 772 flow. Second operand 3 states and 1152 transitions. [2024-11-09 06:58:34,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 324 transitions, 827 flow [2024-11-09 06:58:34,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 324 transitions, 818 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:58:34,803 INFO L231 Difference]: Finished difference. Result has 325 places, 321 transitions, 783 flow [2024-11-09 06:58:34,804 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=325, PETRI_TRANSITIONS=321} [2024-11-09 06:58:34,804 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -55 predicate places. [2024-11-09 06:58:34,805 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 321 transitions, 783 flow [2024-11-09 06:58:34,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 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-09 06:58:34,806 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:34,806 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:34,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 06:58:34,806 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:34,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:34,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1377303334, now seen corresponding path program 1 times [2024-11-09 06:58:34,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:34,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582107902] [2024-11-09 06:58:34,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:34,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:34,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:34,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582107902] [2024-11-09 06:58:34,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582107902] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:34,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:34,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:34,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837061902] [2024-11-09 06:58:34,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:34,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:34,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:34,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:34,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:34,963 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2024-11-09 06:58:34,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 321 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 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-09 06:58:34,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:34,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2024-11-09 06:58:34,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:35,594 INFO L124 PetriNetUnfolderBase]: 284/2834 cut-off events. [2024-11-09 06:58:35,594 INFO L125 PetriNetUnfolderBase]: For 95/107 co-relation queries the response was YES. [2024-11-09 06:58:35,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4016 conditions, 2834 events. 284/2834 cut-off events. For 95/107 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 26421 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 2727. Up to 339 conditions per place. [2024-11-09 06:58:35,636 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2024-11-09 06:58:35,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 323 transitions, 850 flow [2024-11-09 06:58:35,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:35,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2024-11-09 06:58:35,639 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2024-11-09 06:58:35,639 INFO L175 Difference]: Start difference. First operand has 325 places, 321 transitions, 783 flow. Second operand 3 states and 1131 transitions. [2024-11-09 06:58:35,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 323 transitions, 850 flow [2024-11-09 06:58:35,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 323 transitions, 850 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:58:35,646 INFO L231 Difference]: Finished difference. Result has 326 places, 320 transitions, 785 flow [2024-11-09 06:58:35,647 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=326, PETRI_TRANSITIONS=320} [2024-11-09 06:58:35,648 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -54 predicate places. [2024-11-09 06:58:35,648 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 320 transitions, 785 flow [2024-11-09 06:58:35,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 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-09 06:58:35,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:35,649 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] [2024-11-09 06:58:35,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 06:58:35,649 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:35,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1504126638, now seen corresponding path program 1 times [2024-11-09 06:58:35,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:35,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811052041] [2024-11-09 06:58:35,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:35,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:58:35,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:35,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811052041] [2024-11-09 06:58:35,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811052041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:35,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:35,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:35,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780414703] [2024-11-09 06:58:35,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:35,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:35,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:35,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:35,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:35,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2024-11-09 06:58:35,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 320 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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-09 06:58:35,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:35,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2024-11-09 06:58:35,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:36,777 INFO L124 PetriNetUnfolderBase]: 535/3683 cut-off events. [2024-11-09 06:58:36,777 INFO L125 PetriNetUnfolderBase]: For 379/387 co-relation queries the response was YES. [2024-11-09 06:58:36,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5758 conditions, 3683 events. 535/3683 cut-off events. For 379/387 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 36730 event pairs, 338 based on Foata normal form. 0/3346 useless extension candidates. Maximal degree in co-relation 5557. Up to 892 conditions per place. [2024-11-09 06:58:36,847 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2024-11-09 06:58:36,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 322 transitions, 850 flow [2024-11-09 06:58:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:36,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:36,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2024-11-09 06:58:36,851 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2024-11-09 06:58:36,851 INFO L175 Difference]: Start difference. First operand has 326 places, 320 transitions, 785 flow. Second operand 3 states and 1133 transitions. [2024-11-09 06:58:36,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 322 transitions, 850 flow [2024-11-09 06:58:36,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 322 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:36,859 INFO L231 Difference]: Finished difference. Result has 325 places, 319 transitions, 783 flow [2024-11-09 06:58:36,860 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=325, PETRI_TRANSITIONS=319} [2024-11-09 06:58:36,860 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -55 predicate places. [2024-11-09 06:58:36,860 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 319 transitions, 783 flow [2024-11-09 06:58:36,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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-09 06:58:36,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:36,862 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:36,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 06:58:36,862 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:36,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:36,863 INFO L85 PathProgramCache]: Analyzing trace with hash 420914911, now seen corresponding path program 1 times [2024-11-09 06:58:36,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:36,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224477002] [2024-11-09 06:58:36,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:36,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:36,897 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-09 06:58:36,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:36,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224477002] [2024-11-09 06:58:36,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224477002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:36,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:36,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:36,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465602122] [2024-11-09 06:58:36,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:36,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:36,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:36,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:36,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:36,986 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2024-11-09 06:58:36,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 319 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 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-09 06:58:36,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:36,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2024-11-09 06:58:36,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:37,358 INFO L124 PetriNetUnfolderBase]: 284/2810 cut-off events. [2024-11-09 06:58:37,358 INFO L125 PetriNetUnfolderBase]: For 107/116 co-relation queries the response was YES. [2024-11-09 06:58:37,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4017 conditions, 2810 events. 284/2810 cut-off events. For 107/116 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 26079 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 3417. Up to 339 conditions per place. [2024-11-09 06:58:37,401 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2024-11-09 06:58:37,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 321 transitions, 850 flow [2024-11-09 06:58:37,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:37,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2024-11-09 06:58:37,405 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2024-11-09 06:58:37,405 INFO L175 Difference]: Start difference. First operand has 325 places, 319 transitions, 783 flow. Second operand 3 states and 1131 transitions. [2024-11-09 06:58:37,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 321 transitions, 850 flow [2024-11-09 06:58:37,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 321 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:37,413 INFO L231 Difference]: Finished difference. Result has 324 places, 318 transitions, 781 flow [2024-11-09 06:58:37,414 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=781, PETRI_PLACES=324, PETRI_TRANSITIONS=318} [2024-11-09 06:58:37,414 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -56 predicate places. [2024-11-09 06:58:37,414 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 318 transitions, 781 flow [2024-11-09 06:58:37,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 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-09 06:58:37,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:37,415 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] [2024-11-09 06:58:37,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 06:58:37,415 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:37,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:37,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1217757879, now seen corresponding path program 1 times [2024-11-09 06:58:37,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:37,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488812560] [2024-11-09 06:58:37,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:37,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:37,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:37,447 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-09 06:58:37,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:37,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488812560] [2024-11-09 06:58:37,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488812560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:37,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:37,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:37,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516609642] [2024-11-09 06:58:37,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:37,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:37,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:37,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:37,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:37,500 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2024-11-09 06:58:37,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 318 transitions, 781 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 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-09 06:58:37,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:37,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2024-11-09 06:58:37,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:37,909 INFO L124 PetriNetUnfolderBase]: 313/2791 cut-off events. [2024-11-09 06:58:37,909 INFO L125 PetriNetUnfolderBase]: For 249/252 co-relation queries the response was YES. [2024-11-09 06:58:37,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 2791 events. 313/2791 cut-off events. For 249/252 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 25674 event pairs, 169 based on Foata normal form. 0/2533 useless extension candidates. Maximal degree in co-relation 3842. Up to 440 conditions per place. [2024-11-09 06:58:37,962 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/320 dead transitions. [2024-11-09 06:58:37,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 320 transitions, 850 flow [2024-11-09 06:58:37,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:37,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2024-11-09 06:58:37,965 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2024-11-09 06:58:37,965 INFO L175 Difference]: Start difference. First operand has 324 places, 318 transitions, 781 flow. Second operand 3 states and 1131 transitions. [2024-11-09 06:58:37,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 320 transitions, 850 flow [2024-11-09 06:58:37,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 320 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:37,971 INFO L231 Difference]: Finished difference. Result has 323 places, 317 transitions, 779 flow [2024-11-09 06:58:37,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=779, PETRI_PLACES=323, PETRI_TRANSITIONS=317} [2024-11-09 06:58:37,972 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -57 predicate places. [2024-11-09 06:58:37,972 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 317 transitions, 779 flow [2024-11-09 06:58:37,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 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-09 06:58:37,974 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:37,974 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] [2024-11-09 06:58:37,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 06:58:37,974 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:37,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash -516868665, now seen corresponding path program 1 times [2024-11-09 06:58:37,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:37,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115445731] [2024-11-09 06:58:37,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:38,008 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-09 06:58:38,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:38,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115445731] [2024-11-09 06:58:38,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115445731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:38,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:38,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:38,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355008593] [2024-11-09 06:58:38,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:38,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:38,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:38,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:38,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:38,066 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2024-11-09 06:58:38,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 317 transitions, 779 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-09 06:58:38,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:38,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2024-11-09 06:58:38,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:38,814 INFO L124 PetriNetUnfolderBase]: 547/3767 cut-off events. [2024-11-09 06:58:38,814 INFO L125 PetriNetUnfolderBase]: For 384/390 co-relation queries the response was YES. [2024-11-09 06:58:38,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5892 conditions, 3767 events. 547/3767 cut-off events. For 384/390 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 37303 event pairs, 338 based on Foata normal form. 0/3465 useless extension candidates. Maximal degree in co-relation 5380. Up to 892 conditions per place. [2024-11-09 06:58:38,904 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2024-11-09 06:58:38,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 319 transitions, 844 flow [2024-11-09 06:58:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2024-11-09 06:58:38,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2024-11-09 06:58:38,910 INFO L175 Difference]: Start difference. First operand has 323 places, 317 transitions, 779 flow. Second operand 3 states and 1133 transitions. [2024-11-09 06:58:38,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 319 transitions, 844 flow [2024-11-09 06:58:38,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 319 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:38,918 INFO L231 Difference]: Finished difference. Result has 322 places, 316 transitions, 777 flow [2024-11-09 06:58:38,918 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=322, PETRI_TRANSITIONS=316} [2024-11-09 06:58:38,919 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -58 predicate places. [2024-11-09 06:58:38,919 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 316 transitions, 777 flow [2024-11-09 06:58:38,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-09 06:58:38,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:38,920 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] [2024-11-09 06:58:38,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 06:58:38,920 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:38,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:38,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1237039550, now seen corresponding path program 1 times [2024-11-09 06:58:38,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:38,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014330094] [2024-11-09 06:58:38,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:38,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:38,954 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-09 06:58:38,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:38,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014330094] [2024-11-09 06:58:38,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014330094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:38,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:38,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:38,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936865868] [2024-11-09 06:58:38,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:38,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:38,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:38,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:38,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:39,062 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2024-11-09 06:58:39,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 316 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 371.6666666666667) internal successors, (1115), 3 states have internal predecessors, (1115), 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-09 06:58:39,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:39,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2024-11-09 06:58:39,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:39,447 INFO L124 PetriNetUnfolderBase]: 190/2157 cut-off events. [2024-11-09 06:58:39,448 INFO L125 PetriNetUnfolderBase]: For 185/192 co-relation queries the response was YES. [2024-11-09 06:58:39,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 2157 events. 190/2157 cut-off events. For 185/192 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 18178 event pairs, 84 based on Foata normal form. 1/1978 useless extension candidates. Maximal degree in co-relation 2379. Up to 254 conditions per place. [2024-11-09 06:58:39,478 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2024-11-09 06:58:39,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 318 transitions, 842 flow [2024-11-09 06:58:39,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2024-11-09 06:58:39,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2024-11-09 06:58:39,481 INFO L175 Difference]: Start difference. First operand has 322 places, 316 transitions, 777 flow. Second operand 3 states and 1133 transitions. [2024-11-09 06:58:39,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 318 transitions, 842 flow [2024-11-09 06:58:39,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 318 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:39,486 INFO L231 Difference]: Finished difference. Result has 321 places, 315 transitions, 775 flow [2024-11-09 06:58:39,487 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=321, PETRI_TRANSITIONS=315} [2024-11-09 06:58:39,487 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -59 predicate places. [2024-11-09 06:58:39,487 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 315 transitions, 775 flow [2024-11-09 06:58:39,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.6666666666667) internal successors, (1115), 3 states have internal predecessors, (1115), 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-09 06:58:39,488 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:39,488 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] [2024-11-09 06:58:39,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 06:58:39,488 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:39,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:39,488 INFO L85 PathProgramCache]: Analyzing trace with hash 40137862, now seen corresponding path program 1 times [2024-11-09 06:58:39,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:39,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186338872] [2024-11-09 06:58:39,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:39,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:39,516 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-09 06:58:39,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:39,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186338872] [2024-11-09 06:58:39,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186338872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:39,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:39,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:39,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381869105] [2024-11-09 06:58:39,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:39,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:39,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:39,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:39,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:39,592 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2024-11-09 06:58:39,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 315 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 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-09 06:58:39,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:39,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2024-11-09 06:58:39,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:40,041 INFO L124 PetriNetUnfolderBase]: 284/2762 cut-off events. [2024-11-09 06:58:40,042 INFO L125 PetriNetUnfolderBase]: For 106/115 co-relation queries the response was YES. [2024-11-09 06:58:40,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3967 conditions, 2762 events. 284/2762 cut-off events. For 106/115 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 25448 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 3436. Up to 339 conditions per place. [2024-11-09 06:58:40,096 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2024-11-09 06:58:40,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 317 transitions, 842 flow [2024-11-09 06:58:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2024-11-09 06:58:40,099 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2024-11-09 06:58:40,099 INFO L175 Difference]: Start difference. First operand has 321 places, 315 transitions, 775 flow. Second operand 3 states and 1131 transitions. [2024-11-09 06:58:40,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 317 transitions, 842 flow [2024-11-09 06:58:40,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 317 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:40,105 INFO L231 Difference]: Finished difference. Result has 320 places, 314 transitions, 773 flow [2024-11-09 06:58:40,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=320, PETRI_TRANSITIONS=314} [2024-11-09 06:58:40,107 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -60 predicate places. [2024-11-09 06:58:40,107 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 314 transitions, 773 flow [2024-11-09 06:58:40,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 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-09 06:58:40,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:40,108 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-09 06:58:40,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 06:58:40,108 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:40,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:40,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1043188198, now seen corresponding path program 1 times [2024-11-09 06:58:40,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:40,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811803967] [2024-11-09 06:58:40,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:40,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:40,158 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-09 06:58:40,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:40,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811803967] [2024-11-09 06:58:40,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811803967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:40,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:40,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:40,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475404631] [2024-11-09 06:58:40,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:40,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:40,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:40,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:40,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:40,237 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2024-11-09 06:58:40,238 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 314 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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-09 06:58:40,238 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:40,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2024-11-09 06:58:40,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:40,683 INFO L124 PetriNetUnfolderBase]: 313/2731 cut-off events. [2024-11-09 06:58:40,683 INFO L125 PetriNetUnfolderBase]: For 246/249 co-relation queries the response was YES. [2024-11-09 06:58:40,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3933 conditions, 2731 events. 313/2731 cut-off events. For 246/249 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 24851 event pairs, 169 based on Foata normal form. 0/2521 useless extension candidates. Maximal degree in co-relation 3818. Up to 440 conditions per place. [2024-11-09 06:58:40,745 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/316 dead transitions. [2024-11-09 06:58:40,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 316 transitions, 842 flow [2024-11-09 06:58:40,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2024-11-09 06:58:40,748 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2024-11-09 06:58:40,749 INFO L175 Difference]: Start difference. First operand has 320 places, 314 transitions, 773 flow. Second operand 3 states and 1131 transitions. [2024-11-09 06:58:40,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 316 transitions, 842 flow [2024-11-09 06:58:40,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 316 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:40,755 INFO L231 Difference]: Finished difference. Result has 319 places, 313 transitions, 771 flow [2024-11-09 06:58:40,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=319, PETRI_TRANSITIONS=313} [2024-11-09 06:58:40,755 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -61 predicate places. [2024-11-09 06:58:40,755 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 313 transitions, 771 flow [2024-11-09 06:58:40,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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-09 06:58:40,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:40,756 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:58:40,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 06:58:40,757 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:40,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1083503398, now seen corresponding path program 1 times [2024-11-09 06:58:40,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:40,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149359472] [2024-11-09 06:58:40,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:40,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:40,785 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-09 06:58:40,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:40,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149359472] [2024-11-09 06:58:40,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149359472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:40,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:40,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:40,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305611808] [2024-11-09 06:58:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:40,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:40,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:40,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:40,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:40,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2024-11-09 06:58:40,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 313 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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-09 06:58:40,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:40,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2024-11-09 06:58:40,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:41,657 INFO L124 PetriNetUnfolderBase]: 559/3834 cut-off events. [2024-11-09 06:58:41,658 INFO L125 PetriNetUnfolderBase]: For 384/390 co-relation queries the response was YES. [2024-11-09 06:58:41,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5995 conditions, 3834 events. 559/3834 cut-off events. For 384/390 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 37558 event pairs, 338 based on Foata normal form. 0/3582 useless extension candidates. Maximal degree in co-relation 5597. Up to 892 conditions per place. [2024-11-09 06:58:41,758 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2024-11-09 06:58:41,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 315 transitions, 836 flow [2024-11-09 06:58:41,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2024-11-09 06:58:41,762 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2024-11-09 06:58:41,762 INFO L175 Difference]: Start difference. First operand has 319 places, 313 transitions, 771 flow. Second operand 3 states and 1133 transitions. [2024-11-09 06:58:41,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 315 transitions, 836 flow [2024-11-09 06:58:41,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 315 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:41,770 INFO L231 Difference]: Finished difference. Result has 318 places, 312 transitions, 769 flow [2024-11-09 06:58:41,771 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=318, PETRI_TRANSITIONS=312} [2024-11-09 06:58:41,771 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -62 predicate places. [2024-11-09 06:58:41,771 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 312 transitions, 769 flow [2024-11-09 06:58:41,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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-09 06:58:41,772 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:41,772 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] [2024-11-09 06:58:41,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 06:58:41,773 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread4Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:41,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash 156162351, now seen corresponding path program 1 times [2024-11-09 06:58:41,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:41,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657469685] [2024-11-09 06:58:41,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:41,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:41,808 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-09 06:58:41,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:41,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657469685] [2024-11-09 06:58:41,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657469685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:41,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:41,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:41,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510364522] [2024-11-09 06:58:41,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:41,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:41,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:41,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:41,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:41,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2024-11-09 06:58:41,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 312 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 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-09 06:58:41,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:41,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2024-11-09 06:58:41,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:42,238 INFO L124 PetriNetUnfolderBase]: 190/2134 cut-off events. [2024-11-09 06:58:42,239 INFO L125 PetriNetUnfolderBase]: For 185/189 co-relation queries the response was YES. [2024-11-09 06:58:42,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2967 conditions, 2134 events. 190/2134 cut-off events. For 185/189 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 17824 event pairs, 84 based on Foata normal form. 0/1989 useless extension candidates. Maximal degree in co-relation 2560. Up to 254 conditions per place. [2024-11-09 06:58:42,287 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2024-11-09 06:58:42,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 314 transitions, 834 flow [2024-11-09 06:58:42,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2024-11-09 06:58:42,290 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2024-11-09 06:58:42,290 INFO L175 Difference]: Start difference. First operand has 318 places, 312 transitions, 769 flow. Second operand 3 states and 1133 transitions. [2024-11-09 06:58:42,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 314 transitions, 834 flow [2024-11-09 06:58:42,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 314 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:42,297 INFO L231 Difference]: Finished difference. Result has 317 places, 311 transitions, 767 flow [2024-11-09 06:58:42,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=317, PETRI_TRANSITIONS=311} [2024-11-09 06:58:42,298 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -63 predicate places. [2024-11-09 06:58:42,299 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 311 transitions, 767 flow [2024-11-09 06:58:42,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 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-09 06:58:42,299 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:42,300 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] [2024-11-09 06:58:42,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 06:58:42,300 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:42,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:42,301 INFO L85 PathProgramCache]: Analyzing trace with hash -856879925, now seen corresponding path program 1 times [2024-11-09 06:58:42,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:42,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16001449] [2024-11-09 06:58:42,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:42,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:42,333 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-09 06:58:42,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:42,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16001449] [2024-11-09 06:58:42,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16001449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:42,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:42,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:42,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137933419] [2024-11-09 06:58:42,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:42,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:42,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:42,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:42,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:42,396 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2024-11-09 06:58:42,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 311 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 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-09 06:58:42,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:42,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2024-11-09 06:58:42,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:42,698 INFO L124 PetriNetUnfolderBase]: 284/2714 cut-off events. [2024-11-09 06:58:42,698 INFO L125 PetriNetUnfolderBase]: For 106/115 co-relation queries the response was YES. [2024-11-09 06:58:42,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3919 conditions, 2714 events. 284/2714 cut-off events. For 106/115 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 24765 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 3520. Up to 339 conditions per place. [2024-11-09 06:58:42,741 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2024-11-09 06:58:42,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 313 transitions, 834 flow [2024-11-09 06:58:42,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:42,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2024-11-09 06:58:42,743 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2024-11-09 06:58:42,744 INFO L175 Difference]: Start difference. First operand has 317 places, 311 transitions, 767 flow. Second operand 3 states and 1131 transitions. [2024-11-09 06:58:42,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 313 transitions, 834 flow [2024-11-09 06:58:42,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 313 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:42,749 INFO L231 Difference]: Finished difference. Result has 316 places, 310 transitions, 765 flow [2024-11-09 06:58:42,749 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=765, PETRI_PLACES=316, PETRI_TRANSITIONS=310} [2024-11-09 06:58:42,749 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -64 predicate places. [2024-11-09 06:58:42,750 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 310 transitions, 765 flow [2024-11-09 06:58:42,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 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-09 06:58:42,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:42,750 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] [2024-11-09 06:58:42,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 06:58:42,751 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:42,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash 541891619, now seen corresponding path program 1 times [2024-11-09 06:58:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:42,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128910780] [2024-11-09 06:58:42,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:42,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:42,789 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-09 06:58:42,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:42,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128910780] [2024-11-09 06:58:42,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128910780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:42,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:42,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:42,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256838593] [2024-11-09 06:58:42,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:42,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:42,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:42,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:42,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:42,871 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2024-11-09 06:58:42,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 310 transitions, 765 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-09 06:58:42,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:42,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2024-11-09 06:58:42,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:43,319 INFO L124 PetriNetUnfolderBase]: 313/2671 cut-off events. [2024-11-09 06:58:43,319 INFO L125 PetriNetUnfolderBase]: For 243/246 co-relation queries the response was YES. [2024-11-09 06:58:43,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3873 conditions, 2671 events. 313/2671 cut-off events. For 243/246 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 23974 event pairs, 169 based on Foata normal form. 0/2509 useless extension candidates. Maximal degree in co-relation 3794. Up to 440 conditions per place. [2024-11-09 06:58:43,364 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/312 dead transitions. [2024-11-09 06:58:43,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 312 transitions, 834 flow [2024-11-09 06:58:43,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2024-11-09 06:58:43,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2024-11-09 06:58:43,366 INFO L175 Difference]: Start difference. First operand has 316 places, 310 transitions, 765 flow. Second operand 3 states and 1131 transitions. [2024-11-09 06:58:43,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 312 transitions, 834 flow [2024-11-09 06:58:43,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 312 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:43,371 INFO L231 Difference]: Finished difference. Result has 315 places, 309 transitions, 763 flow [2024-11-09 06:58:43,372 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=763, PETRI_PLACES=315, PETRI_TRANSITIONS=309} [2024-11-09 06:58:43,374 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -65 predicate places. [2024-11-09 06:58:43,374 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 309 transitions, 763 flow [2024-11-09 06:58:43,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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-09 06:58:43,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:43,375 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] [2024-11-09 06:58:43,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 06:58:43,375 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:43,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:43,375 INFO L85 PathProgramCache]: Analyzing trace with hash 41776435, now seen corresponding path program 1 times [2024-11-09 06:58:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:43,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959974509] [2024-11-09 06:58:43,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:43,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:43,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:43,402 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-09 06:58:43,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:43,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959974509] [2024-11-09 06:58:43,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959974509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:43,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:43,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:43,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014194372] [2024-11-09 06:58:43,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:43,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:43,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:43,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:43,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:43,458 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2024-11-09 06:58:43,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 309 transitions, 763 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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-09 06:58:43,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:43,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2024-11-09 06:58:43,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:44,067 INFO L124 PetriNetUnfolderBase]: 571/3895 cut-off events. [2024-11-09 06:58:44,068 INFO L125 PetriNetUnfolderBase]: For 384/390 co-relation queries the response was YES. [2024-11-09 06:58:44,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6092 conditions, 3895 events. 571/3895 cut-off events. For 384/390 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 37555 event pairs, 338 based on Foata normal form. 0/3703 useless extension candidates. Maximal degree in co-relation 5808. Up to 892 conditions per place. [2024-11-09 06:58:44,145 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2024-11-09 06:58:44,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 311 transitions, 828 flow [2024-11-09 06:58:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2024-11-09 06:58:44,149 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2024-11-09 06:58:44,149 INFO L175 Difference]: Start difference. First operand has 315 places, 309 transitions, 763 flow. Second operand 3 states and 1133 transitions. [2024-11-09 06:58:44,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 311 transitions, 828 flow [2024-11-09 06:58:44,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 311 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:44,156 INFO L231 Difference]: Finished difference. Result has 314 places, 308 transitions, 761 flow [2024-11-09 06:58:44,156 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=761, PETRI_PLACES=314, PETRI_TRANSITIONS=308} [2024-11-09 06:58:44,157 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -66 predicate places. [2024-11-09 06:58:44,157 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 308 transitions, 761 flow [2024-11-09 06:58:44,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 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-09 06:58:44,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:44,158 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] [2024-11-09 06:58:44,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 06:58:44,158 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread4Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:44,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:44,158 INFO L85 PathProgramCache]: Analyzing trace with hash 972063466, now seen corresponding path program 1 times [2024-11-09 06:58:44,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:44,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842874634] [2024-11-09 06:58:44,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:44,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:44,197 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-09 06:58:44,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:44,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842874634] [2024-11-09 06:58:44,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842874634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:44,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:44,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:44,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117605555] [2024-11-09 06:58:44,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:44,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:44,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:44,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:44,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:44,270 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2024-11-09 06:58:44,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 308 transitions, 761 flow. Second operand has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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-09 06:58:44,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:44,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2024-11-09 06:58:44,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:44,712 INFO L124 PetriNetUnfolderBase]: 190/2090 cut-off events. [2024-11-09 06:58:44,712 INFO L125 PetriNetUnfolderBase]: For 184/188 co-relation queries the response was YES. [2024-11-09 06:58:44,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 2090 events. 190/2090 cut-off events. For 184/188 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 17422 event pairs, 84 based on Foata normal form. 0/1983 useless extension candidates. Maximal degree in co-relation 2720. Up to 254 conditions per place. [2024-11-09 06:58:44,757 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2024-11-09 06:58:44,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 310 transitions, 826 flow [2024-11-09 06:58:44,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:44,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:44,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2024-11-09 06:58:44,761 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2024-11-09 06:58:44,761 INFO L175 Difference]: Start difference. First operand has 314 places, 308 transitions, 761 flow. Second operand 3 states and 1133 transitions. [2024-11-09 06:58:44,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 310 transitions, 826 flow [2024-11-09 06:58:44,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 310 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:44,769 INFO L231 Difference]: Finished difference. Result has 313 places, 307 transitions, 759 flow [2024-11-09 06:58:44,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=313, PETRI_TRANSITIONS=307} [2024-11-09 06:58:44,770 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -67 predicate places. [2024-11-09 06:58:44,771 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 307 transitions, 759 flow [2024-11-09 06:58:44,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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-09 06:58:44,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:44,772 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] [2024-11-09 06:58:44,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 06:58:44,772 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:44,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:44,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1502549434, now seen corresponding path program 1 times [2024-11-09 06:58:44,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:44,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962478369] [2024-11-09 06:58:44,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:44,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:44,806 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-09 06:58:44,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:44,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962478369] [2024-11-09 06:58:44,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962478369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:44,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:44,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:44,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545939533] [2024-11-09 06:58:44,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:44,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:44,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:44,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:44,882 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2024-11-09 06:58:44,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 307 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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-09 06:58:44,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:44,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2024-11-09 06:58:44,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:45,412 INFO L124 PetriNetUnfolderBase]: 313/2614 cut-off events. [2024-11-09 06:58:45,413 INFO L125 PetriNetUnfolderBase]: For 245/248 co-relation queries the response was YES. [2024-11-09 06:58:45,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3826 conditions, 2614 events. 313/2614 cut-off events. For 245/248 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 23193 event pairs, 169 based on Foata normal form. 0/2497 useless extension candidates. Maximal degree in co-relation 3616. Up to 440 conditions per place. [2024-11-09 06:58:45,477 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2024-11-09 06:58:45,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 309 transitions, 828 flow [2024-11-09 06:58:45,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:45,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2024-11-09 06:58:45,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2024-11-09 06:58:45,481 INFO L175 Difference]: Start difference. First operand has 313 places, 307 transitions, 759 flow. Second operand 3 states and 1131 transitions. [2024-11-09 06:58:45,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 309 transitions, 828 flow [2024-11-09 06:58:45,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 309 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:45,489 INFO L231 Difference]: Finished difference. Result has 312 places, 306 transitions, 757 flow [2024-11-09 06:58:45,490 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=757, PETRI_PLACES=312, PETRI_TRANSITIONS=306} [2024-11-09 06:58:45,490 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -68 predicate places. [2024-11-09 06:58:45,491 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 306 transitions, 757 flow [2024-11-09 06:58:45,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 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-09 06:58:45,491 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:58:45,491 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 06:58:45,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 06:58:45,492 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread4Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2024-11-09 06:58:45,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:58:45,492 INFO L85 PathProgramCache]: Analyzing trace with hash 2105120155, now seen corresponding path program 1 times [2024-11-09 06:58:45,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:58:45,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682010853] [2024-11-09 06:58:45,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:58:45,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:58:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:58:45,532 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-09 06:58:45,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:58:45,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682010853] [2024-11-09 06:58:45,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682010853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:58:45,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:58:45,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:58:45,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172897498] [2024-11-09 06:58:45,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:58:45,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:58:45,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:58:45,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:58:45,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:58:45,602 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2024-11-09 06:58:45,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 306 transitions, 757 flow. Second operand has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 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-09 06:58:45,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:58:45,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2024-11-09 06:58:45,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:58:46,018 INFO L124 PetriNetUnfolderBase]: 190/2066 cut-off events. [2024-11-09 06:58:46,018 INFO L125 PetriNetUnfolderBase]: For 175/179 co-relation queries the response was YES. [2024-11-09 06:58:46,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2881 conditions, 2066 events. 190/2066 cut-off events. For 175/179 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 17178 event pairs, 84 based on Foata normal form. 0/1977 useless extension candidates. Maximal degree in co-relation 2769. Up to 254 conditions per place. [2024-11-09 06:58:46,053 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 0 selfloop transitions, 0 changer transitions 308/308 dead transitions. [2024-11-09 06:58:46,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 308 transitions, 822 flow [2024-11-09 06:58:46,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:58:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:58:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2024-11-09 06:58:46,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2024-11-09 06:58:46,056 INFO L175 Difference]: Start difference. First operand has 312 places, 306 transitions, 757 flow. Second operand 3 states and 1133 transitions. [2024-11-09 06:58:46,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 308 transitions, 822 flow [2024-11-09 06:58:46,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 308 transitions, 818 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:58:46,062 INFO L231 Difference]: Finished difference. Result has 311 places, 0 transitions, 0 flow [2024-11-09 06:58:46,062 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=311, PETRI_TRANSITIONS=0} [2024-11-09 06:58:46,063 INFO L277 CegarLoopForPetriNet]: 380 programPoint places, -69 predicate places. [2024-11-09 06:58:46,063 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 0 transitions, 0 flow [2024-11-09 06:58:46,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 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-09 06:58:46,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (130 of 131 remaining) [2024-11-09 06:58:46,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (129 of 131 remaining) [2024-11-09 06:58:46,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (128 of 131 remaining) [2024-11-09 06:58:46,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (127 of 131 remaining) [2024-11-09 06:58:46,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (126 of 131 remaining) [2024-11-09 06:58:46,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (125 of 131 remaining) [2024-11-09 06:58:46,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (124 of 131 remaining) [2024-11-09 06:58:46,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (123 of 131 remaining) [2024-11-09 06:58:46,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (122 of 131 remaining) [2024-11-09 06:58:46,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (121 of 131 remaining) [2024-11-09 06:58:46,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (120 of 131 remaining) [2024-11-09 06:58:46,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (119 of 131 remaining) [2024-11-09 06:58:46,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (118 of 131 remaining) [2024-11-09 06:58:46,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (117 of 131 remaining) [2024-11-09 06:58:46,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (116 of 131 remaining) [2024-11-09 06:58:46,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (115 of 131 remaining) [2024-11-09 06:58:46,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (114 of 131 remaining) [2024-11-09 06:58:46,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (113 of 131 remaining) [2024-11-09 06:58:46,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (112 of 131 remaining) [2024-11-09 06:58:46,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (111 of 131 remaining) [2024-11-09 06:58:46,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (110 of 131 remaining) [2024-11-09 06:58:46,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (109 of 131 remaining) [2024-11-09 06:58:46,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (108 of 131 remaining) [2024-11-09 06:58:46,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (107 of 131 remaining) [2024-11-09 06:58:46,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (106 of 131 remaining) [2024-11-09 06:58:46,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (105 of 131 remaining) [2024-11-09 06:58:46,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (104 of 131 remaining) [2024-11-09 06:58:46,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (103 of 131 remaining) [2024-11-09 06:58:46,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (102 of 131 remaining) [2024-11-09 06:58:46,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (101 of 131 remaining) [2024-11-09 06:58:46,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (100 of 131 remaining) [2024-11-09 06:58:46,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (99 of 131 remaining) [2024-11-09 06:58:46,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (98 of 131 remaining) [2024-11-09 06:58:46,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (97 of 131 remaining) [2024-11-09 06:58:46,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (96 of 131 remaining) [2024-11-09 06:58:46,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (95 of 131 remaining) [2024-11-09 06:58:46,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (94 of 131 remaining) [2024-11-09 06:58:46,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (93 of 131 remaining) [2024-11-09 06:58:46,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (92 of 131 remaining) [2024-11-09 06:58:46,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (91 of 131 remaining) [2024-11-09 06:58:46,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (90 of 131 remaining) [2024-11-09 06:58:46,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (89 of 131 remaining) [2024-11-09 06:58:46,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (88 of 131 remaining) [2024-11-09 06:58:46,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (87 of 131 remaining) [2024-11-09 06:58:46,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (86 of 131 remaining) [2024-11-09 06:58:46,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (85 of 131 remaining) [2024-11-09 06:58:46,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (84 of 131 remaining) [2024-11-09 06:58:46,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (83 of 131 remaining) [2024-11-09 06:58:46,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (82 of 131 remaining) [2024-11-09 06:58:46,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (81 of 131 remaining) [2024-11-09 06:58:46,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (80 of 131 remaining) [2024-11-09 06:58:46,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (79 of 131 remaining) [2024-11-09 06:58:46,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (78 of 131 remaining) [2024-11-09 06:58:46,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (77 of 131 remaining) [2024-11-09 06:58:46,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (76 of 131 remaining) [2024-11-09 06:58:46,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (75 of 131 remaining) [2024-11-09 06:58:46,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (74 of 131 remaining) [2024-11-09 06:58:46,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (73 of 131 remaining) [2024-11-09 06:58:46,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (72 of 131 remaining) [2024-11-09 06:58:46,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (71 of 131 remaining) [2024-11-09 06:58:46,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (70 of 131 remaining) [2024-11-09 06:58:46,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (69 of 131 remaining) [2024-11-09 06:58:46,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (68 of 131 remaining) [2024-11-09 06:58:46,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (67 of 131 remaining) [2024-11-09 06:58:46,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (66 of 131 remaining) [2024-11-09 06:58:46,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (65 of 131 remaining) [2024-11-09 06:58:46,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (64 of 131 remaining) [2024-11-09 06:58:46,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (63 of 131 remaining) [2024-11-09 06:58:46,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (62 of 131 remaining) [2024-11-09 06:58:46,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (61 of 131 remaining) [2024-11-09 06:58:46,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (60 of 131 remaining) [2024-11-09 06:58:46,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (59 of 131 remaining) [2024-11-09 06:58:46,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (58 of 131 remaining) [2024-11-09 06:58:46,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (57 of 131 remaining) [2024-11-09 06:58:46,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (56 of 131 remaining) [2024-11-09 06:58:46,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (55 of 131 remaining) [2024-11-09 06:58:46,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (54 of 131 remaining) [2024-11-09 06:58:46,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (53 of 131 remaining) [2024-11-09 06:58:46,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (52 of 131 remaining) [2024-11-09 06:58:46,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (51 of 131 remaining) [2024-11-09 06:58:46,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (50 of 131 remaining) [2024-11-09 06:58:46,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (49 of 131 remaining) [2024-11-09 06:58:46,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (48 of 131 remaining) [2024-11-09 06:58:46,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (47 of 131 remaining) [2024-11-09 06:58:46,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (46 of 131 remaining) [2024-11-09 06:58:46,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (45 of 131 remaining) [2024-11-09 06:58:46,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (44 of 131 remaining) [2024-11-09 06:58:46,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (43 of 131 remaining) [2024-11-09 06:58:46,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (42 of 131 remaining) [2024-11-09 06:58:46,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (41 of 131 remaining) [2024-11-09 06:58:46,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (40 of 131 remaining) [2024-11-09 06:58:46,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (39 of 131 remaining) [2024-11-09 06:58:46,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (38 of 131 remaining) [2024-11-09 06:58:46,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (37 of 131 remaining) [2024-11-09 06:58:46,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (36 of 131 remaining) [2024-11-09 06:58:46,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (35 of 131 remaining) [2024-11-09 06:58:46,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (34 of 131 remaining) [2024-11-09 06:58:46,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (33 of 131 remaining) [2024-11-09 06:58:46,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (32 of 131 remaining) [2024-11-09 06:58:46,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (31 of 131 remaining) [2024-11-09 06:58:46,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (30 of 131 remaining) [2024-11-09 06:58:46,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (29 of 131 remaining) [2024-11-09 06:58:46,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (28 of 131 remaining) [2024-11-09 06:58:46,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (27 of 131 remaining) [2024-11-09 06:58:46,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (26 of 131 remaining) [2024-11-09 06:58:46,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (25 of 131 remaining) [2024-11-09 06:58:46,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (24 of 131 remaining) [2024-11-09 06:58:46,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (23 of 131 remaining) [2024-11-09 06:58:46,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (22 of 131 remaining) [2024-11-09 06:58:46,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (21 of 131 remaining) [2024-11-09 06:58:46,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (20 of 131 remaining) [2024-11-09 06:58:46,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (19 of 131 remaining) [2024-11-09 06:58:46,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (18 of 131 remaining) [2024-11-09 06:58:46,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (17 of 131 remaining) [2024-11-09 06:58:46,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (16 of 131 remaining) [2024-11-09 06:58:46,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (15 of 131 remaining) [2024-11-09 06:58:46,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (14 of 131 remaining) [2024-11-09 06:58:46,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (13 of 131 remaining) [2024-11-09 06:58:46,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (12 of 131 remaining) [2024-11-09 06:58:46,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (11 of 131 remaining) [2024-11-09 06:58:46,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (10 of 131 remaining) [2024-11-09 06:58:46,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (9 of 131 remaining) [2024-11-09 06:58:46,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (8 of 131 remaining) [2024-11-09 06:58:46,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (7 of 131 remaining) [2024-11-09 06:58:46,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (6 of 131 remaining) [2024-11-09 06:58:46,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (5 of 131 remaining) [2024-11-09 06:58:46,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (4 of 131 remaining) [2024-11-09 06:58:46,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (3 of 131 remaining) [2024-11-09 06:58:46,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (2 of 131 remaining) [2024-11-09 06:58:46,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (1 of 131 remaining) [2024-11-09 06:58:46,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (0 of 131 remaining) [2024-11-09 06:58:46,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 06:58:46,085 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] [2024-11-09 06:58:46,090 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 06:58:46,090 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:58:46,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:58:46 BasicIcfg [2024-11-09 06:58:46,096 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:58:46,096 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:58:46,096 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:58:46,096 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:58:46,097 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:58:28" (3/4) ... [2024-11-09 06:58:46,098 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 06:58:46,101 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 06:58:46,101 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 06:58:46,101 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-09 06:58:46,101 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-09 06:58:46,105 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-09 06:58:46,105 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 06:58:46,105 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-09 06:58:46,105 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 06:58:46,176 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 06:58:46,177 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 06:58:46,177 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:58:46,177 INFO L158 Benchmark]: Toolchain (without parser) took 18495.54ms. Allocated memory was 188.7MB in the beginning and 9.0GB in the end (delta: 8.8GB). Free memory was 114.8MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-11-09 06:58:46,177 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 188.7MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:58:46,178 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.31ms. Allocated memory is still 188.7MB. Free memory was 114.5MB in the beginning and 100.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 06:58:46,178 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.21ms. Allocated memory is still 188.7MB. Free memory was 100.4MB in the beginning and 98.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:58:46,178 INFO L158 Benchmark]: Boogie Preprocessor took 52.86ms. Allocated memory is still 188.7MB. Free memory was 98.6MB in the beginning and 96.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:58:46,178 INFO L158 Benchmark]: RCFGBuilder took 679.74ms. Allocated memory is still 188.7MB. Free memory was 96.8MB in the beginning and 69.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-09 06:58:46,178 INFO L158 Benchmark]: TraceAbstraction took 17125.72ms. Allocated memory was 188.7MB in the beginning and 9.0GB in the end (delta: 8.8GB). Free memory was 68.7MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-09 06:58:46,178 INFO L158 Benchmark]: Witness Printer took 80.47ms. Allocated memory is still 9.0GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 06:58:46,179 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.18ms. Allocated memory is still 188.7MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.31ms. Allocated memory is still 188.7MB. Free memory was 114.5MB in the beginning and 100.4MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.21ms. Allocated memory is still 188.7MB. Free memory was 100.4MB in the beginning and 98.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.86ms. Allocated memory is still 188.7MB. Free memory was 98.6MB in the beginning and 96.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 679.74ms. Allocated memory is still 188.7MB. Free memory was 96.8MB in the beginning and 69.5MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 17125.72ms. Allocated memory was 188.7MB in the beginning and 9.0GB in the end (delta: 8.8GB). Free memory was 68.7MB in the beginning and 7.2GB in the end (delta: -7.1GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 80.47ms. Allocated memory is still 9.0GB. Free memory was 7.2GB in the beginning and 7.2GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: 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: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: 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: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: 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: 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: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: 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 9 procedures, 630 locations, 131 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: 16.8s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2566 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 824 mSDsluCounter, 544 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2581 IncrementalHoareTripleChecker+Invalid, 2747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 536 mSDtfsCounter, 2581 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=785occurred in iteration=12, InterpolantAutomatonStates: 83, 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.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 2347 NumberOfCodeBlocks, 2347 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2320 ConstructedInterpolants, 0 QuantifiedInterpolants, 2374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 06:58:46,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE