./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.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 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:00:27,656 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:00:27,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 10:00:27,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:00:27,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:00:27,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:00:27,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:00:27,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:00:27,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:00:27,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:00:27,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:00:27,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:00:27,751 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:00:27,751 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:00:27,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:00:27,754 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:00:27,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:00:27,754 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:00:27,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:00:27,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:00:27,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:00:27,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:00:27,756 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 10:00:27,756 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:00:27,757 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:00:27,757 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:00:27,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:00:27,758 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:00:27,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:00:27,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:00:27,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:00:27,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:00:27,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:00:27,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:00:27,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 10:00:27,760 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:00:27,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:00:27,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:00:27,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:00:27,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:00:27,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:00:27,761 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 -> 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 [2024-10-13 10:00:27,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:00:27,987 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:00:27,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:00:27,991 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:00:27,992 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:00:27,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2024-10-13 10:00:29,569 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:00:29,738 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:00:29,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2024-10-13 10:00:29,747 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47c6270e1/665f2c9ac873424f953dad711eb4220f/FLAGe2f8fefe5 [2024-10-13 10:00:30,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47c6270e1/665f2c9ac873424f953dad711eb4220f [2024-10-13 10:00:30,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:00:30,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:00:30,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:00:30,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:00:30,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:00:30,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:00:30" (1/1) ... [2024-10-13 10:00:30,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@572b5839 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:30, skipping insertion in model container [2024-10-13 10:00:30,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:00:30" (1/1) ... [2024-10-13 10:00:30,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:00:30,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:00:30,419 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:00:30,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:00:30,469 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:00:30,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:30 WrapperNode [2024-10-13 10:00:30,470 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:00:30,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:00:30,471 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:00:30,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:00:30,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:30" (1/1) ... [2024-10-13 10:00:30,495 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:30" (1/1) ... [2024-10-13 10:00:30,519 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 145 [2024-10-13 10:00:30,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:00:30,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:00:30,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:00:30,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:00:30,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:30" (1/1) ... [2024-10-13 10:00:30,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:30" (1/1) ... [2024-10-13 10:00:30,531 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:30" (1/1) ... [2024-10-13 10:00:30,531 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:30" (1/1) ... [2024-10-13 10:00:30,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:30" (1/1) ... [2024-10-13 10:00:30,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:30" (1/1) ... [2024-10-13 10:00:30,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:30" (1/1) ... [2024-10-13 10:00:30,547 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:30" (1/1) ... [2024-10-13 10:00:30,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:00:30,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:00:30,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:00:30,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:00:30,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:30" (1/1) ... [2024-10-13 10:00:30,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:00:30,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:00:30,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:00:30,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:00:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:00:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 10:00:30,658 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 10:00:30,658 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 10:00:30,658 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 10:00:30,659 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 10:00:30,659 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 10:00:30,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 10:00:30,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 10:00:30,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:00:30,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:00:30,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:00:30,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 10:00:30,661 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 10:00:30,752 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:00:30,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:00:31,147 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 10:00:31,148 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:00:31,165 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:00:31,165 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-13 10:00:31,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:00:31 BoogieIcfgContainer [2024-10-13 10:00:31,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:00:31,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:00:31,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:00:31,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:00:31,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:00:30" (1/3) ... [2024-10-13 10:00:31,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe7ab2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:00:31, skipping insertion in model container [2024-10-13 10:00:31,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:30" (2/3) ... [2024-10-13 10:00:31,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe7ab2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:00:31, skipping insertion in model container [2024-10-13 10:00:31,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:00:31" (3/3) ... [2024-10-13 10:00:31,175 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2024-10-13 10:00:31,191 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:00:31,191 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2024-10-13 10:00:31,191 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 10:00:31,283 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 10:00:31,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 332 places, 339 transitions, 699 flow [2024-10-13 10:00:31,398 INFO L124 PetriNetUnfolderBase]: 17/336 cut-off events. [2024-10-13 10:00:31,399 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 10:00:31,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349 conditions, 336 events. 17/336 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 702 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 251. Up to 2 conditions per place. [2024-10-13 10:00:31,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 339 transitions, 699 flow [2024-10-13 10:00:31,415 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 311 places, 316 transitions, 650 flow [2024-10-13 10:00:31,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:00:31,427 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;@58aec198, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:00:31,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-10-13 10:00:31,431 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 10:00:31,432 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-13 10:00:31,432 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 10:00:31,432 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:31,433 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] [2024-10-13 10:00:31,433 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:31,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:31,437 INFO L85 PathProgramCache]: Analyzing trace with hash -808695391, now seen corresponding path program 1 times [2024-10-13 10:00:31,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:31,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505942962] [2024-10-13 10:00:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:31,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:31,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:31,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505942962] [2024-10-13 10:00:31,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505942962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:31,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:31,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140724007] [2024-10-13 10:00:31,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:31,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:31,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:31,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:31,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:31,680 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 339 [2024-10-13 10:00:31,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 316 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:31,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:31,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 339 [2024-10-13 10:00:31,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:31,855 INFO L124 PetriNetUnfolderBase]: 28/613 cut-off events. [2024-10-13 10:00:31,855 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-10-13 10:00:31,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 613 events. 28/613 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2696 event pairs, 7 based on Foata normal form. 16/524 useless extension candidates. Maximal degree in co-relation 439. Up to 31 conditions per place. [2024-10-13 10:00:31,866 INFO L140 encePairwiseOnDemand]: 329/339 looper letters, 13 selfloop transitions, 2 changer transitions 3/308 dead transitions. [2024-10-13 10:00:31,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 308 transitions, 664 flow [2024-10-13 10:00:31,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2024-10-13 10:00:31,882 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9459193706981318 [2024-10-13 10:00:31,884 INFO L175 Difference]: Start difference. First operand has 311 places, 316 transitions, 650 flow. Second operand 3 states and 962 transitions. [2024-10-13 10:00:31,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 308 transitions, 664 flow [2024-10-13 10:00:31,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 308 transitions, 652 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 10:00:31,899 INFO L231 Difference]: Finished difference. Result has 306 places, 305 transitions, 620 flow [2024-10-13 10:00:31,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=304, 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=620, PETRI_PLACES=306, PETRI_TRANSITIONS=305} [2024-10-13 10:00:31,911 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -5 predicate places. [2024-10-13 10:00:31,912 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 305 transitions, 620 flow [2024-10-13 10:00:31,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:31,913 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:31,913 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] [2024-10-13 10:00:31,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:00:31,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:31,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:31,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1436395452, now seen corresponding path program 1 times [2024-10-13 10:00:31,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:31,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158474139] [2024-10-13 10:00:31,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:31,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:31,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:31,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158474139] [2024-10-13 10:00:31,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158474139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:31,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:31,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:31,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860727355] [2024-10-13 10:00:31,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:31,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:31,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:31,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:31,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:32,031 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 339 [2024-10-13 10:00:32,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 305 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:32,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:32,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 339 [2024-10-13 10:00:32,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:32,103 INFO L124 PetriNetUnfolderBase]: 19/455 cut-off events. [2024-10-13 10:00:32,103 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 10:00:32,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 455 events. 19/455 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1753 event pairs, 5 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 462. Up to 27 conditions per place. [2024-10-13 10:00:32,110 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 13 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2024-10-13 10:00:32,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 304 transitions, 648 flow [2024-10-13 10:00:32,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:32,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:32,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 955 transitions. [2024-10-13 10:00:32,113 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9390363815142576 [2024-10-13 10:00:32,113 INFO L175 Difference]: Start difference. First operand has 306 places, 305 transitions, 620 flow. Second operand 3 states and 955 transitions. [2024-10-13 10:00:32,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 304 transitions, 648 flow [2024-10-13 10:00:32,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 304 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:32,118 INFO L231 Difference]: Finished difference. Result has 302 places, 304 transitions, 618 flow [2024-10-13 10:00:32,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=302, PETRI_TRANSITIONS=304} [2024-10-13 10:00:32,120 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -9 predicate places. [2024-10-13 10:00:32,120 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 304 transitions, 618 flow [2024-10-13 10:00:32,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.3333333333333) internal successors, (943), 3 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:32,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:32,121 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:32,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:00:32,121 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:32,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:32,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2079329439, now seen corresponding path program 1 times [2024-10-13 10:00:32,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:32,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617734621] [2024-10-13 10:00:32,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:32,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:32,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:32,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617734621] [2024-10-13 10:00:32,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617734621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:32,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:32,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:32,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904104612] [2024-10-13 10:00:32,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:32,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:32,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:32,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:32,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:32,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 339 [2024-10-13 10:00:32,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 304 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:32,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:32,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 339 [2024-10-13 10:00:32,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:32,271 INFO L124 PetriNetUnfolderBase]: 34/596 cut-off events. [2024-10-13 10:00:32,272 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-13 10:00:32,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 596 events. 34/596 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2844 event pairs, 12 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 616. Up to 46 conditions per place. [2024-10-13 10:00:32,278 INFO L140 encePairwiseOnDemand]: 334/339 looper letters, 14 selfloop transitions, 1 changer transitions 0/300 dead transitions. [2024-10-13 10:00:32,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 300 transitions, 640 flow [2024-10-13 10:00:32,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:32,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:32,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2024-10-13 10:00:32,280 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9360865290068829 [2024-10-13 10:00:32,280 INFO L175 Difference]: Start difference. First operand has 302 places, 304 transitions, 618 flow. Second operand 3 states and 952 transitions. [2024-10-13 10:00:32,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 300 transitions, 640 flow [2024-10-13 10:00:32,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 300 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:32,284 INFO L231 Difference]: Finished difference. Result has 298 places, 300 transitions, 608 flow [2024-10-13 10:00:32,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=608, PETRI_PLACES=298, PETRI_TRANSITIONS=300} [2024-10-13 10:00:32,286 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -13 predicate places. [2024-10-13 10:00:32,286 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 300 transitions, 608 flow [2024-10-13 10:00:32,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:32,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:32,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:32,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:00:32,288 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:32,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:32,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1966449611, now seen corresponding path program 1 times [2024-10-13 10:00:32,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:32,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363161573] [2024-10-13 10:00:32,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:32,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:32,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:32,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:32,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363161573] [2024-10-13 10:00:32,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363161573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:32,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:32,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:32,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243862878] [2024-10-13 10:00:32,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:32,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:32,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:32,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:32,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:32,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 339 [2024-10-13 10:00:32,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 300 transitions, 608 flow. Second operand has 6 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:32,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:32,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 339 [2024-10-13 10:00:32,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:34,078 INFO L124 PetriNetUnfolderBase]: 2053/8822 cut-off events. [2024-10-13 10:00:34,078 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2024-10-13 10:00:34,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11725 conditions, 8822 events. 2053/8822 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 91934 event pairs, 1520 based on Foata normal form. 0/7237 useless extension candidates. Maximal degree in co-relation 11687. Up to 2804 conditions per place. [2024-10-13 10:00:34,160 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 38 selfloop transitions, 5 changer transitions 0/299 dead transitions. [2024-10-13 10:00:34,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 299 transitions, 692 flow [2024-10-13 10:00:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:34,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:34,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1760 transitions. [2024-10-13 10:00:34,164 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8652900688298918 [2024-10-13 10:00:34,164 INFO L175 Difference]: Start difference. First operand has 298 places, 300 transitions, 608 flow. Second operand 6 states and 1760 transitions. [2024-10-13 10:00:34,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 299 transitions, 692 flow [2024-10-13 10:00:34,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 299 transitions, 691 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:34,168 INFO L231 Difference]: Finished difference. Result has 301 places, 299 transitions, 615 flow [2024-10-13 10:00:34,169 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=615, PETRI_PLACES=301, PETRI_TRANSITIONS=299} [2024-10-13 10:00:34,170 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -10 predicate places. [2024-10-13 10:00:34,170 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 299 transitions, 615 flow [2024-10-13 10:00:34,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:34,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:34,173 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:34,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:00:34,173 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:34,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:34,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1424960186, now seen corresponding path program 1 times [2024-10-13 10:00:34,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:34,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918498345] [2024-10-13 10:00:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:34,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:34,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:34,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:34,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918498345] [2024-10-13 10:00:34,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918498345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:34,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:34,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:34,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853376252] [2024-10-13 10:00:34,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:34,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:34,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:34,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:34,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:34,234 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 339 [2024-10-13 10:00:34,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 299 transitions, 615 flow. Second operand has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:34,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:34,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 339 [2024-10-13 10:00:34,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:34,357 INFO L124 PetriNetUnfolderBase]: 84/906 cut-off events. [2024-10-13 10:00:34,360 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-13 10:00:34,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 906 events. 84/906 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5289 event pairs, 56 based on Foata normal form. 0/770 useless extension candidates. Maximal degree in co-relation 1023. Up to 112 conditions per place. [2024-10-13 10:00:34,365 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 15 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2024-10-13 10:00:34,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 298 transitions, 647 flow [2024-10-13 10:00:34,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 951 transitions. [2024-10-13 10:00:34,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9351032448377581 [2024-10-13 10:00:34,368 INFO L175 Difference]: Start difference. First operand has 301 places, 299 transitions, 615 flow. Second operand 3 states and 951 transitions. [2024-10-13 10:00:34,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 298 transitions, 647 flow [2024-10-13 10:00:34,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 298 transitions, 637 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:00:34,372 INFO L231 Difference]: Finished difference. Result has 297 places, 298 transitions, 607 flow [2024-10-13 10:00:34,373 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=607, PETRI_PLACES=297, PETRI_TRANSITIONS=298} [2024-10-13 10:00:34,373 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -14 predicate places. [2024-10-13 10:00:34,373 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 298 transitions, 607 flow [2024-10-13 10:00:34,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.3333333333333) internal successors, (937), 3 states have internal predecessors, (937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:34,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:34,374 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] [2024-10-13 10:00:34,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:00:34,374 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:34,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:34,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1920678985, now seen corresponding path program 1 times [2024-10-13 10:00:34,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:34,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294322082] [2024-10-13 10:00:34,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:34,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:34,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:34,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294322082] [2024-10-13 10:00:34,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294322082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:34,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:34,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:34,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015068912] [2024-10-13 10:00:34,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:34,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:34,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:34,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:34,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:34,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 339 [2024-10-13 10:00:34,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 298 transitions, 607 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:34,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:34,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 339 [2024-10-13 10:00:34,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:34,477 INFO L124 PetriNetUnfolderBase]: 17/396 cut-off events. [2024-10-13 10:00:34,478 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 10:00:34,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 396 events. 17/396 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1364 event pairs, 4 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 395. Up to 24 conditions per place. [2024-10-13 10:00:34,481 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 12 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2024-10-13 10:00:34,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 297 transitions, 633 flow [2024-10-13 10:00:34,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2024-10-13 10:00:34,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9410029498525073 [2024-10-13 10:00:34,484 INFO L175 Difference]: Start difference. First operand has 297 places, 298 transitions, 607 flow. Second operand 3 states and 957 transitions. [2024-10-13 10:00:34,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 297 transitions, 633 flow [2024-10-13 10:00:34,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 297 transitions, 629 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:34,488 INFO L231 Difference]: Finished difference. Result has 296 places, 297 transitions, 605 flow [2024-10-13 10:00:34,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=296, PETRI_TRANSITIONS=297} [2024-10-13 10:00:34,489 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -15 predicate places. [2024-10-13 10:00:34,490 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 297 transitions, 605 flow [2024-10-13 10:00:34,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:34,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:34,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] [2024-10-13 10:00:34,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:00:34,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:34,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash -501053886, now seen corresponding path program 1 times [2024-10-13 10:00:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:34,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798271112] [2024-10-13 10:00:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:34,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:34,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:34,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:34,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798271112] [2024-10-13 10:00:34,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798271112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:34,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:34,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:34,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165817561] [2024-10-13 10:00:34,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:34,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:34,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:34,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:34,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:34,548 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 339 [2024-10-13 10:00:34,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 297 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:34,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:34,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 339 [2024-10-13 10:00:34,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:34,614 INFO L124 PetriNetUnfolderBase]: 16/410 cut-off events. [2024-10-13 10:00:34,615 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 10:00:34,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 410 events. 16/410 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1332 event pairs, 4 based on Foata normal form. 0/359 useless extension candidates. Maximal degree in co-relation 404. Up to 21 conditions per place. [2024-10-13 10:00:34,619 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 12 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2024-10-13 10:00:34,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 296 transitions, 631 flow [2024-10-13 10:00:34,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2024-10-13 10:00:34,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9410029498525073 [2024-10-13 10:00:34,621 INFO L175 Difference]: Start difference. First operand has 296 places, 297 transitions, 605 flow. Second operand 3 states and 957 transitions. [2024-10-13 10:00:34,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 296 transitions, 631 flow [2024-10-13 10:00:34,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 296 transitions, 627 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:34,625 INFO L231 Difference]: Finished difference. Result has 295 places, 296 transitions, 603 flow [2024-10-13 10:00:34,626 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=295, PETRI_TRANSITIONS=296} [2024-10-13 10:00:34,628 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -16 predicate places. [2024-10-13 10:00:34,628 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 296 transitions, 603 flow [2024-10-13 10:00:34,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:34,629 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:34,630 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] [2024-10-13 10:00:34,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:00:34,630 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:34,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:34,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1492001365, now seen corresponding path program 1 times [2024-10-13 10:00:34,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:34,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934746367] [2024-10-13 10:00:34,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:34,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:34,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:34,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:34,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934746367] [2024-10-13 10:00:34,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934746367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:34,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:34,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:34,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858971000] [2024-10-13 10:00:34,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:34,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:34,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:34,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:34,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:34,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 339 [2024-10-13 10:00:34,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 296 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:34,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:34,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 339 [2024-10-13 10:00:34,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:34,784 INFO L124 PetriNetUnfolderBase]: 12/303 cut-off events. [2024-10-13 10:00:34,784 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 10:00:34,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 303 events. 12/303 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 731 event pairs, 4 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 295. Up to 21 conditions per place. [2024-10-13 10:00:34,788 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 12 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2024-10-13 10:00:34,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 295 transitions, 629 flow [2024-10-13 10:00:34,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:34,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:34,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2024-10-13 10:00:34,791 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9410029498525073 [2024-10-13 10:00:34,791 INFO L175 Difference]: Start difference. First operand has 295 places, 296 transitions, 603 flow. Second operand 3 states and 957 transitions. [2024-10-13 10:00:34,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 295 transitions, 629 flow [2024-10-13 10:00:34,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 295 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:34,797 INFO L231 Difference]: Finished difference. Result has 294 places, 295 transitions, 601 flow [2024-10-13 10:00:34,798 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=294, PETRI_TRANSITIONS=295} [2024-10-13 10:00:34,799 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2024-10-13 10:00:34,799 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 295 transitions, 601 flow [2024-10-13 10:00:34,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:34,800 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:34,800 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] [2024-10-13 10:00:34,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:00:34,801 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:34,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:34,801 INFO L85 PathProgramCache]: Analyzing trace with hash -403365518, now seen corresponding path program 1 times [2024-10-13 10:00:34,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:34,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662516349] [2024-10-13 10:00:34,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:34,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:34,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:34,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662516349] [2024-10-13 10:00:34,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662516349] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:34,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:34,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:34,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050112425] [2024-10-13 10:00:34,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:34,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:34,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:34,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:34,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:34,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 339 [2024-10-13 10:00:34,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 295 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:34,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:34,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 339 [2024-10-13 10:00:34,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:34,991 INFO L124 PetriNetUnfolderBase]: 49/747 cut-off events. [2024-10-13 10:00:34,991 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-10-13 10:00:34,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 747 events. 49/747 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4076 event pairs, 20 based on Foata normal form. 0/640 useless extension candidates. Maximal degree in co-relation 776. Up to 56 conditions per place. [2024-10-13 10:00:34,995 INFO L140 encePairwiseOnDemand]: 334/339 looper letters, 14 selfloop transitions, 1 changer transitions 0/291 dead transitions. [2024-10-13 10:00:34,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 291 transitions, 623 flow [2024-10-13 10:00:34,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:34,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:34,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 952 transitions. [2024-10-13 10:00:34,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9360865290068829 [2024-10-13 10:00:34,997 INFO L175 Difference]: Start difference. First operand has 294 places, 295 transitions, 601 flow. Second operand 3 states and 952 transitions. [2024-10-13 10:00:34,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 291 transitions, 623 flow [2024-10-13 10:00:34,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 291 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:35,001 INFO L231 Difference]: Finished difference. Result has 290 places, 291 transitions, 591 flow [2024-10-13 10:00:35,002 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=290, PETRI_TRANSITIONS=291} [2024-10-13 10:00:35,003 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2024-10-13 10:00:35,003 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 291 transitions, 591 flow [2024-10-13 10:00:35,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:35,004 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:35,004 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-10-13 10:00:35,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:00:35,004 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:35,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:35,005 INFO L85 PathProgramCache]: Analyzing trace with hash -80520043, now seen corresponding path program 1 times [2024-10-13 10:00:35,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:35,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306169503] [2024-10-13 10:00:35,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:35,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:35,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:35,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306169503] [2024-10-13 10:00:35,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306169503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:35,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:35,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:35,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811341446] [2024-10-13 10:00:35,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:35,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:35,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:35,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:35,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:35,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 339 [2024-10-13 10:00:35,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 291 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:35,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:35,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 339 [2024-10-13 10:00:35,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:35,129 INFO L124 PetriNetUnfolderBase]: 19/388 cut-off events. [2024-10-13 10:00:35,129 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 10:00:35,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 388 events. 19/388 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1359 event pairs, 2 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 391. Up to 14 conditions per place. [2024-10-13 10:00:35,133 INFO L140 encePairwiseOnDemand]: 334/339 looper letters, 11 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2024-10-13 10:00:35,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 291 transitions, 621 flow [2024-10-13 10:00:35,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-10-13 10:00:35,135 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478859390363815 [2024-10-13 10:00:35,135 INFO L175 Difference]: Start difference. First operand has 290 places, 291 transitions, 591 flow. Second operand 3 states and 964 transitions. [2024-10-13 10:00:35,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 291 transitions, 621 flow [2024-10-13 10:00:35,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 291 transitions, 620 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:35,138 INFO L231 Difference]: Finished difference. Result has 289 places, 289 transitions, 592 flow [2024-10-13 10:00:35,139 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=289, PETRI_TRANSITIONS=289} [2024-10-13 10:00:35,141 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -22 predicate places. [2024-10-13 10:00:35,141 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 289 transitions, 592 flow [2024-10-13 10:00:35,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:35,141 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:35,142 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:35,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:00:35,142 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:35,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:35,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1137513529, now seen corresponding path program 1 times [2024-10-13 10:00:35,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:35,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328523362] [2024-10-13 10:00:35,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:35,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:35,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:35,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:35,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328523362] [2024-10-13 10:00:35,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328523362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:35,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:35,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:35,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171202843] [2024-10-13 10:00:35,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:35,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:35,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:35,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:35,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:35,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 339 [2024-10-13 10:00:35,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 289 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:35,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:35,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 339 [2024-10-13 10:00:35,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:35,545 INFO L124 PetriNetUnfolderBase]: 460/3169 cut-off events. [2024-10-13 10:00:35,548 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-13 10:00:35,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3819 conditions, 3169 events. 460/3169 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 28112 event pairs, 172 based on Foata normal form. 0/2737 useless extension candidates. Maximal degree in co-relation 3781. Up to 577 conditions per place. [2024-10-13 10:00:35,594 INFO L140 encePairwiseOnDemand]: 330/339 looper letters, 24 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2024-10-13 10:00:35,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 291 transitions, 655 flow [2024-10-13 10:00:35,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:35,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 948 transitions. [2024-10-13 10:00:35,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9321533923303835 [2024-10-13 10:00:35,601 INFO L175 Difference]: Start difference. First operand has 289 places, 289 transitions, 592 flow. Second operand 3 states and 948 transitions. [2024-10-13 10:00:35,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 291 transitions, 655 flow [2024-10-13 10:00:35,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 291 transitions, 649 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:35,615 INFO L231 Difference]: Finished difference. Result has 284 places, 286 transitions, 595 flow [2024-10-13 10:00:35,616 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=595, PETRI_PLACES=284, PETRI_TRANSITIONS=286} [2024-10-13 10:00:35,616 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -27 predicate places. [2024-10-13 10:00:35,617 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 286 transitions, 595 flow [2024-10-13 10:00:35,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:35,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:35,621 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-10-13 10:00:35,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:00:35,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:35,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:35,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1075872973, now seen corresponding path program 1 times [2024-10-13 10:00:35,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:35,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639878414] [2024-10-13 10:00:35,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:35,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:35,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:35,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:35,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:35,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639878414] [2024-10-13 10:00:35,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639878414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:35,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:35,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:35,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477821152] [2024-10-13 10:00:35,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:35,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:35,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:35,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:35,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:35,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 339 [2024-10-13 10:00:35,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 286 transitions, 595 flow. Second operand has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:35,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:35,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 339 [2024-10-13 10:00:35,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:35,897 INFO L124 PetriNetUnfolderBase]: 73/842 cut-off events. [2024-10-13 10:00:35,901 INFO L125 PetriNetUnfolderBase]: For 16/42 co-relation queries the response was YES. [2024-10-13 10:00:35,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 842 events. 73/842 cut-off events. For 16/42 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4428 event pairs, 6 based on Foata normal form. 2/753 useless extension candidates. Maximal degree in co-relation 931. Up to 40 conditions per place. [2024-10-13 10:00:35,918 INFO L140 encePairwiseOnDemand]: 334/339 looper letters, 11 selfloop transitions, 3 changer transitions 0/286 dead transitions. [2024-10-13 10:00:35,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 286 transitions, 625 flow [2024-10-13 10:00:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:35,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-10-13 10:00:35,920 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478859390363815 [2024-10-13 10:00:35,920 INFO L175 Difference]: Start difference. First operand has 284 places, 286 transitions, 595 flow. Second operand 3 states and 964 transitions. [2024-10-13 10:00:35,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 286 transitions, 625 flow [2024-10-13 10:00:35,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 286 transitions, 625 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:00:35,927 INFO L231 Difference]: Finished difference. Result has 284 places, 284 transitions, 597 flow [2024-10-13 10:00:35,928 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=597, PETRI_PLACES=284, PETRI_TRANSITIONS=284} [2024-10-13 10:00:35,930 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -27 predicate places. [2024-10-13 10:00:35,930 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 284 transitions, 597 flow [2024-10-13 10:00:35,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.6666666666667) internal successors, (953), 3 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:35,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:35,934 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-10-13 10:00:35,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:00:35,934 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:35,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:35,935 INFO L85 PathProgramCache]: Analyzing trace with hash -2065179203, now seen corresponding path program 1 times [2024-10-13 10:00:35,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:35,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582723791] [2024-10-13 10:00:35,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:35,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:35,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:35,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582723791] [2024-10-13 10:00:35,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582723791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:35,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:35,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:35,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128676854] [2024-10-13 10:00:35,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:35,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:35,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:35,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:35,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:36,049 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 339 [2024-10-13 10:00:36,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 284 transitions, 597 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:36,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:36,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 339 [2024-10-13 10:00:36,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:36,200 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([909] thread3EXIT-->L89: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][265], [Black: 368#true, 370#(= |#race~A~0| 0), 372#true, 244#L89true, 343#(= |#race~N~0| 0), 364#(= |#race~M~0| 0), 375#true]) [2024-10-13 10:00:36,203 INFO L294 olderBase$Statistics]: this new event has 245 ancestors and is cut-off event [2024-10-13 10:00:36,203 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-13 10:00:36,203 INFO L297 olderBase$Statistics]: existing Event has 175 ancestors and is cut-off event [2024-10-13 10:00:36,203 INFO L297 olderBase$Statistics]: existing Event has 210 ancestors and is cut-off event [2024-10-13 10:00:36,204 INFO L124 PetriNetUnfolderBase]: 65/761 cut-off events. [2024-10-13 10:00:36,204 INFO L125 PetriNetUnfolderBase]: For 8/46 co-relation queries the response was YES. [2024-10-13 10:00:36,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 761 events. 65/761 cut-off events. For 8/46 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3663 event pairs, 13 based on Foata normal form. 5/694 useless extension candidates. Maximal degree in co-relation 871. Up to 52 conditions per place. [2024-10-13 10:00:36,223 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 13 selfloop transitions, 2 changer transitions 0/285 dead transitions. [2024-10-13 10:00:36,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 285 transitions, 631 flow [2024-10-13 10:00:36,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:36,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-10-13 10:00:36,225 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478859390363815 [2024-10-13 10:00:36,225 INFO L175 Difference]: Start difference. First operand has 284 places, 284 transitions, 597 flow. Second operand 3 states and 964 transitions. [2024-10-13 10:00:36,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 285 transitions, 631 flow [2024-10-13 10:00:36,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 285 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:36,231 INFO L231 Difference]: Finished difference. Result has 283 places, 283 transitions, 593 flow [2024-10-13 10:00:36,232 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=593, PETRI_PLACES=283, PETRI_TRANSITIONS=283} [2024-10-13 10:00:36,232 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -28 predicate places. [2024-10-13 10:00:36,232 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 283 transitions, 593 flow [2024-10-13 10:00:36,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:36,233 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:36,233 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:36,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:00:36,233 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:36,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1128922688, now seen corresponding path program 1 times [2024-10-13 10:00:36,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:36,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596874478] [2024-10-13 10:00:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:36,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:36,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:36,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:36,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596874478] [2024-10-13 10:00:36,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596874478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:36,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:36,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:00:36,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777548308] [2024-10-13 10:00:36,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:36,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 10:00:36,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:36,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 10:00:36,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 10:00:36,533 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2024-10-13 10:00:36,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 283 transitions, 593 flow. Second operand has 7 states, 7 states have (on average 310.85714285714283) internal successors, (2176), 7 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:36,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:36,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2024-10-13 10:00:36,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:36,743 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([909] thread3EXIT-->L89: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork2_thidvar0_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][293], [378#true, Black: 368#true, 370#(= |#race~A~0| 0), 244#L89true, 343#(= |#race~N~0| 0), 375#true, 364#(= |#race~M~0| 0)]) [2024-10-13 10:00:36,744 INFO L294 olderBase$Statistics]: this new event has 260 ancestors and is cut-off event [2024-10-13 10:00:36,744 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2024-10-13 10:00:36,744 INFO L297 olderBase$Statistics]: existing Event has 225 ancestors and is cut-off event [2024-10-13 10:00:36,744 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2024-10-13 10:00:36,744 INFO L124 PetriNetUnfolderBase]: 95/1385 cut-off events. [2024-10-13 10:00:36,744 INFO L125 PetriNetUnfolderBase]: For 11/40 co-relation queries the response was YES. [2024-10-13 10:00:36,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 1385 events. 95/1385 cut-off events. For 11/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8646 event pairs, 18 based on Foata normal form. 4/1259 useless extension candidates. Maximal degree in co-relation 1560. Up to 67 conditions per place. [2024-10-13 10:00:36,759 INFO L140 encePairwiseOnDemand]: 326/339 looper letters, 22 selfloop transitions, 14 changer transitions 0/298 dead transitions. [2024-10-13 10:00:36,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 298 transitions, 703 flow [2024-10-13 10:00:36,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 10:00:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-13 10:00:36,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3127 transitions. [2024-10-13 10:00:36,763 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9224188790560472 [2024-10-13 10:00:36,764 INFO L175 Difference]: Start difference. First operand has 283 places, 283 transitions, 593 flow. Second operand 10 states and 3127 transitions. [2024-10-13 10:00:36,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 298 transitions, 703 flow [2024-10-13 10:00:36,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 298 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:36,767 INFO L231 Difference]: Finished difference. Result has 294 places, 290 transitions, 655 flow [2024-10-13 10:00:36,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=655, PETRI_PLACES=294, PETRI_TRANSITIONS=290} [2024-10-13 10:00:36,768 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2024-10-13 10:00:36,768 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 290 transitions, 655 flow [2024-10-13 10:00:36,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 310.85714285714283) internal successors, (2176), 7 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:36,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:36,770 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-10-13 10:00:36,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:00:36,770 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:36,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:36,770 INFO L85 PathProgramCache]: Analyzing trace with hash 298348699, now seen corresponding path program 1 times [2024-10-13 10:00:36,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:36,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932574542] [2024-10-13 10:00:36,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:36,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:36,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:36,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:36,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932574542] [2024-10-13 10:00:36,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932574542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:36,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:36,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:36,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391825860] [2024-10-13 10:00:36,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:36,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:36,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:36,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:36,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:36,812 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 339 [2024-10-13 10:00:36,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 290 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:36,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:36,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 339 [2024-10-13 10:00:36,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:36,974 INFO L124 PetriNetUnfolderBase]: 145/1650 cut-off events. [2024-10-13 10:00:36,974 INFO L125 PetriNetUnfolderBase]: For 53/108 co-relation queries the response was YES. [2024-10-13 10:00:36,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1959 conditions, 1650 events. 145/1650 cut-off events. For 53/108 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10800 event pairs, 29 based on Foata normal form. 0/1496 useless extension candidates. Maximal degree in co-relation 1913. Up to 120 conditions per place. [2024-10-13 10:00:36,992 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 13 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-10-13 10:00:36,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 291 transitions, 689 flow [2024-10-13 10:00:36,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-10-13 10:00:36,994 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478859390363815 [2024-10-13 10:00:36,994 INFO L175 Difference]: Start difference. First operand has 294 places, 290 transitions, 655 flow. Second operand 3 states and 964 transitions. [2024-10-13 10:00:36,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 291 transitions, 689 flow [2024-10-13 10:00:36,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 291 transitions, 685 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:36,998 INFO L231 Difference]: Finished difference. Result has 294 places, 289 transitions, 653 flow [2024-10-13 10:00:36,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=653, PETRI_PLACES=294, PETRI_TRANSITIONS=289} [2024-10-13 10:00:36,999 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -17 predicate places. [2024-10-13 10:00:36,999 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 289 transitions, 653 flow [2024-10-13 10:00:36,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:36,999 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:37,000 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] [2024-10-13 10:00:37,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:00:37,000 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:37,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:37,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1856901994, now seen corresponding path program 1 times [2024-10-13 10:00:37,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:37,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450201660] [2024-10-13 10:00:37,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:37,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:37,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:37,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450201660] [2024-10-13 10:00:37,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450201660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:37,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:37,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:37,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888265711] [2024-10-13 10:00:37,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:37,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:37,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:37,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:37,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:37,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 339 [2024-10-13 10:00:37,033 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 289 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:37,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:37,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 339 [2024-10-13 10:00:37,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:37,185 INFO L124 PetriNetUnfolderBase]: 119/1101 cut-off events. [2024-10-13 10:00:37,185 INFO L125 PetriNetUnfolderBase]: For 58/89 co-relation queries the response was YES. [2024-10-13 10:00:37,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1351 conditions, 1101 events. 119/1101 cut-off events. For 58/89 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6223 event pairs, 11 based on Foata normal form. 4/1005 useless extension candidates. Maximal degree in co-relation 1306. Up to 79 conditions per place. [2024-10-13 10:00:37,196 INFO L140 encePairwiseOnDemand]: 334/339 looper letters, 9 selfloop transitions, 2 changer transitions 8/289 dead transitions. [2024-10-13 10:00:37,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 289 transitions, 681 flow [2024-10-13 10:00:37,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 963 transitions. [2024-10-13 10:00:37,199 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9469026548672567 [2024-10-13 10:00:37,199 INFO L175 Difference]: Start difference. First operand has 294 places, 289 transitions, 653 flow. Second operand 3 states and 963 transitions. [2024-10-13 10:00:37,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 289 transitions, 681 flow [2024-10-13 10:00:37,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 289 transitions, 677 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:37,203 INFO L231 Difference]: Finished difference. Result has 292 places, 279 transitions, 632 flow [2024-10-13 10:00:37,203 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=632, PETRI_PLACES=292, PETRI_TRANSITIONS=279} [2024-10-13 10:00:37,204 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -19 predicate places. [2024-10-13 10:00:37,204 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 279 transitions, 632 flow [2024-10-13 10:00:37,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.0) internal successors, (954), 3 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:37,204 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:37,204 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:37,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:00:37,205 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:37,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:37,205 INFO L85 PathProgramCache]: Analyzing trace with hash -280137186, now seen corresponding path program 1 times [2024-10-13 10:00:37,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:37,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529568322] [2024-10-13 10:00:37,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:37,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:37,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:37,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:37,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:37,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529568322] [2024-10-13 10:00:37,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529568322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:37,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:37,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:37,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974811255] [2024-10-13 10:00:37,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:37,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:00:37,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:37,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:00:37,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:00:37,337 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 339 [2024-10-13 10:00:37,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 279 transitions, 632 flow. Second operand has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:37,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:37,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 339 [2024-10-13 10:00:37,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:37,582 INFO L124 PetriNetUnfolderBase]: 133/1669 cut-off events. [2024-10-13 10:00:37,583 INFO L125 PetriNetUnfolderBase]: For 60/70 co-relation queries the response was YES. [2024-10-13 10:00:37,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2016 conditions, 1669 events. 133/1669 cut-off events. For 60/70 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 11162 event pairs, 40 based on Foata normal form. 8/1543 useless extension candidates. Maximal degree in co-relation 1968. Up to 114 conditions per place. [2024-10-13 10:00:37,604 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 22 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2024-10-13 10:00:37,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 289 transitions, 713 flow [2024-10-13 10:00:37,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:00:37,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 10:00:37,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1583 transitions. [2024-10-13 10:00:37,607 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9339233038348083 [2024-10-13 10:00:37,607 INFO L175 Difference]: Start difference. First operand has 292 places, 279 transitions, 632 flow. Second operand 5 states and 1583 transitions. [2024-10-13 10:00:37,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 289 transitions, 713 flow [2024-10-13 10:00:37,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 289 transitions, 709 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:37,612 INFO L231 Difference]: Finished difference. Result has 288 places, 281 transitions, 653 flow [2024-10-13 10:00:37,612 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=653, PETRI_PLACES=288, PETRI_TRANSITIONS=281} [2024-10-13 10:00:37,612 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -23 predicate places. [2024-10-13 10:00:37,613 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 281 transitions, 653 flow [2024-10-13 10:00:37,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:37,613 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:37,614 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] [2024-10-13 10:00:37,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:00:37,614 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:37,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:37,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1546674034, now seen corresponding path program 1 times [2024-10-13 10:00:37,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:37,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784532581] [2024-10-13 10:00:37,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:37,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:37,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:37,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784532581] [2024-10-13 10:00:37,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784532581] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:37,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:37,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:37,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549106208] [2024-10-13 10:00:37,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:37,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:37,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:37,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:37,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:37,662 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 339 [2024-10-13 10:00:37,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 281 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:37,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:37,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 339 [2024-10-13 10:00:37,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:37,850 INFO L124 PetriNetUnfolderBase]: 233/1746 cut-off events. [2024-10-13 10:00:37,850 INFO L125 PetriNetUnfolderBase]: For 147/218 co-relation queries the response was YES. [2024-10-13 10:00:37,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2243 conditions, 1746 events. 233/1746 cut-off events. For 147/218 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12167 event pairs, 56 based on Foata normal form. 0/1602 useless extension candidates. Maximal degree in co-relation 2196. Up to 235 conditions per place. [2024-10-13 10:00:37,866 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 11 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2024-10-13 10:00:37,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 282 transitions, 683 flow [2024-10-13 10:00:37,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 962 transitions. [2024-10-13 10:00:37,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9459193706981318 [2024-10-13 10:00:37,868 INFO L175 Difference]: Start difference. First operand has 288 places, 281 transitions, 653 flow. Second operand 3 states and 962 transitions. [2024-10-13 10:00:37,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 282 transitions, 683 flow [2024-10-13 10:00:37,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 282 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:37,872 INFO L231 Difference]: Finished difference. Result has 287 places, 280 transitions, 650 flow [2024-10-13 10:00:37,872 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=287, PETRI_TRANSITIONS=280} [2024-10-13 10:00:37,872 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -24 predicate places. [2024-10-13 10:00:37,872 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 280 transitions, 650 flow [2024-10-13 10:00:37,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:37,873 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:37,873 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-10-13 10:00:37,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:00:37,873 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:37,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:37,874 INFO L85 PathProgramCache]: Analyzing trace with hash -218885246, now seen corresponding path program 1 times [2024-10-13 10:00:37,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:37,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082162953] [2024-10-13 10:00:37,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:37,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:38,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:38,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082162953] [2024-10-13 10:00:38,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082162953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:38,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:38,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:38,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429907428] [2024-10-13 10:00:38,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:38,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:38,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:38,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:38,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:38,343 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2024-10-13 10:00:38,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 280 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:38,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:38,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2024-10-13 10:00:38,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:38,556 INFO L124 PetriNetUnfolderBase]: 151/1753 cut-off events. [2024-10-13 10:00:38,556 INFO L125 PetriNetUnfolderBase]: For 141/150 co-relation queries the response was YES. [2024-10-13 10:00:38,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 1753 events. 151/1753 cut-off events. For 141/150 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11812 event pairs, 37 based on Foata normal form. 0/1636 useless extension candidates. Maximal degree in co-relation 2170. Up to 142 conditions per place. [2024-10-13 10:00:38,584 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 25 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2024-10-13 10:00:38,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 288 transitions, 734 flow [2024-10-13 10:00:38,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:38,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:38,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2024-10-13 10:00:38,588 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9257620452310718 [2024-10-13 10:00:38,588 INFO L175 Difference]: Start difference. First operand has 287 places, 280 transitions, 650 flow. Second operand 6 states and 1883 transitions. [2024-10-13 10:00:38,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 288 transitions, 734 flow [2024-10-13 10:00:38,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 288 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:38,593 INFO L231 Difference]: Finished difference. Result has 290 places, 280 transitions, 660 flow [2024-10-13 10:00:38,593 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=660, PETRI_PLACES=290, PETRI_TRANSITIONS=280} [2024-10-13 10:00:38,594 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2024-10-13 10:00:38,594 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 280 transitions, 660 flow [2024-10-13 10:00:38,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:38,595 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:38,595 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-10-13 10:00:38,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:00:38,595 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:38,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:38,595 INFO L85 PathProgramCache]: Analyzing trace with hash -738393419, now seen corresponding path program 1 times [2024-10-13 10:00:38,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:38,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209772183] [2024-10-13 10:00:38,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:38,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:38,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:38,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209772183] [2024-10-13 10:00:38,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209772183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:38,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:38,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240658964] [2024-10-13 10:00:38,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:38,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:38,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:38,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:39,182 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2024-10-13 10:00:39,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 280 transitions, 660 flow. Second operand has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:39,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:39,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2024-10-13 10:00:39,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:39,426 INFO L124 PetriNetUnfolderBase]: 232/1738 cut-off events. [2024-10-13 10:00:39,426 INFO L125 PetriNetUnfolderBase]: For 147/268 co-relation queries the response was YES. [2024-10-13 10:00:39,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 1738 events. 232/1738 cut-off events. For 147/268 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 12186 event pairs, 52 based on Foata normal form. 4/1628 useless extension candidates. Maximal degree in co-relation 2227. Up to 219 conditions per place. [2024-10-13 10:00:39,444 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 23 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2024-10-13 10:00:39,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 288 transitions, 740 flow [2024-10-13 10:00:39,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:39,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:39,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2024-10-13 10:00:39,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9257620452310718 [2024-10-13 10:00:39,447 INFO L175 Difference]: Start difference. First operand has 290 places, 280 transitions, 660 flow. Second operand 6 states and 1883 transitions. [2024-10-13 10:00:39,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 288 transitions, 740 flow [2024-10-13 10:00:39,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 288 transitions, 732 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 10:00:39,451 INFO L231 Difference]: Finished difference. Result has 291 places, 280 transitions, 666 flow [2024-10-13 10:00:39,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=666, PETRI_PLACES=291, PETRI_TRANSITIONS=280} [2024-10-13 10:00:39,451 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -20 predicate places. [2024-10-13 10:00:39,451 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 280 transitions, 666 flow [2024-10-13 10:00:39,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:39,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:39,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 10:00:39,452 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:39,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1502202117, now seen corresponding path program 1 times [2024-10-13 10:00:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:39,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977019548] [2024-10-13 10:00:39,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:39,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:39,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:39,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977019548] [2024-10-13 10:00:39,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977019548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:00:39,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168611042] [2024-10-13 10:00:39,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:39,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:00:39,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:00:39,592 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:00:39,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:00:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:39,673 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 10:00:39,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:00:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:39,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:00:40,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:40,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168611042] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:00:40,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:00:40,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-10-13 10:00:40,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957586972] [2024-10-13 10:00:40,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:00:40,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 10:00:40,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:40,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 10:00:40,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2024-10-13 10:00:40,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 339 [2024-10-13 10:00:40,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 280 transitions, 666 flow. Second operand has 19 states, 19 states have (on average 306.89473684210526) internal successors, (5831), 19 states have internal predecessors, (5831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:40,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:40,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 339 [2024-10-13 10:00:40,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:42,369 INFO L124 PetriNetUnfolderBase]: 208/3310 cut-off events. [2024-10-13 10:00:42,369 INFO L125 PetriNetUnfolderBase]: For 94/118 co-relation queries the response was YES. [2024-10-13 10:00:42,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 3310 events. 208/3310 cut-off events. For 94/118 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 28074 event pairs, 35 based on Foata normal form. 9/3136 useless extension candidates. Maximal degree in co-relation 4077. Up to 108 conditions per place. [2024-10-13 10:00:42,449 INFO L140 encePairwiseOnDemand]: 322/339 looper letters, 26 selfloop transitions, 27 changer transitions 0/302 dead transitions. [2024-10-13 10:00:42,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 302 transitions, 838 flow [2024-10-13 10:00:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 10:00:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-10-13 10:00:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4930 transitions. [2024-10-13 10:00:42,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9089233038348082 [2024-10-13 10:00:42,470 INFO L175 Difference]: Start difference. First operand has 291 places, 280 transitions, 666 flow. Second operand 16 states and 4930 transitions. [2024-10-13 10:00:42,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 302 transitions, 838 flow [2024-10-13 10:00:42,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 302 transitions, 830 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 10:00:42,483 INFO L231 Difference]: Finished difference. Result has 310 places, 291 transitions, 797 flow [2024-10-13 10:00:42,484 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=797, PETRI_PLACES=310, PETRI_TRANSITIONS=291} [2024-10-13 10:00:42,484 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -1 predicate places. [2024-10-13 10:00:42,484 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 291 transitions, 797 flow [2024-10-13 10:00:42,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 306.89473684210526) internal successors, (5831), 19 states have internal predecessors, (5831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:42,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:42,490 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] [2024-10-13 10:00:42,506 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:00:42,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-13 10:00:42,694 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:42,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:42,694 INFO L85 PathProgramCache]: Analyzing trace with hash -636323606, now seen corresponding path program 1 times [2024-10-13 10:00:42,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:42,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189014310] [2024-10-13 10:00:42,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:42,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:43,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:43,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189014310] [2024-10-13 10:00:43,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189014310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:43,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:43,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:43,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284046431] [2024-10-13 10:00:43,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:43,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:43,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:43,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:43,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:43,602 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2024-10-13 10:00:43,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 291 transitions, 797 flow. Second operand has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:43,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:43,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2024-10-13 10:00:43,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:44,425 INFO L124 PetriNetUnfolderBase]: 198/2471 cut-off events. [2024-10-13 10:00:44,425 INFO L125 PetriNetUnfolderBase]: For 285/294 co-relation queries the response was YES. [2024-10-13 10:00:44,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3256 conditions, 2471 events. 198/2471 cut-off events. For 285/294 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 18739 event pairs, 51 based on Foata normal form. 0/2341 useless extension candidates. Maximal degree in co-relation 3195. Up to 196 conditions per place. [2024-10-13 10:00:44,453 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 25 selfloop transitions, 5 changer transitions 0/298 dead transitions. [2024-10-13 10:00:44,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 298 transitions, 879 flow [2024-10-13 10:00:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2024-10-13 10:00:44,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9257620452310718 [2024-10-13 10:00:44,458 INFO L175 Difference]: Start difference. First operand has 310 places, 291 transitions, 797 flow. Second operand 6 states and 1883 transitions. [2024-10-13 10:00:44,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 298 transitions, 879 flow [2024-10-13 10:00:44,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 298 transitions, 862 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:44,464 INFO L231 Difference]: Finished difference. Result has 312 places, 290 transitions, 788 flow [2024-10-13 10:00:44,464 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=788, PETRI_PLACES=312, PETRI_TRANSITIONS=290} [2024-10-13 10:00:44,464 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, 1 predicate places. [2024-10-13 10:00:44,464 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 290 transitions, 788 flow [2024-10-13 10:00:44,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.6666666666667) internal successors, (1864), 6 states have internal predecessors, (1864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:44,465 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:44,466 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:44,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 10:00:44,466 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:44,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:44,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1931194269, now seen corresponding path program 1 times [2024-10-13 10:00:44,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:44,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998752875] [2024-10-13 10:00:44,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:44,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:44,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-10-13 10:00:44,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:44,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998752875] [2024-10-13 10:00:44,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998752875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:44,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:44,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:44,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372970912] [2024-10-13 10:00:44,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:44,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:44,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:44,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:44,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:45,099 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2024-10-13 10:00:45,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 290 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:45,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:45,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2024-10-13 10:00:45,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:45,386 INFO L124 PetriNetUnfolderBase]: 310/2227 cut-off events. [2024-10-13 10:00:45,387 INFO L125 PetriNetUnfolderBase]: For 335/504 co-relation queries the response was YES. [2024-10-13 10:00:45,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3143 conditions, 2227 events. 310/2227 cut-off events. For 335/504 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 16454 event pairs, 75 based on Foata normal form. 20/2123 useless extension candidates. Maximal degree in co-relation 3081. Up to 307 conditions per place. [2024-10-13 10:00:45,411 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 23 selfloop transitions, 5 changer transitions 13/297 dead transitions. [2024-10-13 10:00:45,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 297 transitions, 866 flow [2024-10-13 10:00:45,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:45,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:45,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2024-10-13 10:00:45,416 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9257620452310718 [2024-10-13 10:00:45,417 INFO L175 Difference]: Start difference. First operand has 312 places, 290 transitions, 788 flow. Second operand 6 states and 1883 transitions. [2024-10-13 10:00:45,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 297 transitions, 866 flow [2024-10-13 10:00:45,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 297 transitions, 854 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-10-13 10:00:45,421 INFO L231 Difference]: Finished difference. Result has 311 places, 276 transitions, 694 flow [2024-10-13 10:00:45,422 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=311, PETRI_TRANSITIONS=276} [2024-10-13 10:00:45,422 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, 0 predicate places. [2024-10-13 10:00:45,423 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 276 transitions, 694 flow [2024-10-13 10:00:45,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.8333333333333) internal successors, (1865), 6 states have internal predecessors, (1865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:45,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:45,424 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:45,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 10:00:45,424 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:45,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:45,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1277161248, now seen corresponding path program 2 times [2024-10-13 10:00:45,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:45,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327715668] [2024-10-13 10:00:45,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:45,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:45,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:45,695 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-13 10:00:45,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:45,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327715668] [2024-10-13 10:00:45,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327715668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:45,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:45,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:45,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004718971] [2024-10-13 10:00:45,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:45,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:45,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:45,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:45,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:45,980 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2024-10-13 10:00:45,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 276 transitions, 694 flow. Second operand has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:45,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:45,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2024-10-13 10:00:45,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:46,168 INFO L124 PetriNetUnfolderBase]: 96/1255 cut-off events. [2024-10-13 10:00:46,169 INFO L125 PetriNetUnfolderBase]: For 40/64 co-relation queries the response was YES. [2024-10-13 10:00:46,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 1255 events. 96/1255 cut-off events. For 40/64 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7426 event pairs, 21 based on Foata normal form. 8/1214 useless extension candidates. Maximal degree in co-relation 1656. Up to 88 conditions per place. [2024-10-13 10:00:46,185 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 23 selfloop transitions, 5 changer transitions 0/284 dead transitions. [2024-10-13 10:00:46,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 284 transitions, 774 flow [2024-10-13 10:00:46,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2024-10-13 10:00:46,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9257620452310718 [2024-10-13 10:00:46,187 INFO L175 Difference]: Start difference. First operand has 311 places, 276 transitions, 694 flow. Second operand 6 states and 1883 transitions. [2024-10-13 10:00:46,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 284 transitions, 774 flow [2024-10-13 10:00:46,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 284 transitions, 722 flow, removed 4 selfloop flow, removed 18 redundant places. [2024-10-13 10:00:46,191 INFO L231 Difference]: Finished difference. Result has 290 places, 276 transitions, 656 flow [2024-10-13 10:00:46,191 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=656, PETRI_PLACES=290, PETRI_TRANSITIONS=276} [2024-10-13 10:00:46,192 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2024-10-13 10:00:46,192 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 276 transitions, 656 flow [2024-10-13 10:00:46,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:46,193 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:46,193 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:46,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 10:00:46,193 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2024-10-13 10:00:46,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash -296542840, now seen corresponding path program 1 times [2024-10-13 10:00:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030624422] [2024-10-13 10:00:46,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-13 10:00:46,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:46,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030624422] [2024-10-13 10:00:46,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030624422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:46,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:46,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:46,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732809816] [2024-10-13 10:00:46,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:46,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:46,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:46,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:46,861 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 339 [2024-10-13 10:00:46,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 276 transitions, 656 flow. Second operand has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:46,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:46,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 339 [2024-10-13 10:00:46,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:47,079 INFO L124 PetriNetUnfolderBase]: 96/1249 cut-off events. [2024-10-13 10:00:47,080 INFO L125 PetriNetUnfolderBase]: For 33/57 co-relation queries the response was YES. [2024-10-13 10:00:47,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 1249 events. 96/1249 cut-off events. For 33/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7346 event pairs, 21 based on Foata normal form. 8/1202 useless extension candidates. Maximal degree in co-relation 1603. Up to 88 conditions per place. [2024-10-13 10:00:47,095 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 0 selfloop transitions, 0 changer transitions 283/283 dead transitions. [2024-10-13 10:00:47,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 283 transitions, 734 flow [2024-10-13 10:00:47,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1883 transitions. [2024-10-13 10:00:47,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9257620452310718 [2024-10-13 10:00:47,098 INFO L175 Difference]: Start difference. First operand has 290 places, 276 transitions, 656 flow. Second operand 6 states and 1883 transitions. [2024-10-13 10:00:47,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 283 transitions, 734 flow [2024-10-13 10:00:47,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 283 transitions, 726 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-13 10:00:47,102 INFO L231 Difference]: Finished difference. Result has 290 places, 0 transitions, 0 flow [2024-10-13 10:00:47,102 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=290, PETRI_TRANSITIONS=0} [2024-10-13 10:00:47,102 INFO L277 CegarLoopForPetriNet]: 311 programPoint places, -21 predicate places. [2024-10-13 10:00:47,102 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 0 transitions, 0 flow [2024-10-13 10:00:47,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 311.1666666666667) internal successors, (1867), 6 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:00:47,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (60 of 61 remaining) [2024-10-13 10:00:47,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (59 of 61 remaining) [2024-10-13 10:00:47,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (58 of 61 remaining) [2024-10-13 10:00:47,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (57 of 61 remaining) [2024-10-13 10:00:47,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 61 remaining) [2024-10-13 10:00:47,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (55 of 61 remaining) [2024-10-13 10:00:47,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (54 of 61 remaining) [2024-10-13 10:00:47,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (53 of 61 remaining) [2024-10-13 10:00:47,106 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (52 of 61 remaining) [2024-10-13 10:00:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (51 of 61 remaining) [2024-10-13 10:00:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (50 of 61 remaining) [2024-10-13 10:00:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (49 of 61 remaining) [2024-10-13 10:00:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (48 of 61 remaining) [2024-10-13 10:00:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (47 of 61 remaining) [2024-10-13 10:00:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (46 of 61 remaining) [2024-10-13 10:00:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (45 of 61 remaining) [2024-10-13 10:00:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (44 of 61 remaining) [2024-10-13 10:00:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (43 of 61 remaining) [2024-10-13 10:00:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (42 of 61 remaining) [2024-10-13 10:00:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (41 of 61 remaining) [2024-10-13 10:00:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (40 of 61 remaining) [2024-10-13 10:00:47,107 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (39 of 61 remaining) [2024-10-13 10:00:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (38 of 61 remaining) [2024-10-13 10:00:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 61 remaining) [2024-10-13 10:00:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (36 of 61 remaining) [2024-10-13 10:00:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 61 remaining) [2024-10-13 10:00:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 61 remaining) [2024-10-13 10:00:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (33 of 61 remaining) [2024-10-13 10:00:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (32 of 61 remaining) [2024-10-13 10:00:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 61 remaining) [2024-10-13 10:00:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (30 of 61 remaining) [2024-10-13 10:00:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (29 of 61 remaining) [2024-10-13 10:00:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (28 of 61 remaining) [2024-10-13 10:00:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (27 of 61 remaining) [2024-10-13 10:00:47,108 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (26 of 61 remaining) [2024-10-13 10:00:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (25 of 61 remaining) [2024-10-13 10:00:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2024-10-13 10:00:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2024-10-13 10:00:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2024-10-13 10:00:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 61 remaining) [2024-10-13 10:00:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 61 remaining) [2024-10-13 10:00:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 61 remaining) [2024-10-13 10:00:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (18 of 61 remaining) [2024-10-13 10:00:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (17 of 61 remaining) [2024-10-13 10:00:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (16 of 61 remaining) [2024-10-13 10:00:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (15 of 61 remaining) [2024-10-13 10:00:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 61 remaining) [2024-10-13 10:00:47,109 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 61 remaining) [2024-10-13 10:00:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 61 remaining) [2024-10-13 10:00:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (11 of 61 remaining) [2024-10-13 10:00:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (10 of 61 remaining) [2024-10-13 10:00:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 61 remaining) [2024-10-13 10:00:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (8 of 61 remaining) [2024-10-13 10:00:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (7 of 61 remaining) [2024-10-13 10:00:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 61 remaining) [2024-10-13 10:00:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (5 of 61 remaining) [2024-10-13 10:00:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (4 of 61 remaining) [2024-10-13 10:00:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (3 of 61 remaining) [2024-10-13 10:00:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (2 of 61 remaining) [2024-10-13 10:00:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 61 remaining) [2024-10-13 10:00:47,110 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (0 of 61 remaining) [2024-10-13 10:00:47,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 10:00:47,111 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:47,116 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 10:00:47,116 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:00:47,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:00:47 BasicIcfg [2024-10-13 10:00:47,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:00:47,122 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:00:47,122 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:00:47,123 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:00:47,123 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:00:31" (3/4) ... [2024-10-13 10:00:47,124 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 10:00:47,127 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-13 10:00:47,127 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-13 10:00:47,127 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-13 10:00:47,134 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-10-13 10:00:47,134 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 10:00:47,134 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 10:00:47,134 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 10:00:47,226 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:00:47,226 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 10:00:47,226 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:00:47,226 INFO L158 Benchmark]: Toolchain (without parser) took 17094.17ms. Allocated memory was 136.3MB in the beginning and 903.9MB in the end (delta: 767.6MB). Free memory was 66.1MB in the beginning and 688.8MB in the end (delta: -622.7MB). Peak memory consumption was 147.9MB. Max. memory is 16.1GB. [2024-10-13 10:00:47,227 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 136.3MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:00:47,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 335.20ms. Allocated memory was 136.3MB in the beginning and 218.1MB in the end (delta: 81.8MB). Free memory was 65.9MB in the beginning and 183.7MB in the end (delta: -117.9MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-10-13 10:00:47,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.97ms. Allocated memory is still 218.1MB. Free memory was 183.7MB in the beginning and 181.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:00:47,227 INFO L158 Benchmark]: Boogie Preprocessor took 30.17ms. Allocated memory is still 218.1MB. Free memory was 181.6MB in the beginning and 179.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 10:00:47,227 INFO L158 Benchmark]: RCFGBuilder took 615.97ms. Allocated memory is still 218.1MB. Free memory was 179.5MB in the beginning and 149.1MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 10:00:47,228 INFO L158 Benchmark]: TraceAbstraction took 15953.66ms. Allocated memory was 218.1MB in the beginning and 903.9MB in the end (delta: 685.8MB). Free memory was 148.1MB in the beginning and 695.1MB in the end (delta: -547.0MB). Peak memory consumption was 590.0MB. Max. memory is 16.1GB. [2024-10-13 10:00:47,228 INFO L158 Benchmark]: Witness Printer took 103.60ms. Allocated memory is still 903.9MB. Free memory was 695.1MB in the beginning and 688.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 10:00:47,229 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.15ms. Allocated memory is still 136.3MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 335.20ms. Allocated memory was 136.3MB in the beginning and 218.1MB in the end (delta: 81.8MB). Free memory was 65.9MB in the beginning and 183.7MB in the end (delta: -117.9MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.97ms. Allocated memory is still 218.1MB. Free memory was 183.7MB in the beginning and 181.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.17ms. Allocated memory is still 218.1MB. Free memory was 181.6MB in the beginning and 179.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 615.97ms. Allocated memory is still 218.1MB. Free memory was 179.5MB in the beginning and 149.1MB in the end (delta: 30.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15953.66ms. Allocated memory was 218.1MB in the beginning and 903.9MB in the end (delta: 685.8MB). Free memory was 148.1MB in the beginning and 695.1MB in the end (delta: -547.0MB). Peak memory consumption was 590.0MB. Max. memory is 16.1GB. * Witness Printer took 103.60ms. Allocated memory is still 903.9MB. Free memory was 695.1MB in the beginning and 688.8MB 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: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: 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: 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: 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: 76]: 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: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 473 locations, 61 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: 15.8s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2585 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1575 mSDsluCounter, 1421 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1211 mSDsCounter, 587 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4285 IncrementalHoareTripleChecker+Invalid, 4872 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 587 mSolverCounterUnsat, 210 mSDtfsCounter, 4285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 280 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred in iteration=21, InterpolantAutomatonStates: 118, 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.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2631 NumberOfCodeBlocks, 2631 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2733 ConstructedInterpolants, 0 QuantifiedInterpolants, 4644 SizeOfPredicates, 7 NumberOfNonLiveVariables, 261 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 27 InterpolantComputations, 24 PerfectInterpolantSequences, 34/37 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 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 10:00:47,258 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