./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/chl-array-int-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:13:20,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:13:20,308 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:13:20,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:13:20,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:13:20,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:13:20,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:13:20,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:13:20,367 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:13:20,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:13:20,368 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:13:20,368 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:13:20,380 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:13:20,380 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:13:20,380 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:13:20,380 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:13:20,380 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:13:20,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:13:20,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:13:20,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:13:20,381 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:13:20,385 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:13:20,385 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:13:20,386 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:13:20,386 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:13:20,386 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:13:20,386 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:13:20,386 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:13:20,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:13:20,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:13:20,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:13:20,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:20,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:13:20,387 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:13:20,387 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:13:20,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:13:20,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:13:20,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:13:20,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:13:20,388 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:13:20,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:13:20,392 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-clean/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-clean/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 -> 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 [2024-10-11 17:13:20,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:13:20,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:13:20,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:13:20,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:13:20,688 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:13:20,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2024-10-11 17:13:22,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:13:22,260 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:13:22,261 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2024-10-11 17:13:22,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/32eba116c/ebeef3897c584bd9b214f54e35a87a3c/FLAG80f2a7987 [2024-10-11 17:13:22,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/32eba116c/ebeef3897c584bd9b214f54e35a87a3c [2024-10-11 17:13:22,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:13:22,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:13:22,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:22,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:13:22,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:13:22,673 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:22" (1/1) ... [2024-10-11 17:13:22,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3345edb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:22, skipping insertion in model container [2024-10-11 17:13:22,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:22" (1/1) ... [2024-10-11 17:13:22,691 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:13:23,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:23,115 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:13:23,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:23,220 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:13:23,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23 WrapperNode [2024-10-11 17:13:23,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:23,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:23,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:13:23,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:13:23,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,320 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 351 [2024-10-11 17:13:23,324 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:23,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:13:23,327 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:13:23,327 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:13:23,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,401 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,409 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:13:23,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:13:23,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:13:23,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:13:23,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (1/1) ... [2024-10-11 17:13:23,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:23,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:13:23,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:13:23,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:13:23,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:13:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:13:23,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:13:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:13:23,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:13:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:13:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:13:23,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:13:23,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:13:23,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:13:23,567 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:13:23,568 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:13:23,651 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:13:23,653 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:13:24,073 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:13:24,073 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:13:24,093 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:13:24,094 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 17:13:24,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:24 BoogieIcfgContainer [2024-10-11 17:13:24,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:13:24,096 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:13:24,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:13:24,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:13:24,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:13:22" (1/3) ... [2024-10-11 17:13:24,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3830fb96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:24, skipping insertion in model container [2024-10-11 17:13:24,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:23" (2/3) ... [2024-10-11 17:13:24,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3830fb96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:24, skipping insertion in model container [2024-10-11 17:13:24,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:24" (3/3) ... [2024-10-11 17:13:24,102 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2024-10-11 17:13:24,115 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:13:24,116 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2024-10-11 17:13:24,116 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:13:24,223 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:13:24,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 440 places, 459 transitions, 932 flow [2024-10-11 17:13:24,443 INFO L124 PetriNetUnfolderBase]: 26/457 cut-off events. [2024-10-11 17:13:24,449 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:13:24,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 466 conditions, 457 events. 26/457 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 888 event pairs, 0 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 274. Up to 3 conditions per place. [2024-10-11 17:13:24,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 440 places, 459 transitions, 932 flow [2024-10-11 17:13:24,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 420 places, 437 transitions, 886 flow [2024-10-11 17:13:24,482 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:13:24,490 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;@a9e74c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:13:24,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2024-10-11 17:13:24,496 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:13:24,496 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-10-11 17:13:24,496 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:13:24,496 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:24,497 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:24,497 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:24,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:24,502 INFO L85 PathProgramCache]: Analyzing trace with hash 198780923, now seen corresponding path program 1 times [2024-10-11 17:13:24,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:24,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552349394] [2024-10-11 17:13:24,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:24,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:24,661 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-11 17:13:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552349394] [2024-10-11 17:13:24,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552349394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:24,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:24,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:24,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940206783] [2024-10-11 17:13:24,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:24,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:24,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:24,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:24,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:24,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 459 [2024-10-11 17:13:24,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 437 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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-11 17:13:24,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:24,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 459 [2024-10-11 17:13:24,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:24,840 INFO L124 PetriNetUnfolderBase]: 27/762 cut-off events. [2024-10-11 17:13:24,841 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-11 17:13:24,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 762 events. 27/762 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2903 event pairs, 8 based on Foata normal form. 18/660 useless extension candidates. Maximal degree in co-relation 591. Up to 29 conditions per place. [2024-10-11 17:13:24,848 INFO L140 encePairwiseOnDemand]: 442/459 looper letters, 12 selfloop transitions, 2 changer transitions 6/422 dead transitions. [2024-10-11 17:13:24,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 422 transitions, 884 flow [2024-10-11 17:13:24,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:24,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1310 transitions. [2024-10-11 17:13:24,862 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9513435003631082 [2024-10-11 17:13:24,863 INFO L175 Difference]: Start difference. First operand has 420 places, 437 transitions, 886 flow. Second operand 3 states and 1310 transitions. [2024-10-11 17:13:24,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 422 transitions, 884 flow [2024-10-11 17:13:24,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 422 transitions, 876 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:13:24,873 INFO L231 Difference]: Finished difference. Result has 417 places, 416 transitions, 840 flow [2024-10-11 17:13:24,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=417, PETRI_TRANSITIONS=416} [2024-10-11 17:13:24,879 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -3 predicate places. [2024-10-11 17:13:24,879 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 416 transitions, 840 flow [2024-10-11 17:13:24,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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-11 17:13:24,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:24,880 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] [2024-10-11 17:13:24,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:13:24,881 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:24,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:24,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1174509040, now seen corresponding path program 1 times [2024-10-11 17:13:24,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:24,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816697499] [2024-10-11 17:13:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:24,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:24,913 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-11 17:13:24,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:24,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816697499] [2024-10-11 17:13:24,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816697499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:24,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:24,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:24,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007729421] [2024-10-11 17:13:24,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:24,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:24,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:24,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:24,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:24,953 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 459 [2024-10-11 17:13:24,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 416 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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-11 17:13:24,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:24,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 459 [2024-10-11 17:13:24,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:25,063 INFO L124 PetriNetUnfolderBase]: 27/746 cut-off events. [2024-10-11 17:13:25,063 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:13:25,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 746 events. 27/746 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2870 event pairs, 8 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 755. Up to 29 conditions per place. [2024-10-11 17:13:25,067 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 12 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2024-10-11 17:13:25,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 415 transitions, 866 flow [2024-10-11 17:13:25,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:25,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1296 transitions. [2024-10-11 17:13:25,070 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2024-10-11 17:13:25,070 INFO L175 Difference]: Start difference. First operand has 417 places, 416 transitions, 840 flow. Second operand 3 states and 1296 transitions. [2024-10-11 17:13:25,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 415 transitions, 866 flow [2024-10-11 17:13:25,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 415 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:25,075 INFO L231 Difference]: Finished difference. Result has 410 places, 415 transitions, 838 flow [2024-10-11 17:13:25,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=410, PETRI_TRANSITIONS=415} [2024-10-11 17:13:25,077 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -10 predicate places. [2024-10-11 17:13:25,077 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 415 transitions, 838 flow [2024-10-11 17:13:25,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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-11 17:13:25,078 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:25,078 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:25,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:13:25,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:25,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:25,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1661670269, now seen corresponding path program 1 times [2024-10-11 17:13:25,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:25,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58935888] [2024-10-11 17:13:25,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:25,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:25,112 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-11 17:13:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:25,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58935888] [2024-10-11 17:13:25,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58935888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:25,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:25,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:25,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330083258] [2024-10-11 17:13:25,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:25,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:25,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:25,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:25,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:25,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 459 [2024-10-11 17:13:25,154 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 415 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-11 17:13:25,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:25,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 459 [2024-10-11 17:13:25,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:25,324 INFO L124 PetriNetUnfolderBase]: 62/1354 cut-off events. [2024-10-11 17:13:25,324 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:13:25,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 1354 events. 62/1354 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7770 event pairs, 24 based on Foata normal form. 0/1156 useless extension candidates. Maximal degree in co-relation 1395. Up to 67 conditions per place. [2024-10-11 17:13:25,333 INFO L140 encePairwiseOnDemand]: 453/459 looper letters, 14 selfloop transitions, 1 changer transitions 0/410 dead transitions. [2024-10-11 17:13:25,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 410 transitions, 858 flow [2024-10-11 17:13:25,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:25,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1289 transitions. [2024-10-11 17:13:25,338 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9360929557007989 [2024-10-11 17:13:25,338 INFO L175 Difference]: Start difference. First operand has 410 places, 415 transitions, 838 flow. Second operand 3 states and 1289 transitions. [2024-10-11 17:13:25,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 410 transitions, 858 flow [2024-10-11 17:13:25,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 410 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:25,343 INFO L231 Difference]: Finished difference. Result has 405 places, 410 transitions, 826 flow [2024-10-11 17:13:25,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=405, PETRI_TRANSITIONS=410} [2024-10-11 17:13:25,345 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -15 predicate places. [2024-10-11 17:13:25,346 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 410 transitions, 826 flow [2024-10-11 17:13:25,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-11 17:13:25,347 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:25,347 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:25,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:13:25,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:25,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1383884967, now seen corresponding path program 1 times [2024-10-11 17:13:25,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:25,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107875295] [2024-10-11 17:13:25,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:25,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:25,436 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-11 17:13:25,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:25,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107875295] [2024-10-11 17:13:25,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107875295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:25,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:25,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:25,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462875538] [2024-10-11 17:13:25,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:25,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:25,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:25,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:25,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:25,473 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 459 [2024-10-11 17:13:25,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 410 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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-11 17:13:25,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:25,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 459 [2024-10-11 17:13:25,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:25,563 INFO L124 PetriNetUnfolderBase]: 24/645 cut-off events. [2024-10-11 17:13:25,563 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-11 17:13:25,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 645 events. 24/645 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2147 event pairs, 8 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 644. Up to 28 conditions per place. [2024-10-11 17:13:25,568 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 11 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2024-10-11 17:13:25,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 409 transitions, 850 flow [2024-10-11 17:13:25,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:25,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2024-10-11 17:13:25,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9426289034132171 [2024-10-11 17:13:25,571 INFO L175 Difference]: Start difference. First operand has 405 places, 410 transitions, 826 flow. Second operand 3 states and 1298 transitions. [2024-10-11 17:13:25,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 409 transitions, 850 flow [2024-10-11 17:13:25,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 409 transitions, 849 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:25,577 INFO L231 Difference]: Finished difference. Result has 405 places, 409 transitions, 827 flow [2024-10-11 17:13:25,578 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=827, PETRI_PLACES=405, PETRI_TRANSITIONS=409} [2024-10-11 17:13:25,578 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -15 predicate places. [2024-10-11 17:13:25,578 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 409 transitions, 827 flow [2024-10-11 17:13:25,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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-11 17:13:25,579 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:25,580 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:25,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:13:25,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:25,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:25,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1526450652, now seen corresponding path program 1 times [2024-10-11 17:13:25,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:25,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388009130] [2024-10-11 17:13:25,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:25,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:26,013 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-11 17:13:26,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:26,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388009130] [2024-10-11 17:13:26,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388009130] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:26,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:26,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:26,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812399521] [2024-10-11 17:13:26,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:26,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:26,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:26,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:26,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:26,458 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 459 [2024-10-11 17:13:26,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 409 transitions, 827 flow. Second operand has 6 states, 6 states have (on average 380.5) internal successors, (2283), 6 states have internal predecessors, (2283), 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-11 17:13:26,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:26,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 459 [2024-10-11 17:13:26,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:26,729 INFO L124 PetriNetUnfolderBase]: 393/2911 cut-off events. [2024-10-11 17:13:26,729 INFO L125 PetriNetUnfolderBase]: For 46/47 co-relation queries the response was YES. [2024-10-11 17:13:26,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3635 conditions, 2911 events. 393/2911 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 22385 event pairs, 288 based on Foata normal form. 0/2513 useless extension candidates. Maximal degree in co-relation 3598. Up to 691 conditions per place. [2024-10-11 17:13:26,745 INFO L140 encePairwiseOnDemand]: 447/459 looper letters, 52 selfloop transitions, 10 changer transitions 0/407 dead transitions. [2024-10-11 17:13:26,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 407 transitions, 947 flow [2024-10-11 17:13:26,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:26,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:26,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2024-10-11 17:13:26,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8489469862018881 [2024-10-11 17:13:26,749 INFO L175 Difference]: Start difference. First operand has 405 places, 409 transitions, 827 flow. Second operand 6 states and 2338 transitions. [2024-10-11 17:13:26,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 407 transitions, 947 flow [2024-10-11 17:13:26,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 407 transitions, 943 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:26,757 INFO L231 Difference]: Finished difference. Result has 406 places, 407 transitions, 839 flow [2024-10-11 17:13:26,758 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=839, PETRI_PLACES=406, PETRI_TRANSITIONS=407} [2024-10-11 17:13:26,758 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -14 predicate places. [2024-10-11 17:13:26,758 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 407 transitions, 839 flow [2024-10-11 17:13:26,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 380.5) internal successors, (2283), 6 states have internal predecessors, (2283), 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-11 17:13:26,761 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:26,761 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:26,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:13:26,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:26,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:26,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2027577560, now seen corresponding path program 1 times [2024-10-11 17:13:26,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:26,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124325319] [2024-10-11 17:13:26,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:26,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:26,802 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-11 17:13:26,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:26,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124325319] [2024-10-11 17:13:26,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124325319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:26,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:26,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:26,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693657344] [2024-10-11 17:13:26,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:26,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:26,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:26,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:26,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:26,838 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 459 [2024-10-11 17:13:26,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 407 transitions, 839 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-11 17:13:26,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:26,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 459 [2024-10-11 17:13:26,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:26,980 INFO L124 PetriNetUnfolderBase]: 65/1347 cut-off events. [2024-10-11 17:13:26,980 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-11 17:13:26,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 1347 events. 65/1347 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7667 event pairs, 24 based on Foata normal form. 0/1170 useless extension candidates. Maximal degree in co-relation 1404. Up to 69 conditions per place. [2024-10-11 17:13:26,990 INFO L140 encePairwiseOnDemand]: 453/459 looper letters, 14 selfloop transitions, 1 changer transitions 0/402 dead transitions. [2024-10-11 17:13:26,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 402 transitions, 859 flow [2024-10-11 17:13:26,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1289 transitions. [2024-10-11 17:13:26,992 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9360929557007989 [2024-10-11 17:13:26,992 INFO L175 Difference]: Start difference. First operand has 406 places, 407 transitions, 839 flow. Second operand 3 states and 1289 transitions. [2024-10-11 17:13:26,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 402 transitions, 859 flow [2024-10-11 17:13:26,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 402 transitions, 839 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:26,997 INFO L231 Difference]: Finished difference. Result has 398 places, 402 transitions, 811 flow [2024-10-11 17:13:26,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=398, PETRI_TRANSITIONS=402} [2024-10-11 17:13:27,000 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -22 predicate places. [2024-10-11 17:13:27,001 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 402 transitions, 811 flow [2024-10-11 17:13:27,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-11 17:13:27,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:27,002 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:27,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:13:27,002 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:27,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:27,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1140018953, now seen corresponding path program 1 times [2024-10-11 17:13:27,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:27,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633207996] [2024-10-11 17:13:27,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:27,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:27,051 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-11 17:13:27,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:27,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633207996] [2024-10-11 17:13:27,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633207996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:27,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:27,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:27,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747415429] [2024-10-11 17:13:27,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:27,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:27,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:27,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:27,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:27,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 459 [2024-10-11 17:13:27,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 402 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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-11 17:13:27,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:27,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 459 [2024-10-11 17:13:27,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:27,128 INFO L124 PetriNetUnfolderBase]: 24/633 cut-off events. [2024-10-11 17:13:27,129 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-11 17:13:27,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 633 events. 24/633 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2034 event pairs, 8 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 633. Up to 28 conditions per place. [2024-10-11 17:13:27,132 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 11 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2024-10-11 17:13:27,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 401 transitions, 835 flow [2024-10-11 17:13:27,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2024-10-11 17:13:27,135 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9426289034132171 [2024-10-11 17:13:27,135 INFO L175 Difference]: Start difference. First operand has 398 places, 402 transitions, 811 flow. Second operand 3 states and 1298 transitions. [2024-10-11 17:13:27,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 401 transitions, 835 flow [2024-10-11 17:13:27,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 401 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:27,140 INFO L231 Difference]: Finished difference. Result has 398 places, 401 transitions, 812 flow [2024-10-11 17:13:27,140 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=398, PETRI_TRANSITIONS=401} [2024-10-11 17:13:27,141 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -22 predicate places. [2024-10-11 17:13:27,141 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 401 transitions, 812 flow [2024-10-11 17:13:27,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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-11 17:13:27,142 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:27,143 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-11 17:13:27,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:13:27,143 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:27,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:27,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1506054664, now seen corresponding path program 1 times [2024-10-11 17:13:27,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:27,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483038457] [2024-10-11 17:13:27,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:27,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:27,188 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-11 17:13:27,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:27,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483038457] [2024-10-11 17:13:27,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483038457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:27,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:27,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:27,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993078446] [2024-10-11 17:13:27,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:27,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:27,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:27,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:27,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:27,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 459 [2024-10-11 17:13:27,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 401 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 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-11 17:13:27,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:27,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 459 [2024-10-11 17:13:27,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:27,273 INFO L124 PetriNetUnfolderBase]: 21/615 cut-off events. [2024-10-11 17:13:27,273 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2024-10-11 17:13:27,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 615 events. 21/615 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1981 event pairs, 3 based on Foata normal form. 1/548 useless extension candidates. Maximal degree in co-relation 614. Up to 17 conditions per place. [2024-10-11 17:13:27,276 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 11 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2024-10-11 17:13:27,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 401 transitions, 839 flow [2024-10-11 17:13:27,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1304 transitions. [2024-10-11 17:13:27,279 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9469862018881626 [2024-10-11 17:13:27,279 INFO L175 Difference]: Start difference. First operand has 398 places, 401 transitions, 812 flow. Second operand 3 states and 1304 transitions. [2024-10-11 17:13:27,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 401 transitions, 839 flow [2024-10-11 17:13:27,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 401 transitions, 835 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:27,284 INFO L231 Difference]: Finished difference. Result has 397 places, 400 transitions, 810 flow [2024-10-11 17:13:27,284 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=397, PETRI_TRANSITIONS=400} [2024-10-11 17:13:27,285 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -23 predicate places. [2024-10-11 17:13:27,285 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 400 transitions, 810 flow [2024-10-11 17:13:27,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 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-11 17:13:27,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:27,286 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-11 17:13:27,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:13:27,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:27,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:27,287 INFO L85 PathProgramCache]: Analyzing trace with hash 147824934, now seen corresponding path program 1 times [2024-10-11 17:13:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227787602] [2024-10-11 17:13:27,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:27,324 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-11 17:13:27,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:27,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227787602] [2024-10-11 17:13:27,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227787602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:27,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:27,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:27,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246883443] [2024-10-11 17:13:27,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:27,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:27,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:27,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:27,358 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 459 [2024-10-11 17:13:27,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 400 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 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-11 17:13:27,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:27,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 459 [2024-10-11 17:13:27,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:27,454 INFO L124 PetriNetUnfolderBase]: 18/504 cut-off events. [2024-10-11 17:13:27,454 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-10-11 17:13:27,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 504 events. 18/504 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1264 event pairs, 3 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 498. Up to 17 conditions per place. [2024-10-11 17:13:27,457 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 11 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2024-10-11 17:13:27,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 400 transitions, 837 flow [2024-10-11 17:13:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1304 transitions. [2024-10-11 17:13:27,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9469862018881626 [2024-10-11 17:13:27,464 INFO L175 Difference]: Start difference. First operand has 397 places, 400 transitions, 810 flow. Second operand 3 states and 1304 transitions. [2024-10-11 17:13:27,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 400 transitions, 837 flow [2024-10-11 17:13:27,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 400 transitions, 833 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:27,473 INFO L231 Difference]: Finished difference. Result has 396 places, 399 transitions, 808 flow [2024-10-11 17:13:27,473 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=808, PETRI_PLACES=396, PETRI_TRANSITIONS=399} [2024-10-11 17:13:27,474 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -24 predicate places. [2024-10-11 17:13:27,474 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 399 transitions, 808 flow [2024-10-11 17:13:27,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 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-11 17:13:27,475 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:27,475 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] [2024-10-11 17:13:27,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:13:27,475 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:27,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:27,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1125389790, now seen corresponding path program 1 times [2024-10-11 17:13:27,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:27,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668327747] [2024-10-11 17:13:27,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:27,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:27,503 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-11 17:13:27,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:27,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668327747] [2024-10-11 17:13:27,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668327747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:27,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:27,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:13:27,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865375046] [2024-10-11 17:13:27,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:27,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:27,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:27,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:27,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:27,511 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 459 [2024-10-11 17:13:27,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 399 transitions, 808 flow. Second operand has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 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-11 17:13:27,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:27,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 459 [2024-10-11 17:13:27,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:27,560 INFO L124 PetriNetUnfolderBase]: 24/615 cut-off events. [2024-10-11 17:13:27,560 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2024-10-11 17:13:27,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 615 events. 24/615 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1939 event pairs, 6 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 628. Up to 24 conditions per place. [2024-10-11 17:13:27,563 INFO L140 encePairwiseOnDemand]: 455/459 looper letters, 11 selfloop transitions, 3 changer transitions 0/401 dead transitions. [2024-10-11 17:13:27,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 401 transitions, 841 flow [2024-10-11 17:13:27,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:27,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:27,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2024-10-11 17:13:27,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9498910675381264 [2024-10-11 17:13:27,566 INFO L175 Difference]: Start difference. First operand has 396 places, 399 transitions, 808 flow. Second operand 3 states and 1308 transitions. [2024-10-11 17:13:27,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 401 transitions, 841 flow [2024-10-11 17:13:27,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 401 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:27,572 INFO L231 Difference]: Finished difference. Result has 398 places, 400 transitions, 822 flow [2024-10-11 17:13:27,573 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=398, PETRI_TRANSITIONS=400} [2024-10-11 17:13:27,573 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -22 predicate places. [2024-10-11 17:13:27,573 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 400 transitions, 822 flow [2024-10-11 17:13:27,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 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-11 17:13:27,574 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:27,574 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] [2024-10-11 17:13:27,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:13:27,575 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:27,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:27,575 INFO L85 PathProgramCache]: Analyzing trace with hash 747286598, now seen corresponding path program 1 times [2024-10-11 17:13:27,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:27,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819822197] [2024-10-11 17:13:27,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:27,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:27,601 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-11 17:13:27,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:27,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819822197] [2024-10-11 17:13:27,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819822197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:27,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:27,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:27,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806595888] [2024-10-11 17:13:27,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:27,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:27,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:27,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:27,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:27,615 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 459 [2024-10-11 17:13:27,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 400 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-11 17:13:27,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:27,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 459 [2024-10-11 17:13:27,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:27,746 INFO L124 PetriNetUnfolderBase]: 69/1225 cut-off events. [2024-10-11 17:13:27,747 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2024-10-11 17:13:27,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 1225 events. 69/1225 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6557 event pairs, 12 based on Foata normal form. 0/1091 useless extension candidates. Maximal degree in co-relation 1315. Up to 79 conditions per place. [2024-10-11 17:13:27,754 INFO L140 encePairwiseOnDemand]: 453/459 looper letters, 16 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2024-10-11 17:13:27,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 401 transitions, 863 flow [2024-10-11 17:13:27,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2024-10-11 17:13:27,757 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.944081336238199 [2024-10-11 17:13:27,757 INFO L175 Difference]: Start difference. First operand has 398 places, 400 transitions, 822 flow. Second operand 3 states and 1300 transitions. [2024-10-11 17:13:27,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 401 transitions, 863 flow [2024-10-11 17:13:27,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 401 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:27,763 INFO L231 Difference]: Finished difference. Result has 395 places, 398 transitions, 822 flow [2024-10-11 17:13:27,764 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=395, PETRI_TRANSITIONS=398} [2024-10-11 17:13:27,765 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -25 predicate places. [2024-10-11 17:13:27,765 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 398 transitions, 822 flow [2024-10-11 17:13:27,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-11 17:13:27,766 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:27,766 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] [2024-10-11 17:13:27,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:13:27,766 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:27,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:27,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1620033770, now seen corresponding path program 1 times [2024-10-11 17:13:27,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:27,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632742920] [2024-10-11 17:13:27,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:27,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:28,020 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-11 17:13:28,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:28,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632742920] [2024-10-11 17:13:28,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632742920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:28,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:28,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:13:28,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714200625] [2024-10-11 17:13:28,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:28,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:13:28,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:28,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:13:28,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:13:28,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 459 [2024-10-11 17:13:28,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 398 transitions, 822 flow. Second operand has 8 states, 8 states have (on average 412.125) internal successors, (3297), 8 states have internal predecessors, (3297), 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-11 17:13:28,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:28,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 459 [2024-10-11 17:13:28,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:28,508 INFO L124 PetriNetUnfolderBase]: 65/1275 cut-off events. [2024-10-11 17:13:28,508 INFO L125 PetriNetUnfolderBase]: For 7/19 co-relation queries the response was YES. [2024-10-11 17:13:28,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 1275 events. 65/1275 cut-off events. For 7/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6563 event pairs, 15 based on Foata normal form. 3/1156 useless extension candidates. Maximal degree in co-relation 1453. Up to 70 conditions per place. [2024-10-11 17:13:28,517 INFO L140 encePairwiseOnDemand]: 443/459 looper letters, 43 selfloop transitions, 18 changer transitions 0/424 dead transitions. [2024-10-11 17:13:28,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 424 transitions, 1009 flow [2024-10-11 17:13:28,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:13:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-10-11 17:13:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4970 transitions. [2024-10-11 17:13:28,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9023238925199709 [2024-10-11 17:13:28,560 INFO L175 Difference]: Start difference. First operand has 395 places, 398 transitions, 822 flow. Second operand 12 states and 4970 transitions. [2024-10-11 17:13:28,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 424 transitions, 1009 flow [2024-10-11 17:13:28,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 424 transitions, 1009 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:28,566 INFO L231 Difference]: Finished difference. Result has 412 places, 407 transitions, 915 flow [2024-10-11 17:13:28,566 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=915, PETRI_PLACES=412, PETRI_TRANSITIONS=407} [2024-10-11 17:13:28,568 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -8 predicate places. [2024-10-11 17:13:28,568 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 407 transitions, 915 flow [2024-10-11 17:13:28,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.125) internal successors, (3297), 8 states have internal predecessors, (3297), 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-11 17:13:28,570 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:28,570 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] [2024-10-11 17:13:28,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:13:28,570 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:28,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:28,571 INFO L85 PathProgramCache]: Analyzing trace with hash 943823019, now seen corresponding path program 1 times [2024-10-11 17:13:28,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:28,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819649051] [2024-10-11 17:13:28,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:28,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:28,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:28,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:28,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819649051] [2024-10-11 17:13:28,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819649051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:28,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:28,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:13:28,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058371653] [2024-10-11 17:13:28,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:28,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:28,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:28,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:28,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:28,612 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 459 [2024-10-11 17:13:28,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 407 transitions, 915 flow. Second operand has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 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-11 17:13:28,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:28,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 459 [2024-10-11 17:13:28,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:28,706 INFO L124 PetriNetUnfolderBase]: 86/1151 cut-off events. [2024-10-11 17:13:28,707 INFO L125 PetriNetUnfolderBase]: For 72/75 co-relation queries the response was YES. [2024-10-11 17:13:28,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1151 events. 86/1151 cut-off events. For 72/75 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6133 event pairs, 24 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 1340. Up to 98 conditions per place. [2024-10-11 17:13:28,713 INFO L140 encePairwiseOnDemand]: 455/459 looper letters, 11 selfloop transitions, 3 changer transitions 0/409 dead transitions. [2024-10-11 17:13:28,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 409 transitions, 948 flow [2024-10-11 17:13:28,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:28,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:28,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2024-10-11 17:13:28,715 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9498910675381264 [2024-10-11 17:13:28,715 INFO L175 Difference]: Start difference. First operand has 412 places, 407 transitions, 915 flow. Second operand 3 states and 1308 transitions. [2024-10-11 17:13:28,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 409 transitions, 948 flow [2024-10-11 17:13:28,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 409 transitions, 948 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:28,722 INFO L231 Difference]: Finished difference. Result has 416 places, 408 transitions, 933 flow [2024-10-11 17:13:28,723 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=933, PETRI_PLACES=416, PETRI_TRANSITIONS=408} [2024-10-11 17:13:28,723 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -4 predicate places. [2024-10-11 17:13:28,724 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 408 transitions, 933 flow [2024-10-11 17:13:28,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 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-11 17:13:28,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:28,725 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 17:13:28,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:13:28,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:28,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:28,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1799874040, now seen corresponding path program 1 times [2024-10-11 17:13:28,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:28,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924047646] [2024-10-11 17:13:28,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:28,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:28,873 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-11 17:13:28,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:28,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924047646] [2024-10-11 17:13:28,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924047646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:28,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:28,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:13:28,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533448003] [2024-10-11 17:13:28,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:28,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:13:28,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:28,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:13:28,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:13:29,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 459 [2024-10-11 17:13:29,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 408 transitions, 933 flow. Second operand has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 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-11 17:13:29,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:29,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 459 [2024-10-11 17:13:29,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:29,399 INFO L124 PetriNetUnfolderBase]: 68/915 cut-off events. [2024-10-11 17:13:29,399 INFO L125 PetriNetUnfolderBase]: For 83/86 co-relation queries the response was YES. [2024-10-11 17:13:29,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 915 events. 68/915 cut-off events. For 83/86 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4068 event pairs, 20 based on Foata normal form. 2/845 useless extension candidates. Maximal degree in co-relation 1147. Up to 105 conditions per place. [2024-10-11 17:13:29,403 INFO L140 encePairwiseOnDemand]: 445/459 looper letters, 45 selfloop transitions, 15 changer transitions 0/428 dead transitions. [2024-10-11 17:13:29,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 428 transitions, 1109 flow [2024-10-11 17:13:29,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:13:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 17:13:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4559 transitions. [2024-10-11 17:13:29,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9029510794216676 [2024-10-11 17:13:29,410 INFO L175 Difference]: Start difference. First operand has 416 places, 408 transitions, 933 flow. Second operand 11 states and 4559 transitions. [2024-10-11 17:13:29,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 428 transitions, 1109 flow [2024-10-11 17:13:29,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 428 transitions, 1099 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:29,417 INFO L231 Difference]: Finished difference. Result has 427 places, 411 transitions, 982 flow [2024-10-11 17:13:29,418 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=982, PETRI_PLACES=427, PETRI_TRANSITIONS=411} [2024-10-11 17:13:29,418 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, 7 predicate places. [2024-10-11 17:13:29,418 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 411 transitions, 982 flow [2024-10-11 17:13:29,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 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-11 17:13:29,420 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:29,420 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:29,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:13:29,421 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:29,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:29,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1177895645, now seen corresponding path program 1 times [2024-10-11 17:13:29,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:29,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737125426] [2024-10-11 17:13:29,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:29,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:29,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:29,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:13:29,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:29,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737125426] [2024-10-11 17:13:29,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737125426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:29,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:29,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:13:29,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661632138] [2024-10-11 17:13:29,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:29,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:13:29,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:29,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:13:29,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:13:30,022 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 459 [2024-10-11 17:13:30,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 411 transitions, 982 flow. Second operand has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 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-11 17:13:30,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:30,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 459 [2024-10-11 17:13:30,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:30,271 INFO L124 PetriNetUnfolderBase]: 75/1344 cut-off events. [2024-10-11 17:13:30,271 INFO L125 PetriNetUnfolderBase]: For 109/127 co-relation queries the response was YES. [2024-10-11 17:13:30,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 1344 events. 75/1344 cut-off events. For 109/127 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6800 event pairs, 23 based on Foata normal form. 4/1249 useless extension candidates. Maximal degree in co-relation 1762. Up to 114 conditions per place. [2024-10-11 17:13:30,278 INFO L140 encePairwiseOnDemand]: 444/459 looper letters, 48 selfloop transitions, 19 changer transitions 0/434 dead transitions. [2024-10-11 17:13:30,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 434 transitions, 1209 flow [2024-10-11 17:13:30,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:13:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 17:13:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4552 transitions. [2024-10-11 17:13:30,287 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9015646662705487 [2024-10-11 17:13:30,288 INFO L175 Difference]: Start difference. First operand has 427 places, 411 transitions, 982 flow. Second operand 11 states and 4552 transitions. [2024-10-11 17:13:30,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 434 transitions, 1209 flow [2024-10-11 17:13:30,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 434 transitions, 1188 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-11 17:13:30,296 INFO L231 Difference]: Finished difference. Result has 435 places, 423 transitions, 1093 flow [2024-10-11 17:13:30,296 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1093, PETRI_PLACES=435, PETRI_TRANSITIONS=423} [2024-10-11 17:13:30,297 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, 15 predicate places. [2024-10-11 17:13:30,297 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 423 transitions, 1093 flow [2024-10-11 17:13:30,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 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-11 17:13:30,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:30,299 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:30,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:13:30,299 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:30,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:30,299 INFO L85 PathProgramCache]: Analyzing trace with hash -74259029, now seen corresponding path program 1 times [2024-10-11 17:13:30,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:30,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971725187] [2024-10-11 17:13:30,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:30,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:13:30,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:30,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971725187] [2024-10-11 17:13:30,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971725187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:30,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:30,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:13:30,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758137563] [2024-10-11 17:13:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:30,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:13:30,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:30,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:13:30,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:13:30,836 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 459 [2024-10-11 17:13:30,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 423 transitions, 1093 flow. Second operand has 8 states, 8 states have (on average 412.375) internal successors, (3299), 8 states have internal predecessors, (3299), 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-11 17:13:30,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:30,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 459 [2024-10-11 17:13:30,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:31,099 INFO L124 PetriNetUnfolderBase]: 87/1207 cut-off events. [2024-10-11 17:13:31,099 INFO L125 PetriNetUnfolderBase]: For 205/210 co-relation queries the response was YES. [2024-10-11 17:13:31,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1690 conditions, 1207 events. 87/1207 cut-off events. For 205/210 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6218 event pairs, 29 based on Foata normal form. 0/1115 useless extension candidates. Maximal degree in co-relation 1625. Up to 130 conditions per place. [2024-10-11 17:13:31,111 INFO L140 encePairwiseOnDemand]: 444/459 looper letters, 47 selfloop transitions, 18 changer transitions 0/440 dead transitions. [2024-10-11 17:13:31,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 440 transitions, 1293 flow [2024-10-11 17:13:31,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:13:31,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 17:13:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4552 transitions. [2024-10-11 17:13:31,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9015646662705487 [2024-10-11 17:13:31,120 INFO L175 Difference]: Start difference. First operand has 435 places, 423 transitions, 1093 flow. Second operand 11 states and 4552 transitions. [2024-10-11 17:13:31,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 440 transitions, 1293 flow [2024-10-11 17:13:31,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 440 transitions, 1289 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:31,128 INFO L231 Difference]: Finished difference. Result has 447 places, 429 transitions, 1184 flow [2024-10-11 17:13:31,129 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1184, PETRI_PLACES=447, PETRI_TRANSITIONS=429} [2024-10-11 17:13:31,129 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, 27 predicate places. [2024-10-11 17:13:31,130 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 429 transitions, 1184 flow [2024-10-11 17:13:31,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.375) internal successors, (3299), 8 states have internal predecessors, (3299), 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-11 17:13:31,131 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:31,131 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:31,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:13:31,131 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:31,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash 2030204769, now seen corresponding path program 1 times [2024-10-11 17:13:31,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:31,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769071389] [2024-10-11 17:13:31,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:31,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:31,178 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-11 17:13:31,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:31,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769071389] [2024-10-11 17:13:31,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769071389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:31,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:31,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:31,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44107198] [2024-10-11 17:13:31,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:31,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:31,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:31,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:31,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:31,195 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 459 [2024-10-11 17:13:31,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 429 transitions, 1184 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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-11 17:13:31,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:31,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 459 [2024-10-11 17:13:31,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:31,357 INFO L124 PetriNetUnfolderBase]: 43/1283 cut-off events. [2024-10-11 17:13:31,357 INFO L125 PetriNetUnfolderBase]: For 191/202 co-relation queries the response was YES. [2024-10-11 17:13:31,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1727 conditions, 1283 events. 43/1283 cut-off events. For 191/202 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5502 event pairs, 5 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 1659. Up to 36 conditions per place. [2024-10-11 17:13:31,365 INFO L140 encePairwiseOnDemand]: 455/459 looper letters, 11 selfloop transitions, 1 changer transitions 0/426 dead transitions. [2024-10-11 17:13:31,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 426 transitions, 1202 flow [2024-10-11 17:13:31,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2024-10-11 17:13:31,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9433551198257081 [2024-10-11 17:13:31,369 INFO L175 Difference]: Start difference. First operand has 447 places, 429 transitions, 1184 flow. Second operand 3 states and 1299 transitions. [2024-10-11 17:13:31,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 426 transitions, 1202 flow [2024-10-11 17:13:31,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 426 transitions, 1181 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-11 17:13:31,375 INFO L231 Difference]: Finished difference. Result has 439 places, 426 transitions, 1159 flow [2024-10-11 17:13:31,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1159, PETRI_PLACES=439, PETRI_TRANSITIONS=426} [2024-10-11 17:13:31,376 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, 19 predicate places. [2024-10-11 17:13:31,376 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 426 transitions, 1159 flow [2024-10-11 17:13:31,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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-11 17:13:31,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:31,381 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:31,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:13:31,381 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:31,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:31,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1746833926, now seen corresponding path program 1 times [2024-10-11 17:13:31,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:31,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045733226] [2024-10-11 17:13:31,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:31,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:31,416 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-11 17:13:31,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:31,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045733226] [2024-10-11 17:13:31,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045733226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:31,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:31,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:31,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932772005] [2024-10-11 17:13:31,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:31,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:31,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:31,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:31,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:31,441 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 459 [2024-10-11 17:13:31,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 426 transitions, 1159 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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-11 17:13:31,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:31,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 459 [2024-10-11 17:13:31,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:31,552 INFO L124 PetriNetUnfolderBase]: 46/1243 cut-off events. [2024-10-11 17:13:31,552 INFO L125 PetriNetUnfolderBase]: For 166/171 co-relation queries the response was YES. [2024-10-11 17:13:31,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 1243 events. 46/1243 cut-off events. For 166/171 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5759 event pairs, 6 based on Foata normal form. 5/1187 useless extension candidates. Maximal degree in co-relation 1581. Up to 38 conditions per place. [2024-10-11 17:13:31,557 INFO L140 encePairwiseOnDemand]: 453/459 looper letters, 5 selfloop transitions, 0 changer transitions 66/425 dead transitions. [2024-10-11 17:13:31,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 425 transitions, 1183 flow [2024-10-11 17:13:31,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:31,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:31,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2024-10-11 17:13:31,559 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.944081336238199 [2024-10-11 17:13:31,559 INFO L175 Difference]: Start difference. First operand has 439 places, 426 transitions, 1159 flow. Second operand 3 states and 1300 transitions. [2024-10-11 17:13:31,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 425 transitions, 1183 flow [2024-10-11 17:13:31,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 425 transitions, 1182 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:31,565 INFO L231 Difference]: Finished difference. Result has 437 places, 359 transitions, 856 flow [2024-10-11 17:13:31,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=437, PETRI_TRANSITIONS=359} [2024-10-11 17:13:31,565 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, 17 predicate places. [2024-10-11 17:13:31,565 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 359 transitions, 856 flow [2024-10-11 17:13:31,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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-11 17:13:31,566 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:31,566 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:31,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:13:31,566 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:31,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash -628618380, now seen corresponding path program 1 times [2024-10-11 17:13:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:31,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144109142] [2024-10-11 17:13:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:31,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:31,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144109142] [2024-10-11 17:13:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144109142] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:31,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:31,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:31,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968451210] [2024-10-11 17:13:31,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:31,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:31,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:31,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:32,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 459 [2024-10-11 17:13:32,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 359 transitions, 856 flow. Second operand has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 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-11 17:13:32,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:32,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 459 [2024-10-11 17:13:32,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:32,362 INFO L124 PetriNetUnfolderBase]: 29/648 cut-off events. [2024-10-11 17:13:32,363 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2024-10-11 17:13:32,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 648 events. 29/648 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1923 event pairs, 2 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 872. Up to 29 conditions per place. [2024-10-11 17:13:32,366 INFO L140 encePairwiseOnDemand]: 452/459 looper letters, 25 selfloop transitions, 5 changer transitions 0/362 dead transitions. [2024-10-11 17:13:32,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 362 transitions, 927 flow [2024-10-11 17:13:32,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2024-10-11 17:13:32,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.915758896151053 [2024-10-11 17:13:32,369 INFO L175 Difference]: Start difference. First operand has 437 places, 359 transitions, 856 flow. Second operand 6 states and 2522 transitions. [2024-10-11 17:13:32,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 362 transitions, 927 flow [2024-10-11 17:13:32,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 362 transitions, 847 flow, removed 19 selfloop flow, removed 24 redundant places. [2024-10-11 17:13:32,374 INFO L231 Difference]: Finished difference. Result has 366 places, 357 transitions, 782 flow [2024-10-11 17:13:32,374 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=782, PETRI_PLACES=366, PETRI_TRANSITIONS=357} [2024-10-11 17:13:32,375 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -54 predicate places. [2024-10-11 17:13:32,375 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 357 transitions, 782 flow [2024-10-11 17:13:32,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 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-11 17:13:32,375 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:32,376 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:32,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:13:32,376 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:32,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:32,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1488160694, now seen corresponding path program 1 times [2024-10-11 17:13:32,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:32,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337137594] [2024-10-11 17:13:32,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:32,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:32,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:32,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:32,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337137594] [2024-10-11 17:13:32,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337137594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:32,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:32,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:32,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756552475] [2024-10-11 17:13:32,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:32,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:32,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:32,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:32,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:32,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 459 [2024-10-11 17:13:32,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 357 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-11 17:13:32,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:32,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 459 [2024-10-11 17:13:32,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:32,516 INFO L124 PetriNetUnfolderBase]: 68/1259 cut-off events. [2024-10-11 17:13:32,516 INFO L125 PetriNetUnfolderBase]: For 23/24 co-relation queries the response was YES. [2024-10-11 17:13:32,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1469 conditions, 1259 events. 68/1259 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6595 event pairs, 17 based on Foata normal form. 0/1159 useless extension candidates. Maximal degree in co-relation 1459. Up to 85 conditions per place. [2024-10-11 17:13:32,521 INFO L140 encePairwiseOnDemand]: 453/459 looper letters, 14 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-10-11 17:13:32,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 357 transitions, 816 flow [2024-10-11 17:13:32,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2024-10-11 17:13:32,523 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9426289034132171 [2024-10-11 17:13:32,523 INFO L175 Difference]: Start difference. First operand has 366 places, 357 transitions, 782 flow. Second operand 3 states and 1298 transitions. [2024-10-11 17:13:32,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 357 transitions, 816 flow [2024-10-11 17:13:32,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 357 transitions, 806 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:32,527 INFO L231 Difference]: Finished difference. Result has 360 places, 355 transitions, 778 flow [2024-10-11 17:13:32,527 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=360, PETRI_TRANSITIONS=355} [2024-10-11 17:13:32,528 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -60 predicate places. [2024-10-11 17:13:32,528 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 355 transitions, 778 flow [2024-10-11 17:13:32,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-11 17:13:32,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:32,528 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:32,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:13:32,528 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:32,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:32,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1669553918, now seen corresponding path program 1 times [2024-10-11 17:13:32,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:32,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716540164] [2024-10-11 17:13:32,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:32,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:32,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:32,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716540164] [2024-10-11 17:13:32,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716540164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:32,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:32,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375565719] [2024-10-11 17:13:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:32,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:32,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:32,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:32,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:33,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 459 [2024-10-11 17:13:33,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 355 transitions, 778 flow. Second operand has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 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-11 17:13:33,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:33,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 459 [2024-10-11 17:13:33,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:33,210 INFO L124 PetriNetUnfolderBase]: 57/799 cut-off events. [2024-10-11 17:13:33,210 INFO L125 PetriNetUnfolderBase]: For 40/42 co-relation queries the response was YES. [2024-10-11 17:13:33,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 799 events. 57/799 cut-off events. For 40/42 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3459 event pairs, 4 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 1005. Up to 52 conditions per place. [2024-10-11 17:13:33,213 INFO L140 encePairwiseOnDemand]: 452/459 looper letters, 24 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2024-10-11 17:13:33,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 357 transitions, 844 flow [2024-10-11 17:13:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:33,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2521 transitions. [2024-10-11 17:13:33,217 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9153957879448076 [2024-10-11 17:13:33,217 INFO L175 Difference]: Start difference. First operand has 360 places, 355 transitions, 778 flow. Second operand 6 states and 2521 transitions. [2024-10-11 17:13:33,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 357 transitions, 844 flow [2024-10-11 17:13:33,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 357 transitions, 844 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:33,220 INFO L231 Difference]: Finished difference. Result has 363 places, 353 transitions, 784 flow [2024-10-11 17:13:33,221 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=784, PETRI_PLACES=363, PETRI_TRANSITIONS=353} [2024-10-11 17:13:33,221 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -57 predicate places. [2024-10-11 17:13:33,221 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 353 transitions, 784 flow [2024-10-11 17:13:33,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 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-11 17:13:33,221 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:33,222 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:33,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:13:33,222 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:33,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1624725530, now seen corresponding path program 1 times [2024-10-11 17:13:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:33,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929609162] [2024-10-11 17:13:33,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:33,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:33,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:33,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929609162] [2024-10-11 17:13:33,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929609162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:33,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:33,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:33,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138549538] [2024-10-11 17:13:33,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:33,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:33,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:33,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:33,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:33,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 459 [2024-10-11 17:13:33,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 353 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 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-11 17:13:33,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:33,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 459 [2024-10-11 17:13:33,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:34,062 INFO L124 PetriNetUnfolderBase]: 33/766 cut-off events. [2024-10-11 17:13:34,063 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-11 17:13:34,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 766 events. 33/766 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2611 event pairs, 3 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 950. Up to 29 conditions per place. [2024-10-11 17:13:34,068 INFO L140 encePairwiseOnDemand]: 452/459 looper letters, 25 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2024-10-11 17:13:34,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 356 transitions, 855 flow [2024-10-11 17:13:34,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:34,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2024-10-11 17:13:34,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.915758896151053 [2024-10-11 17:13:34,072 INFO L175 Difference]: Start difference. First operand has 363 places, 353 transitions, 784 flow. Second operand 6 states and 2522 transitions. [2024-10-11 17:13:34,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 356 transitions, 855 flow [2024-10-11 17:13:34,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 356 transitions, 845 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:34,080 INFO L231 Difference]: Finished difference. Result has 361 places, 351 transitions, 780 flow [2024-10-11 17:13:34,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=780, PETRI_PLACES=361, PETRI_TRANSITIONS=351} [2024-10-11 17:13:34,082 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -59 predicate places. [2024-10-11 17:13:34,082 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 351 transitions, 780 flow [2024-10-11 17:13:34,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 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-11 17:13:34,083 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:34,083 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:34,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:13:34,084 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:34,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:34,084 INFO L85 PathProgramCache]: Analyzing trace with hash 968370472, now seen corresponding path program 1 times [2024-10-11 17:13:34,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:34,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287191850] [2024-10-11 17:13:34,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:34,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:34,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:34,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287191850] [2024-10-11 17:13:34,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287191850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:34,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:34,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:34,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519306890] [2024-10-11 17:13:34,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:34,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:34,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:34,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:34,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:34,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 459 [2024-10-11 17:13:34,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 351 transitions, 780 flow. Second operand has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 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-11 17:13:34,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:34,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 459 [2024-10-11 17:13:34,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:34,865 INFO L124 PetriNetUnfolderBase]: 60/895 cut-off events. [2024-10-11 17:13:34,865 INFO L125 PetriNetUnfolderBase]: For 43/46 co-relation queries the response was YES. [2024-10-11 17:13:34,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 895 events. 60/895 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3954 event pairs, 6 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1113. Up to 56 conditions per place. [2024-10-11 17:13:34,870 INFO L140 encePairwiseOnDemand]: 452/459 looper letters, 24 selfloop transitions, 5 changer transitions 0/353 dead transitions. [2024-10-11 17:13:34,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 353 transitions, 846 flow [2024-10-11 17:13:34,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2521 transitions. [2024-10-11 17:13:34,873 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9153957879448076 [2024-10-11 17:13:34,873 INFO L175 Difference]: Start difference. First operand has 361 places, 351 transitions, 780 flow. Second operand 6 states and 2521 transitions. [2024-10-11 17:13:34,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 353 transitions, 846 flow [2024-10-11 17:13:34,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 353 transitions, 836 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:34,877 INFO L231 Difference]: Finished difference. Result has 359 places, 349 transitions, 776 flow [2024-10-11 17:13:34,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=776, PETRI_PLACES=359, PETRI_TRANSITIONS=349} [2024-10-11 17:13:34,878 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -61 predicate places. [2024-10-11 17:13:34,878 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 349 transitions, 776 flow [2024-10-11 17:13:34,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 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-11 17:13:34,879 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:34,879 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:34,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:13:34,879 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:34,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:34,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1567427258, now seen corresponding path program 1 times [2024-10-11 17:13:34,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:34,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801974447] [2024-10-11 17:13:34,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:34,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:34,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:34,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:34,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801974447] [2024-10-11 17:13:34,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801974447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:34,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:34,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:34,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325748000] [2024-10-11 17:13:34,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:34,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:34,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:34,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:34,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:34,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 459 [2024-10-11 17:13:34,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 349 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 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-11 17:13:34,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:34,945 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 459 [2024-10-11 17:13:34,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:35,040 INFO L124 PetriNetUnfolderBase]: 29/866 cut-off events. [2024-10-11 17:13:35,041 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2024-10-11 17:13:35,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 866 events. 29/866 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2861 event pairs, 3 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1009. Up to 21 conditions per place. [2024-10-11 17:13:35,043 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 7 selfloop transitions, 2 changer transitions 0/349 dead transitions. [2024-10-11 17:13:35,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 349 transitions, 795 flow [2024-10-11 17:13:35,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:35,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2024-10-11 17:13:35,048 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.944081336238199 [2024-10-11 17:13:35,048 INFO L175 Difference]: Start difference. First operand has 359 places, 349 transitions, 776 flow. Second operand 3 states and 1300 transitions. [2024-10-11 17:13:35,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 349 transitions, 795 flow [2024-10-11 17:13:35,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 349 transitions, 785 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:35,051 INFO L231 Difference]: Finished difference. Result has 355 places, 348 transitions, 768 flow [2024-10-11 17:13:35,052 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=355, PETRI_TRANSITIONS=348} [2024-10-11 17:13:35,052 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -65 predicate places. [2024-10-11 17:13:35,053 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 348 transitions, 768 flow [2024-10-11 17:13:35,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 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-11 17:13:35,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:35,053 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:35,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:13:35,053 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2024-10-11 17:13:35,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1990888607, now seen corresponding path program 1 times [2024-10-11 17:13:35,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:35,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882180306] [2024-10-11 17:13:35,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:35,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:13:35,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:35,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882180306] [2024-10-11 17:13:35,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882180306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:35,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:35,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:35,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368836727] [2024-10-11 17:13:35,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:35,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:35,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:35,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:35,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:35,151 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 459 [2024-10-11 17:13:35,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 348 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 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-11 17:13:35,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:35,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 459 [2024-10-11 17:13:35,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:35,207 INFO L124 PetriNetUnfolderBase]: 35/736 cut-off events. [2024-10-11 17:13:35,208 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2024-10-11 17:13:35,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 736 events. 35/736 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2621 event pairs, 4 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 857. Up to 20 conditions per place. [2024-10-11 17:13:35,212 INFO L140 encePairwiseOnDemand]: 456/459 looper letters, 0 selfloop transitions, 0 changer transitions 348/348 dead transitions. [2024-10-11 17:13:35,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 348 transitions, 787 flow [2024-10-11 17:13:35,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2024-10-11 17:13:35,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.944081336238199 [2024-10-11 17:13:35,213 INFO L175 Difference]: Start difference. First operand has 355 places, 348 transitions, 768 flow. Second operand 3 states and 1300 transitions. [2024-10-11 17:13:35,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 348 transitions, 787 flow [2024-10-11 17:13:35,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 348 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:35,216 INFO L231 Difference]: Finished difference. Result has 354 places, 0 transitions, 0 flow [2024-10-11 17:13:35,217 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=459, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=354, PETRI_TRANSITIONS=0} [2024-10-11 17:13:35,217 INFO L277 CegarLoopForPetriNet]: 420 programPoint places, -66 predicate places. [2024-10-11 17:13:35,217 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 0 transitions, 0 flow [2024-10-11 17:13:35,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 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-11 17:13:35,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (71 of 72 remaining) [2024-10-11 17:13:35,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 72 remaining) [2024-10-11 17:13:35,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (69 of 72 remaining) [2024-10-11 17:13:35,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (68 of 72 remaining) [2024-10-11 17:13:35,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (67 of 72 remaining) [2024-10-11 17:13:35,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (66 of 72 remaining) [2024-10-11 17:13:35,220 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (65 of 72 remaining) [2024-10-11 17:13:35,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (64 of 72 remaining) [2024-10-11 17:13:35,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (63 of 72 remaining) [2024-10-11 17:13:35,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (62 of 72 remaining) [2024-10-11 17:13:35,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (61 of 72 remaining) [2024-10-11 17:13:35,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (60 of 72 remaining) [2024-10-11 17:13:35,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (59 of 72 remaining) [2024-10-11 17:13:35,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (58 of 72 remaining) [2024-10-11 17:13:35,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (57 of 72 remaining) [2024-10-11 17:13:35,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (56 of 72 remaining) [2024-10-11 17:13:35,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (55 of 72 remaining) [2024-10-11 17:13:35,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (54 of 72 remaining) [2024-10-11 17:13:35,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (53 of 72 remaining) [2024-10-11 17:13:35,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (52 of 72 remaining) [2024-10-11 17:13:35,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (51 of 72 remaining) [2024-10-11 17:13:35,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (50 of 72 remaining) [2024-10-11 17:13:35,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (49 of 72 remaining) [2024-10-11 17:13:35,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (48 of 72 remaining) [2024-10-11 17:13:35,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (47 of 72 remaining) [2024-10-11 17:13:35,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (46 of 72 remaining) [2024-10-11 17:13:35,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (45 of 72 remaining) [2024-10-11 17:13:35,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (44 of 72 remaining) [2024-10-11 17:13:35,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 72 remaining) [2024-10-11 17:13:35,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 72 remaining) [2024-10-11 17:13:35,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 72 remaining) [2024-10-11 17:13:35,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 72 remaining) [2024-10-11 17:13:35,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (39 of 72 remaining) [2024-10-11 17:13:35,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 72 remaining) [2024-10-11 17:13:35,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (37 of 72 remaining) [2024-10-11 17:13:35,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (36 of 72 remaining) [2024-10-11 17:13:35,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 72 remaining) [2024-10-11 17:13:35,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 72 remaining) [2024-10-11 17:13:35,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 72 remaining) [2024-10-11 17:13:35,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 72 remaining) [2024-10-11 17:13:35,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 72 remaining) [2024-10-11 17:13:35,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (30 of 72 remaining) [2024-10-11 17:13:35,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 72 remaining) [2024-10-11 17:13:35,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 72 remaining) [2024-10-11 17:13:35,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 72 remaining) [2024-10-11 17:13:35,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 72 remaining) [2024-10-11 17:13:35,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (25 of 72 remaining) [2024-10-11 17:13:35,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (24 of 72 remaining) [2024-10-11 17:13:35,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (23 of 72 remaining) [2024-10-11 17:13:35,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (22 of 72 remaining) [2024-10-11 17:13:35,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 72 remaining) [2024-10-11 17:13:35,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (20 of 72 remaining) [2024-10-11 17:13:35,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (19 of 72 remaining) [2024-10-11 17:13:35,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (18 of 72 remaining) [2024-10-11 17:13:35,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (17 of 72 remaining) [2024-10-11 17:13:35,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (16 of 72 remaining) [2024-10-11 17:13:35,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (15 of 72 remaining) [2024-10-11 17:13:35,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (14 of 72 remaining) [2024-10-11 17:13:35,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (13 of 72 remaining) [2024-10-11 17:13:35,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (12 of 72 remaining) [2024-10-11 17:13:35,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 72 remaining) [2024-10-11 17:13:35,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (10 of 72 remaining) [2024-10-11 17:13:35,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 72 remaining) [2024-10-11 17:13:35,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (8 of 72 remaining) [2024-10-11 17:13:35,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (7 of 72 remaining) [2024-10-11 17:13:35,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (6 of 72 remaining) [2024-10-11 17:13:35,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (5 of 72 remaining) [2024-10-11 17:13:35,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (4 of 72 remaining) [2024-10-11 17:13:35,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (3 of 72 remaining) [2024-10-11 17:13:35,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (2 of 72 remaining) [2024-10-11 17:13:35,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (1 of 72 remaining) [2024-10-11 17:13:35,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (0 of 72 remaining) [2024-10-11 17:13:35,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:13:35,227 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:35,231 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:13:35,232 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:13:35,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:13:35 BasicIcfg [2024-10-11 17:13:35,236 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:13:35,236 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:13:35,236 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:13:35,236 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:13:35,237 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:24" (3/4) ... [2024-10-11 17:13:35,238 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:13:35,240 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:13:35,240 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:13:35,244 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-10-11 17:13:35,244 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:13:35,245 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:13:35,245 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:13:35,318 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:13:35,318 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:13:35,318 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:13:35,319 INFO L158 Benchmark]: Toolchain (without parser) took 12652.28ms. Allocated memory was 197.1MB in the beginning and 568.3MB in the end (delta: 371.2MB). Free memory was 128.9MB in the beginning and 414.7MB in the end (delta: -285.8MB). Peak memory consumption was 87.8MB. Max. memory is 16.1GB. [2024-10-11 17:13:35,319 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 121.6MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:13:35,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.61ms. Allocated memory is still 197.1MB. Free memory was 128.7MB in the beginning and 114.2MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:13:35,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.32ms. Allocated memory is still 197.1MB. Free memory was 114.2MB in the beginning and 110.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:13:35,320 INFO L158 Benchmark]: Boogie Preprocessor took 92.06ms. Allocated memory is still 197.1MB. Free memory was 110.6MB in the beginning and 107.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:13:35,320 INFO L158 Benchmark]: RCFGBuilder took 676.53ms. Allocated memory is still 197.1MB. Free memory was 107.6MB in the beginning and 133.6MB in the end (delta: -25.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 17:13:35,320 INFO L158 Benchmark]: TraceAbstraction took 11140.04ms. Allocated memory was 197.1MB in the beginning and 568.3MB in the end (delta: 371.2MB). Free memory was 133.6MB in the beginning and 421.0MB in the end (delta: -287.4MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. [2024-10-11 17:13:35,320 INFO L158 Benchmark]: Witness Printer took 82.26ms. Allocated memory is still 568.3MB. Free memory was 421.0MB in the beginning and 414.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:13:35,321 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.13ms. Allocated memory is still 121.6MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 552.61ms. Allocated memory is still 197.1MB. Free memory was 128.7MB in the beginning and 114.2MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.32ms. Allocated memory is still 197.1MB. Free memory was 114.2MB in the beginning and 110.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.06ms. Allocated memory is still 197.1MB. Free memory was 110.6MB in the beginning and 107.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 676.53ms. Allocated memory is still 197.1MB. Free memory was 107.6MB in the beginning and 133.6MB in the end (delta: -25.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11140.04ms. Allocated memory was 197.1MB in the beginning and 568.3MB in the end (delta: 371.2MB). Free memory was 133.6MB in the beginning and 421.0MB in the end (delta: -287.4MB). Peak memory consumption was 86.3MB. Max. memory is 16.1GB. * Witness Printer took 82.26ms. Allocated memory is still 568.3MB. Free memory was 421.0MB in the beginning and 414.7MB 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: 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: 80]: 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: 80]: 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: 103]: 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: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: 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 5 procedures, 656 locations, 72 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.0s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3591 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2299 mSDsluCounter, 3542 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3121 mSDsCounter, 610 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5770 IncrementalHoareTripleChecker+Invalid, 6380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 610 mSolverCounterUnsat, 421 mSDtfsCounter, 5770 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1184occurred in iteration=16, InterpolantAutomatonStates: 123, 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, 2.8s InterpolantComputationTime, 3156 NumberOfCodeBlocks, 3156 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3131 ConstructedInterpolants, 0 QuantifiedInterpolants, 4560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 16/16 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 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:13:35,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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