./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-exp-term-subst.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-exp-term-subst.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 2a508120cc7913f10b79dda7ca65a8b88f829725798d520aee5d1c1d04a1fc13 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:13:54,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:13:54,778 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:54,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:13:54,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:13:54,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:13:54,803 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:13:54,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:13:54,804 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:13:54,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:13:54,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:13:54,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:13:54,806 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:13:54,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:13:54,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:13:54,807 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:13:54,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:13:54,807 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:13:54,807 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:13:54,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:13:54,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:13:54,809 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:13:54,809 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:13:54,809 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:13:54,810 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:13:54,810 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:13:54,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:13:54,811 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:13:54,811 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:13:54,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:13:54,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:13:54,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:54,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:13:54,815 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:13:54,815 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:13:54,815 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:13:54,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:13:54,816 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:13:54,816 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:13:54,816 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:13:54,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:13:54,817 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 -> 2a508120cc7913f10b79dda7ca65a8b88f829725798d520aee5d1c1d04a1fc13 [2024-10-11 17:13:55,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:13:55,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:13:55,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:13:55,101 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:13:55,101 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:13:55,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2024-10-11 17:13:56,681 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:13:56,871 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:13:56,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-exp-term-subst.wvr.c [2024-10-11 17:13:56,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7c40b0d0e/573acd4b67cb464dba26559049c63947/FLAG8797aa2be [2024-10-11 17:13:57,257 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7c40b0d0e/573acd4b67cb464dba26559049c63947 [2024-10-11 17:13:57,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:13:57,261 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:13:57,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:57,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:13:57,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:13:57,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:57" (1/1) ... [2024-10-11 17:13:57,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@222ac602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:57, skipping insertion in model container [2024-10-11 17:13:57,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:57" (1/1) ... [2024-10-11 17:13:57,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:13:57,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:57,562 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:13:57,600 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:57,623 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:13:57,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:57 WrapperNode [2024-10-11 17:13:57,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:57,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:57,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:13:57,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:13:57,632 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:57" (1/1) ... [2024-10-11 17:13:57,646 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:57" (1/1) ... [2024-10-11 17:13:57,694 INFO L138 Inliner]: procedures = 22, calls = 17, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 317 [2024-10-11 17:13:57,695 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:57,696 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:13:57,696 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:13:57,696 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:13:57,705 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:57" (1/1) ... [2024-10-11 17:13:57,705 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:57" (1/1) ... [2024-10-11 17:13:57,708 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:57" (1/1) ... [2024-10-11 17:13:57,708 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:57" (1/1) ... [2024-10-11 17:13:57,720 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:57" (1/1) ... [2024-10-11 17:13:57,725 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:57" (1/1) ... [2024-10-11 17:13:57,727 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:57" (1/1) ... [2024-10-11 17:13:57,746 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:57" (1/1) ... [2024-10-11 17:13:57,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:13:57,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:13:57,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:13:57,767 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:13:57,768 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:57" (1/1) ... [2024-10-11 17:13:57,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:57,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:13:57,843 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:57,851 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:57,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:13:57,900 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:13:57,900 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:13:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:13:57,901 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:13:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:13:57,901 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:13:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:13:57,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:13:57,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:13:57,903 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:58,052 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:13:58,057 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:13:58,563 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:13:58,563 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:13:58,600 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:13:58,601 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 17:13:58,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:58 BoogieIcfgContainer [2024-10-11 17:13:58,601 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:13:58,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:13:58,604 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:13:58,607 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:13:58,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:13:57" (1/3) ... [2024-10-11 17:13:58,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63602581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:58, skipping insertion in model container [2024-10-11 17:13:58,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:57" (2/3) ... [2024-10-11 17:13:58,609 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63602581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:58, skipping insertion in model container [2024-10-11 17:13:58,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:58" (3/3) ... [2024-10-11 17:13:58,610 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-exp-term-subst.wvr.c [2024-10-11 17:13:58,627 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:13:58,628 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-11 17:13:58,629 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:13:58,765 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:13:58,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 413 places, 430 transitions, 881 flow [2024-10-11 17:13:58,971 INFO L124 PetriNetUnfolderBase]: 27/427 cut-off events. [2024-10-11 17:13:58,971 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:13:58,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 427 events. 27/427 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1395 event pairs, 0 based on Foata normal form. 0/356 useless extension candidates. Maximal degree in co-relation 306. Up to 2 conditions per place. [2024-10-11 17:13:58,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 413 places, 430 transitions, 881 flow [2024-10-11 17:13:59,004 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 392 places, 407 transitions, 832 flow [2024-10-11 17:13:59,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:13:59,031 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;@75934992, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:13:59,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2024-10-11 17:13:59,036 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:13:59,037 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-10-11 17:13:59,037 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:13:59,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:59,038 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:59,039 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:13:59,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1102699124, now seen corresponding path program 1 times [2024-10-11 17:13:59,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:59,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294632306] [2024-10-11 17:13:59,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:59,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:59,264 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:59,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:59,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294632306] [2024-10-11 17:13:59,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294632306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:59,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:59,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:59,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247770230] [2024-10-11 17:13:59,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:59,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:59,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:59,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:59,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:59,347 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2024-10-11 17:13:59,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 407 transitions, 832 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 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:59,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:59,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2024-10-11 17:13:59,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:59,663 INFO L124 PetriNetUnfolderBase]: 98/1397 cut-off events. [2024-10-11 17:13:59,664 INFO L125 PetriNetUnfolderBase]: For 28/32 co-relation queries the response was YES. [2024-10-11 17:13:59,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 1397 events. 98/1397 cut-off events. For 28/32 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 9754 event pairs, 20 based on Foata normal form. 39/1169 useless extension candidates. Maximal degree in co-relation 1352. Up to 50 conditions per place. [2024-10-11 17:13:59,685 INFO L140 encePairwiseOnDemand]: 420/430 looper letters, 13 selfloop transitions, 2 changer transitions 1/399 dead transitions. [2024-10-11 17:13:59,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 399 transitions, 846 flow [2024-10-11 17:13:59,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1235 transitions. [2024-10-11 17:13:59,709 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9573643410852714 [2024-10-11 17:13:59,711 INFO L175 Difference]: Start difference. First operand has 392 places, 407 transitions, 832 flow. Second operand 3 states and 1235 transitions. [2024-10-11 17:13:59,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 399 transitions, 846 flow [2024-10-11 17:13:59,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 399 transitions, 834 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:13:59,729 INFO L231 Difference]: Finished difference. Result has 387 places, 398 transitions, 806 flow [2024-10-11 17:13:59,732 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=385, 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=806, PETRI_PLACES=387, PETRI_TRANSITIONS=398} [2024-10-11 17:13:59,737 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -5 predicate places. [2024-10-11 17:13:59,738 INFO L471 AbstractCegarLoop]: Abstraction has has 387 places, 398 transitions, 806 flow [2024-10-11 17:13:59,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 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:59,739 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:59,739 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:59,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:13:59,741 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:13:59,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:59,742 INFO L85 PathProgramCache]: Analyzing trace with hash 669304532, now seen corresponding path program 1 times [2024-10-11 17:13:59,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:59,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553663354] [2024-10-11 17:13:59,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:59,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:59,836 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:59,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:59,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553663354] [2024-10-11 17:13:59,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553663354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:59,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:59,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:59,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576559276] [2024-10-11 17:13:59,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:59,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:59,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:59,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:59,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:59,875 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2024-10-11 17:13:59,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 398 transitions, 806 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 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:59,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:59,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2024-10-11 17:13:59,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:00,085 INFO L124 PetriNetUnfolderBase]: 54/807 cut-off events. [2024-10-11 17:14:00,086 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-11 17:14:00,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 807 events. 54/807 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4622 event pairs, 12 based on Foata normal form. 0/662 useless extension candidates. Maximal degree in co-relation 824. Up to 38 conditions per place. [2024-10-11 17:14:00,101 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 13 selfloop transitions, 2 changer transitions 0/397 dead transitions. [2024-10-11 17:14:00,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 397 transitions, 834 flow [2024-10-11 17:14:00,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:00,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1228 transitions. [2024-10-11 17:14:00,107 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.951937984496124 [2024-10-11 17:14:00,107 INFO L175 Difference]: Start difference. First operand has 387 places, 398 transitions, 806 flow. Second operand 3 states and 1228 transitions. [2024-10-11 17:14:00,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 397 transitions, 834 flow [2024-10-11 17:14:00,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 397 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:00,117 INFO L231 Difference]: Finished difference. Result has 385 places, 397 transitions, 804 flow [2024-10-11 17:14:00,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=395, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=804, PETRI_PLACES=385, PETRI_TRANSITIONS=397} [2024-10-11 17:14:00,119 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -7 predicate places. [2024-10-11 17:14:00,119 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 397 transitions, 804 flow [2024-10-11 17:14:00,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 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:14:00,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:00,121 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:00,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:14:00,122 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:00,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:00,123 INFO L85 PathProgramCache]: Analyzing trace with hash -337939069, now seen corresponding path program 1 times [2024-10-11 17:14:00,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:00,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254896851] [2024-10-11 17:14:00,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:00,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:00,208 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:14:00,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:00,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254896851] [2024-10-11 17:14:00,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254896851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:00,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:00,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:00,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686997631] [2024-10-11 17:14:00,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:00,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:00,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:00,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:00,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:00,248 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 404 out of 430 [2024-10-11 17:14:00,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 397 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 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:14:00,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:00,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 404 of 430 [2024-10-11 17:14:00,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:00,394 INFO L124 PetriNetUnfolderBase]: 50/620 cut-off events. [2024-10-11 17:14:00,394 INFO L125 PetriNetUnfolderBase]: For 9/12 co-relation queries the response was YES. [2024-10-11 17:14:00,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 620 events. 50/620 cut-off events. For 9/12 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3102 event pairs, 20 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 639. Up to 50 conditions per place. [2024-10-11 17:14:00,412 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 13 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2024-10-11 17:14:00,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 396 transitions, 832 flow [2024-10-11 17:14:00,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:00,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1228 transitions. [2024-10-11 17:14:00,416 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.951937984496124 [2024-10-11 17:14:00,416 INFO L175 Difference]: Start difference. First operand has 385 places, 397 transitions, 804 flow. Second operand 3 states and 1228 transitions. [2024-10-11 17:14:00,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 396 transitions, 832 flow [2024-10-11 17:14:00,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 396 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:00,423 INFO L231 Difference]: Finished difference. Result has 384 places, 396 transitions, 802 flow [2024-10-11 17:14:00,423 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=802, PETRI_PLACES=384, PETRI_TRANSITIONS=396} [2024-10-11 17:14:00,425 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -8 predicate places. [2024-10-11 17:14:00,425 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 396 transitions, 802 flow [2024-10-11 17:14:00,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 405.3333333333333) internal successors, (1216), 3 states have internal predecessors, (1216), 0 states have call successors, (0), 0 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:14:00,426 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:00,427 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:00,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:14:00,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:00,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:00,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1034750040, now seen corresponding path program 1 times [2024-10-11 17:14:00,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:00,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316470644] [2024-10-11 17:14:00,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:00,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:00,504 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:14:00,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:00,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316470644] [2024-10-11 17:14:00,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316470644] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:00,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:00,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:00,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094865322] [2024-10-11 17:14:00,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:00,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:00,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:00,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:00,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:00,547 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-10-11 17:14:00,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 396 transitions, 802 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:14:00,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:00,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-10-11 17:14:00,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:00,762 INFO L124 PetriNetUnfolderBase]: 117/1364 cut-off events. [2024-10-11 17:14:00,763 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-11 17:14:00,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1364 events. 117/1364 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 9907 event pairs, 39 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1426. Up to 85 conditions per place. [2024-10-11 17:14:00,796 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/395 dead transitions. [2024-10-11 17:14:00,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 395 transitions, 834 flow [2024-10-11 17:14:00,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:00,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2024-10-11 17:14:00,803 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2024-10-11 17:14:00,803 INFO L175 Difference]: Start difference. First operand has 384 places, 396 transitions, 802 flow. Second operand 3 states and 1224 transitions. [2024-10-11 17:14:00,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 395 transitions, 834 flow [2024-10-11 17:14:00,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 395 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:00,809 INFO L231 Difference]: Finished difference. Result has 383 places, 395 transitions, 800 flow [2024-10-11 17:14:00,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=800, PETRI_PLACES=383, PETRI_TRANSITIONS=395} [2024-10-11 17:14:00,811 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -9 predicate places. [2024-10-11 17:14:00,812 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 395 transitions, 800 flow [2024-10-11 17:14:00,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:14:00,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:00,813 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] [2024-10-11 17:14:00,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:14:00,814 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:00,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:00,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1308583354, now seen corresponding path program 1 times [2024-10-11 17:14:00,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:00,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372477658] [2024-10-11 17:14:00,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:00,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:00,888 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:14:00,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:00,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372477658] [2024-10-11 17:14:00,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372477658] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:00,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:00,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:00,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842126958] [2024-10-11 17:14:00,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:00,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:00,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:00,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:00,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:00,937 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-10-11 17:14:00,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 395 transitions, 800 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:14:00,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:00,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-10-11 17:14:00,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:01,097 INFO L124 PetriNetUnfolderBase]: 69/871 cut-off events. [2024-10-11 17:14:01,097 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:14:01,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 871 events. 69/871 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5269 event pairs, 21 based on Foata normal form. 0/715 useless extension candidates. Maximal degree in co-relation 886. Up to 58 conditions per place. [2024-10-11 17:14:01,117 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/394 dead transitions. [2024-10-11 17:14:01,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 394 transitions, 832 flow [2024-10-11 17:14:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:01,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2024-10-11 17:14:01,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2024-10-11 17:14:01,121 INFO L175 Difference]: Start difference. First operand has 383 places, 395 transitions, 800 flow. Second operand 3 states and 1224 transitions. [2024-10-11 17:14:01,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 394 transitions, 832 flow [2024-10-11 17:14:01,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 394 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:01,132 INFO L231 Difference]: Finished difference. Result has 382 places, 394 transitions, 798 flow [2024-10-11 17:14:01,132 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=794, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=382, PETRI_TRANSITIONS=394} [2024-10-11 17:14:01,133 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -10 predicate places. [2024-10-11 17:14:01,133 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 394 transitions, 798 flow [2024-10-11 17:14:01,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:14:01,136 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:01,136 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] [2024-10-11 17:14:01,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:14:01,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:01,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:01,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1633748031, now seen corresponding path program 1 times [2024-10-11 17:14:01,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:01,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515119446] [2024-10-11 17:14:01,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:01,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:01,194 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:14:01,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:01,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515119446] [2024-10-11 17:14:01,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515119446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:01,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:01,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:01,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873788432] [2024-10-11 17:14:01,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:01,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:01,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:01,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:01,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:01,235 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-10-11 17:14:01,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 394 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:14:01,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:01,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-10-11 17:14:01,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:01,441 INFO L124 PetriNetUnfolderBase]: 117/1332 cut-off events. [2024-10-11 17:14:01,441 INFO L125 PetriNetUnfolderBase]: For 21/26 co-relation queries the response was YES. [2024-10-11 17:14:01,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1332 events. 117/1332 cut-off events. For 21/26 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 8607 event pairs, 39 based on Foata normal form. 0/1080 useless extension candidates. Maximal degree in co-relation 1363. Up to 85 conditions per place. [2024-10-11 17:14:01,457 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 15 selfloop transitions, 2 changer transitions 0/393 dead transitions. [2024-10-11 17:14:01,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 393 transitions, 830 flow [2024-10-11 17:14:01,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:01,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1224 transitions. [2024-10-11 17:14:01,460 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488372093023256 [2024-10-11 17:14:01,460 INFO L175 Difference]: Start difference. First operand has 382 places, 394 transitions, 798 flow. Second operand 3 states and 1224 transitions. [2024-10-11 17:14:01,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 393 transitions, 830 flow [2024-10-11 17:14:01,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 393 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:01,468 INFO L231 Difference]: Finished difference. Result has 381 places, 393 transitions, 796 flow [2024-10-11 17:14:01,468 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=792, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=381, PETRI_TRANSITIONS=393} [2024-10-11 17:14:01,470 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -11 predicate places. [2024-10-11 17:14:01,471 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 393 transitions, 796 flow [2024-10-11 17:14:01,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:14:01,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:01,472 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] [2024-10-11 17:14:01,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:14:01,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:01,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:01,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1920223402, now seen corresponding path program 1 times [2024-10-11 17:14:01,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:01,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509131303] [2024-10-11 17:14:01,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:01,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:01,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:01,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:01,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509131303] [2024-10-11 17:14:01,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509131303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:01,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:01,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:01,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356827656] [2024-10-11 17:14:01,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:01,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:01,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:01,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:01,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:01,568 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2024-10-11 17:14:01,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 393 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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:14:01,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:01,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2024-10-11 17:14:01,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:01,962 INFO L124 PetriNetUnfolderBase]: 284/2636 cut-off events. [2024-10-11 17:14:01,963 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-10-11 17:14:01,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2953 conditions, 2636 events. 284/2636 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 24560 event pairs, 117 based on Foata normal form. 0/2193 useless extension candidates. Maximal degree in co-relation 2879. Up to 251 conditions per place. [2024-10-11 17:14:02,003 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/391 dead transitions. [2024-10-11 17:14:02,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 391 transitions, 840 flow [2024-10-11 17:14:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2024-10-11 17:14:02,007 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2024-10-11 17:14:02,007 INFO L175 Difference]: Start difference. First operand has 381 places, 393 transitions, 796 flow. Second operand 3 states and 1217 transitions. [2024-10-11 17:14:02,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 391 transitions, 840 flow [2024-10-11 17:14:02,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 391 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:02,014 INFO L231 Difference]: Finished difference. Result has 376 places, 389 transitions, 794 flow [2024-10-11 17:14:02,014 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=794, PETRI_PLACES=376, PETRI_TRANSITIONS=389} [2024-10-11 17:14:02,016 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -16 predicate places. [2024-10-11 17:14:02,016 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 389 transitions, 794 flow [2024-10-11 17:14:02,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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:14:02,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:02,017 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] [2024-10-11 17:14:02,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:14:02,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:02,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:02,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1501280024, now seen corresponding path program 1 times [2024-10-11 17:14:02,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:02,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57861874] [2024-10-11 17:14:02,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:02,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:02,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:02,076 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:14:02,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:02,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57861874] [2024-10-11 17:14:02,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57861874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:02,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:02,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:02,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381681781] [2024-10-11 17:14:02,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:02,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:02,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:02,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:02,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:02,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2024-10-11 17:14:02,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 389 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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:14:02,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:02,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2024-10-11 17:14:02,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:02,350 INFO L124 PetriNetUnfolderBase]: 151/1516 cut-off events. [2024-10-11 17:14:02,351 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-10-11 17:14:02,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 1516 events. 151/1516 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 11431 event pairs, 52 based on Foata normal form. 0/1274 useless extension candidates. Maximal degree in co-relation 1504. Up to 135 conditions per place. [2024-10-11 17:14:02,382 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/387 dead transitions. [2024-10-11 17:14:02,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 387 transitions, 838 flow [2024-10-11 17:14:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2024-10-11 17:14:02,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2024-10-11 17:14:02,385 INFO L175 Difference]: Start difference. First operand has 376 places, 389 transitions, 794 flow. Second operand 3 states and 1217 transitions. [2024-10-11 17:14:02,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 387 transitions, 838 flow [2024-10-11 17:14:02,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 387 transitions, 838 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:02,391 INFO L231 Difference]: Finished difference. Result has 373 places, 385 transitions, 796 flow [2024-10-11 17:14:02,392 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=796, PETRI_PLACES=373, PETRI_TRANSITIONS=385} [2024-10-11 17:14:02,395 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2024-10-11 17:14:02,395 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 385 transitions, 796 flow [2024-10-11 17:14:02,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.3333333333333) internal successors, (1192), 3 states have internal predecessors, (1192), 0 states have call successors, (0), 0 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:14:02,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:02,397 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:02,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:14:02,398 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:02,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:02,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1400118740, now seen corresponding path program 1 times [2024-10-11 17:14:02,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:02,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748304480] [2024-10-11 17:14:02,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:02,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:14:02,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:02,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748304480] [2024-10-11 17:14:02,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748304480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:02,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:02,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:02,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792561936] [2024-10-11 17:14:02,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:02,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:02,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:02,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:02,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:02,477 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 396 out of 430 [2024-10-11 17:14:02,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 385 transitions, 796 flow. Second operand has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 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:14:02,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:02,479 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 396 of 430 [2024-10-11 17:14:02,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:03,038 INFO L124 PetriNetUnfolderBase]: 505/4357 cut-off events. [2024-10-11 17:14:03,038 INFO L125 PetriNetUnfolderBase]: For 63/71 co-relation queries the response was YES. [2024-10-11 17:14:03,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4838 conditions, 4357 events. 505/4357 cut-off events. For 63/71 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 44552 event pairs, 126 based on Foata normal form. 0/3687 useless extension candidates. Maximal degree in co-relation 3641. Up to 445 conditions per place. [2024-10-11 17:14:03,083 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 21 selfloop transitions, 2 changer transitions 0/383 dead transitions. [2024-10-11 17:14:03,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 383 transitions, 840 flow [2024-10-11 17:14:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:03,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1217 transitions. [2024-10-11 17:14:03,087 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9434108527131783 [2024-10-11 17:14:03,087 INFO L175 Difference]: Start difference. First operand has 373 places, 385 transitions, 796 flow. Second operand 3 states and 1217 transitions. [2024-10-11 17:14:03,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 383 transitions, 840 flow [2024-10-11 17:14:03,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 383 transitions, 840 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:03,093 INFO L231 Difference]: Finished difference. Result has 370 places, 381 transitions, 798 flow [2024-10-11 17:14:03,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=784, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=798, PETRI_PLACES=370, PETRI_TRANSITIONS=381} [2024-10-11 17:14:03,095 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2024-10-11 17:14:03,096 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 381 transitions, 798 flow [2024-10-11 17:14:03,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 0 states have call successors, (0), 0 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:14:03,097 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:03,097 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] [2024-10-11 17:14:03,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:14:03,097 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:03,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:03,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1481210219, now seen corresponding path program 1 times [2024-10-11 17:14:03,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:03,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634117715] [2024-10-11 17:14:03,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:03,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:03,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:03,148 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:14:03,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:03,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634117715] [2024-10-11 17:14:03,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634117715] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:03,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:03,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:14:03,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609090579] [2024-10-11 17:14:03,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:03,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:03,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:03,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:03,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:03,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-10-11 17:14:03,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 381 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 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:14:03,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:03,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-10-11 17:14:03,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:03,339 INFO L124 PetriNetUnfolderBase]: 98/1285 cut-off events. [2024-10-11 17:14:03,339 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 17:14:03,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1285 events. 98/1285 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 9496 event pairs, 10 based on Foata normal form. 0/1105 useless extension candidates. Maximal degree in co-relation 1124. Up to 35 conditions per place. [2024-10-11 17:14:03,364 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/385 dead transitions. [2024-10-11 17:14:03,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 385 transitions, 842 flow [2024-10-11 17:14:03,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:03,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-10-11 17:14:03,367 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2024-10-11 17:14:03,367 INFO L175 Difference]: Start difference. First operand has 370 places, 381 transitions, 798 flow. Second operand 3 states and 1242 transitions. [2024-10-11 17:14:03,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 385 transitions, 842 flow [2024-10-11 17:14:03,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 385 transitions, 842 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:03,479 INFO L231 Difference]: Finished difference. Result has 374 places, 383 transitions, 820 flow [2024-10-11 17:14:03,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=820, PETRI_PLACES=374, PETRI_TRANSITIONS=383} [2024-10-11 17:14:03,480 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -18 predicate places. [2024-10-11 17:14:03,481 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 383 transitions, 820 flow [2024-10-11 17:14:03,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.3333333333333) internal successors, (1228), 3 states have internal predecessors, (1228), 0 states have call successors, (0), 0 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:14:03,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:03,482 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] [2024-10-11 17:14:03,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:14:03,482 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:03,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash 955479565, now seen corresponding path program 1 times [2024-10-11 17:14:03,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:03,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433652983] [2024-10-11 17:14:03,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:03,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:03,529 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:14:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:03,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433652983] [2024-10-11 17:14:03,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433652983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:03,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:03,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363567939] [2024-10-11 17:14:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:03,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:03,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:03,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:03,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:03,557 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-10-11 17:14:03,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 383 transitions, 820 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:14:03,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:03,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-10-11 17:14:03,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:03,971 INFO L124 PetriNetUnfolderBase]: 206/2208 cut-off events. [2024-10-11 17:14:03,971 INFO L125 PetriNetUnfolderBase]: For 28/34 co-relation queries the response was YES. [2024-10-11 17:14:04,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2500 conditions, 2208 events. 206/2208 cut-off events. For 28/34 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 19276 event pairs, 16 based on Foata normal form. 1/1935 useless extension candidates. Maximal degree in co-relation 2113. Up to 166 conditions per place. [2024-10-11 17:14:04,023 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 20 selfloop transitions, 4 changer transitions 0/388 dead transitions. [2024-10-11 17:14:04,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 388 transitions, 883 flow [2024-10-11 17:14:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:04,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1234 transitions. [2024-10-11 17:14:04,026 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9565891472868217 [2024-10-11 17:14:04,026 INFO L175 Difference]: Start difference. First operand has 374 places, 383 transitions, 820 flow. Second operand 3 states and 1234 transitions. [2024-10-11 17:14:04,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 388 transitions, 883 flow [2024-10-11 17:14:04,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 388 transitions, 877 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:04,076 INFO L231 Difference]: Finished difference. Result has 371 places, 383 transitions, 834 flow [2024-10-11 17:14:04,077 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=834, PETRI_PLACES=371, PETRI_TRANSITIONS=383} [2024-10-11 17:14:04,077 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2024-10-11 17:14:04,078 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 383 transitions, 834 flow [2024-10-11 17:14:04,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:14:04,079 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:04,079 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:04,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:14:04,079 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:04,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:04,080 INFO L85 PathProgramCache]: Analyzing trace with hash -907105805, now seen corresponding path program 1 times [2024-10-11 17:14:04,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:04,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311930651] [2024-10-11 17:14:04,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:04,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:04,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:04,116 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:14:04,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311930651] [2024-10-11 17:14:04,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311930651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:04,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:04,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:04,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300917242] [2024-10-11 17:14:04,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:04,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:04,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:04,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:04,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:04,139 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-10-11 17:14:04,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 383 transitions, 834 flow. Second operand has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:14:04,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:04,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-10-11 17:14:04,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:04,667 INFO L124 PetriNetUnfolderBase]: 262/2943 cut-off events. [2024-10-11 17:14:04,667 INFO L125 PetriNetUnfolderBase]: For 34/65 co-relation queries the response was YES. [2024-10-11 17:14:04,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 2943 events. 262/2943 cut-off events. For 34/65 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 26403 event pairs, 36 based on Foata normal form. 2/2571 useless extension candidates. Maximal degree in co-relation 2942. Up to 198 conditions per place. [2024-10-11 17:14:04,716 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 20 selfloop transitions, 4 changer transitions 0/388 dead transitions. [2024-10-11 17:14:04,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 388 transitions, 897 flow [2024-10-11 17:14:04,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:04,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1234 transitions. [2024-10-11 17:14:04,719 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9565891472868217 [2024-10-11 17:14:04,719 INFO L175 Difference]: Start difference. First operand has 371 places, 383 transitions, 834 flow. Second operand 3 states and 1234 transitions. [2024-10-11 17:14:04,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 388 transitions, 897 flow [2024-10-11 17:14:04,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 388 transitions, 897 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:04,726 INFO L231 Difference]: Finished difference. Result has 370 places, 383 transitions, 854 flow [2024-10-11 17:14:04,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=370, PETRI_TRANSITIONS=383} [2024-10-11 17:14:04,727 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2024-10-11 17:14:04,728 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 383 transitions, 854 flow [2024-10-11 17:14:04,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.3333333333333) internal successors, (1210), 3 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:14:04,729 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:04,729 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:04,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:14:04,729 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:04,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:04,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1268745015, now seen corresponding path program 1 times [2024-10-11 17:14:04,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:04,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146239861] [2024-10-11 17:14:04,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:04,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:04,760 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:14:04,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:04,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146239861] [2024-10-11 17:14:04,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146239861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:04,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:04,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:04,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315322243] [2024-10-11 17:14:04,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:04,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:04,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:04,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:04,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:04,772 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 430 [2024-10-11 17:14:04,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 383 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 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:14:04,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:04,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 430 [2024-10-11 17:14:04,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:05,231 INFO L124 PetriNetUnfolderBase]: 236/2977 cut-off events. [2024-10-11 17:14:05,232 INFO L125 PetriNetUnfolderBase]: For 6/35 co-relation queries the response was YES. [2024-10-11 17:14:05,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3305 conditions, 2977 events. 236/2977 cut-off events. For 6/35 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 27839 event pairs, 14 based on Foata normal form. 4/2617 useless extension candidates. Maximal degree in co-relation 2968. Up to 62 conditions per place. [2024-10-11 17:14:05,287 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 11 selfloop transitions, 2 changer transitions 0/384 dead transitions. [2024-10-11 17:14:05,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 384 transitions, 884 flow [2024-10-11 17:14:05,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1241 transitions. [2024-10-11 17:14:05,290 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.962015503875969 [2024-10-11 17:14:05,290 INFO L175 Difference]: Start difference. First operand has 370 places, 383 transitions, 854 flow. Second operand 3 states and 1241 transitions. [2024-10-11 17:14:05,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 384 transitions, 884 flow [2024-10-11 17:14:05,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 384 transitions, 884 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:05,297 INFO L231 Difference]: Finished difference. Result has 371 places, 382 transitions, 856 flow [2024-10-11 17:14:05,298 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=371, PETRI_TRANSITIONS=382} [2024-10-11 17:14:05,299 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2024-10-11 17:14:05,299 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 382 transitions, 856 flow [2024-10-11 17:14:05,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.3333333333333) internal successors, (1231), 3 states have internal predecessors, (1231), 0 states have call successors, (0), 0 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:14:05,300 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:05,300 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:05,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:14:05,301 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:05,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:05,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1959498791, now seen corresponding path program 1 times [2024-10-11 17:14:05,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:05,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523336768] [2024-10-11 17:14:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:05,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:05,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:05,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:05,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523336768] [2024-10-11 17:14:05,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523336768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:05,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:05,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:14:05,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004720778] [2024-10-11 17:14:05,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:05,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:05,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:05,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:05,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:05,345 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-10-11 17:14:05,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 382 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 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:14:05,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:05,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-10-11 17:14:05,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:05,946 INFO L124 PetriNetUnfolderBase]: 260/2958 cut-off events. [2024-10-11 17:14:05,947 INFO L125 PetriNetUnfolderBase]: For 27/76 co-relation queries the response was YES. [2024-10-11 17:14:05,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3377 conditions, 2958 events. 260/2958 cut-off events. For 27/76 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 27904 event pairs, 42 based on Foata normal form. 0/2586 useless extension candidates. Maximal degree in co-relation 2920. Up to 136 conditions per place. [2024-10-11 17:14:06,017 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/386 dead transitions. [2024-10-11 17:14:06,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 386 transitions, 900 flow [2024-10-11 17:14:06,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-10-11 17:14:06,021 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2024-10-11 17:14:06,021 INFO L175 Difference]: Start difference. First operand has 371 places, 382 transitions, 856 flow. Second operand 3 states and 1242 transitions. [2024-10-11 17:14:06,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 386 transitions, 900 flow [2024-10-11 17:14:06,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 386 transitions, 896 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:06,033 INFO L231 Difference]: Finished difference. Result has 373 places, 384 transitions, 874 flow [2024-10-11 17:14:06,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=852, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=382, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=874, PETRI_PLACES=373, PETRI_TRANSITIONS=384} [2024-10-11 17:14:06,035 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2024-10-11 17:14:06,035 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 384 transitions, 874 flow [2024-10-11 17:14:06,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 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:14:06,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:06,037 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:06,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:14:06,038 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:06,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash -804587533, now seen corresponding path program 1 times [2024-10-11 17:14:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:06,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447321434] [2024-10-11 17:14:06,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:06,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:06,089 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:14:06,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:06,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447321434] [2024-10-11 17:14:06,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447321434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:06,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:06,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:06,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226894604] [2024-10-11 17:14:06,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:06,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:06,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:06,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:06,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:06,109 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-10-11 17:14:06,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 384 transitions, 874 flow. Second operand has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 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:14:06,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:06,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-10-11 17:14:06,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:06,903 INFO L124 PetriNetUnfolderBase]: 390/4199 cut-off events. [2024-10-11 17:14:06,903 INFO L125 PetriNetUnfolderBase]: For 60/116 co-relation queries the response was YES. [2024-10-11 17:14:06,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4849 conditions, 4199 events. 390/4199 cut-off events. For 60/116 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 42591 event pairs, 32 based on Foata normal form. 2/3712 useless extension candidates. Maximal degree in co-relation 3856. Up to 132 conditions per place. [2024-10-11 17:14:06,956 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 12 selfloop transitions, 2 changer transitions 0/385 dead transitions. [2024-10-11 17:14:06,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 385 transitions, 906 flow [2024-10-11 17:14:06,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:06,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2024-10-11 17:14:06,960 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9604651162790697 [2024-10-11 17:14:06,960 INFO L175 Difference]: Start difference. First operand has 373 places, 384 transitions, 874 flow. Second operand 3 states and 1239 transitions. [2024-10-11 17:14:06,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 385 transitions, 906 flow [2024-10-11 17:14:06,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 385 transitions, 900 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:06,967 INFO L231 Difference]: Finished difference. Result has 372 places, 383 transitions, 870 flow [2024-10-11 17:14:06,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=866, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=870, PETRI_PLACES=372, PETRI_TRANSITIONS=383} [2024-10-11 17:14:06,969 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -20 predicate places. [2024-10-11 17:14:06,969 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 383 transitions, 870 flow [2024-10-11 17:14:06,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 409.6666666666667) internal successors, (1229), 3 states have internal predecessors, (1229), 0 states have call successors, (0), 0 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:14:06,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:06,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:06,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:14:06,970 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:06,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:06,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1314528943, now seen corresponding path program 1 times [2024-10-11 17:14:06,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:06,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725968622] [2024-10-11 17:14:06,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:06,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:07,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:07,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725968622] [2024-10-11 17:14:07,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725968622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:07,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:07,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:07,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098734152] [2024-10-11 17:14:07,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:07,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:07,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:07,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:07,037 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 402 out of 430 [2024-10-11 17:14:07,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 383 transitions, 870 flow. Second operand has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 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:14:07,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:07,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 402 of 430 [2024-10-11 17:14:07,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:07,717 INFO L124 PetriNetUnfolderBase]: 648/5839 cut-off events. [2024-10-11 17:14:07,717 INFO L125 PetriNetUnfolderBase]: For 74/82 co-relation queries the response was YES. [2024-10-11 17:14:07,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6872 conditions, 5839 events. 648/5839 cut-off events. For 74/82 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 64362 event pairs, 68 based on Foata normal form. 1/5262 useless extension candidates. Maximal degree in co-relation 5944. Up to 585 conditions per place. [2024-10-11 17:14:07,759 INFO L140 encePairwiseOnDemand]: 422/430 looper letters, 19 selfloop transitions, 4 changer transitions 0/387 dead transitions. [2024-10-11 17:14:07,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 387 transitions, 928 flow [2024-10-11 17:14:07,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:07,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1233 transitions. [2024-10-11 17:14:07,762 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9558139534883721 [2024-10-11 17:14:07,762 INFO L175 Difference]: Start difference. First operand has 372 places, 383 transitions, 870 flow. Second operand 3 states and 1233 transitions. [2024-10-11 17:14:07,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 387 transitions, 928 flow [2024-10-11 17:14:07,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 387 transitions, 924 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:07,769 INFO L231 Difference]: Finished difference. Result has 369 places, 383 transitions, 886 flow [2024-10-11 17:14:07,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=369, PETRI_TRANSITIONS=383} [2024-10-11 17:14:07,770 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -23 predicate places. [2024-10-11 17:14:07,770 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 383 transitions, 886 flow [2024-10-11 17:14:07,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 403.6666666666667) internal successors, (1211), 3 states have internal predecessors, (1211), 0 states have call successors, (0), 0 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:14:07,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:07,771 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] [2024-10-11 17:14:07,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:14:07,772 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:07,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1473838492, now seen corresponding path program 1 times [2024-10-11 17:14:07,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:07,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341018719] [2024-10-11 17:14:07,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:07,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:07,813 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:14:07,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:07,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341018719] [2024-10-11 17:14:07,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341018719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:07,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:07,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:14:07,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744942710] [2024-10-11 17:14:07,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:07,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:07,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:07,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:07,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:07,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-10-11 17:14:07,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 383 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:14:07,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:07,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-10-11 17:14:07,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:08,432 INFO L124 PetriNetUnfolderBase]: 413/3953 cut-off events. [2024-10-11 17:14:08,433 INFO L125 PetriNetUnfolderBase]: For 107/136 co-relation queries the response was YES. [2024-10-11 17:14:08,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4768 conditions, 3953 events. 413/3953 cut-off events. For 107/136 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 39234 event pairs, 64 based on Foata normal form. 2/3510 useless extension candidates. Maximal degree in co-relation 4191. Up to 287 conditions per place. [2024-10-11 17:14:08,521 INFO L140 encePairwiseOnDemand]: 426/430 looper letters, 14 selfloop transitions, 3 changer transitions 0/387 dead transitions. [2024-10-11 17:14:08,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 387 transitions, 930 flow [2024-10-11 17:14:08,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:08,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1242 transitions. [2024-10-11 17:14:08,524 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9627906976744186 [2024-10-11 17:14:08,524 INFO L175 Difference]: Start difference. First operand has 369 places, 383 transitions, 886 flow. Second operand 3 states and 1242 transitions. [2024-10-11 17:14:08,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 387 transitions, 930 flow [2024-10-11 17:14:08,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 387 transitions, 930 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:14:08,531 INFO L231 Difference]: Finished difference. Result has 373 places, 385 transitions, 908 flow [2024-10-11 17:14:08,532 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=373, PETRI_TRANSITIONS=385} [2024-10-11 17:14:08,533 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -19 predicate places. [2024-10-11 17:14:08,533 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 385 transitions, 908 flow [2024-10-11 17:14:08,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:14:08,535 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:08,535 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:08,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:14:08,535 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:08,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:08,536 INFO L85 PathProgramCache]: Analyzing trace with hash 853128936, now seen corresponding path program 1 times [2024-10-11 17:14:08,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:08,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609543057] [2024-10-11 17:14:08,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:08,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:08,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:14:08,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:08,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609543057] [2024-10-11 17:14:08,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609543057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:08,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:08,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:08,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863408934] [2024-10-11 17:14:08,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:08,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:08,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:08,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:08,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:08,598 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-10-11 17:14:08,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 385 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:14:08,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:08,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-10-11 17:14:08,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:09,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1183] L56-51-->L56-52: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet24#1][257], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), Black: 451#true, 457#(= |#race~sort_label_2~0| 0), 302#L56-52true, 479#true, Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), 474#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, Black: 442#true, Black: 476#(not |thread3Thread1of1ForFork2_#t~short19#1|), 453#(= |#race~sort_label_0~0| 0)]) [2024-10-11 17:14:09,040 INFO L294 olderBase$Statistics]: this new event has 176 ancestors and is cut-off event [2024-10-11 17:14:09,040 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-10-11 17:14:09,040 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2024-10-11 17:14:09,040 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-10-11 17:14:09,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1183] L56-51-->L56-52: Formula: true InVars {} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet24#1][257], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), Black: 451#true, 457#(= |#race~sort_label_2~0| 0), 302#L56-52true, 479#true, Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, Black: 442#true, Black: 474#true, 476#(not |thread3Thread1of1ForFork2_#t~short19#1|), 453#(= |#race~sort_label_0~0| 0)]) [2024-10-11 17:14:09,058 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is not cut-off event [2024-10-11 17:14:09,058 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2024-10-11 17:14:09,058 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is not cut-off event [2024-10-11 17:14:09,058 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is not cut-off event [2024-10-11 17:14:09,071 INFO L124 PetriNetUnfolderBase]: 392/3250 cut-off events. [2024-10-11 17:14:09,071 INFO L125 PetriNetUnfolderBase]: For 208/236 co-relation queries the response was YES. [2024-10-11 17:14:09,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4302 conditions, 3250 events. 392/3250 cut-off events. For 208/236 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 31507 event pairs, 48 based on Foata normal form. 2/2986 useless extension candidates. Maximal degree in co-relation 3700. Up to 248 conditions per place. [2024-10-11 17:14:09,135 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 12 selfloop transitions, 2 changer transitions 0/386 dead transitions. [2024-10-11 17:14:09,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 386 transitions, 940 flow [2024-10-11 17:14:09,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2024-10-11 17:14:09,138 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9604651162790697 [2024-10-11 17:14:09,139 INFO L175 Difference]: Start difference. First operand has 373 places, 385 transitions, 908 flow. Second operand 3 states and 1239 transitions. [2024-10-11 17:14:09,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 386 transitions, 940 flow [2024-10-11 17:14:09,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 386 transitions, 934 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:09,147 INFO L231 Difference]: Finished difference. Result has 372 places, 384 transitions, 904 flow [2024-10-11 17:14:09,148 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=372, PETRI_TRANSITIONS=384} [2024-10-11 17:14:09,148 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -20 predicate places. [2024-10-11 17:14:09,148 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 384 transitions, 904 flow [2024-10-11 17:14:09,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 410.0) internal successors, (1230), 3 states have internal predecessors, (1230), 0 states have call successors, (0), 0 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:14:09,149 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:09,149 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:09,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:14:09,150 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:09,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:09,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2052204957, now seen corresponding path program 1 times [2024-10-11 17:14:09,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:09,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772547439] [2024-10-11 17:14:09,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:09,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:09,210 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:14:09,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:09,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772547439] [2024-10-11 17:14:09,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772547439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:09,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:09,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:09,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934414016] [2024-10-11 17:14:09,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:09,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:09,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:09,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:09,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:09,221 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 430 [2024-10-11 17:14:09,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 384 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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:14:09,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:09,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 430 [2024-10-11 17:14:09,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:10,004 INFO L124 PetriNetUnfolderBase]: 388/4741 cut-off events. [2024-10-11 17:14:10,004 INFO L125 PetriNetUnfolderBase]: For 7/17 co-relation queries the response was YES. [2024-10-11 17:14:10,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5737 conditions, 4741 events. 388/4741 cut-off events. For 7/17 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 50231 event pairs, 11 based on Foata normal form. 0/4355 useless extension candidates. Maximal degree in co-relation 5160. Up to 210 conditions per place. [2024-10-11 17:14:10,068 INFO L140 encePairwiseOnDemand]: 428/430 looper letters, 8 selfloop transitions, 1 changer transitions 0/383 dead transitions. [2024-10-11 17:14:10,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 383 transitions, 920 flow [2024-10-11 17:14:10,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1243 transitions. [2024-10-11 17:14:10,071 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9635658914728682 [2024-10-11 17:14:10,072 INFO L175 Difference]: Start difference. First operand has 372 places, 384 transitions, 904 flow. Second operand 3 states and 1243 transitions. [2024-10-11 17:14:10,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 383 transitions, 920 flow [2024-10-11 17:14:10,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 383 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:14:10,083 INFO L231 Difference]: Finished difference. Result has 371 places, 383 transitions, 900 flow [2024-10-11 17:14:10,084 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=382, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=900, PETRI_PLACES=371, PETRI_TRANSITIONS=383} [2024-10-11 17:14:10,084 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -21 predicate places. [2024-10-11 17:14:10,085 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 383 transitions, 900 flow [2024-10-11 17:14:10,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 414.0) internal successors, (1242), 3 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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:14:10,085 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:10,086 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:10,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:14:10,086 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:10,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash -2069889432, now seen corresponding path program 1 times [2024-10-11 17:14:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:10,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627544114] [2024-10-11 17:14:10,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:10,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:10,160 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:14:10,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:10,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627544114] [2024-10-11 17:14:10,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627544114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:10,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:10,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:10,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365819123] [2024-10-11 17:14:10,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:10,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:10,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:10,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:10,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:10,175 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-10-11 17:14:10,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 383 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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:14:10,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:10,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-10-11 17:14:10,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:11,008 INFO L124 PetriNetUnfolderBase]: 447/5342 cut-off events. [2024-10-11 17:14:11,009 INFO L125 PetriNetUnfolderBase]: For 11/35 co-relation queries the response was YES. [2024-10-11 17:14:11,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6362 conditions, 5342 events. 447/5342 cut-off events. For 11/35 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 58440 event pairs, 25 based on Foata normal form. 0/4912 useless extension candidates. Maximal degree in co-relation 6230. Up to 193 conditions per place. [2024-10-11 17:14:11,094 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 10 selfloop transitions, 1 changer transitions 0/381 dead transitions. [2024-10-11 17:14:11,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 381 transitions, 918 flow [2024-10-11 17:14:11,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:11,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:11,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2024-10-11 17:14:11,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9589147286821705 [2024-10-11 17:14:11,098 INFO L175 Difference]: Start difference. First operand has 371 places, 383 transitions, 900 flow. Second operand 3 states and 1237 transitions. [2024-10-11 17:14:11,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 381 transitions, 918 flow [2024-10-11 17:14:11,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 381 transitions, 917 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:14:11,107 INFO L231 Difference]: Finished difference. Result has 370 places, 381 transitions, 897 flow [2024-10-11 17:14:11,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=370, PETRI_TRANSITIONS=381} [2024-10-11 17:14:11,108 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -22 predicate places. [2024-10-11 17:14:11,109 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 381 transitions, 897 flow [2024-10-11 17:14:11,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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:14:11,110 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:14:11,110 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] [2024-10-11 17:14:11,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:14:11,110 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 76 more)] === [2024-10-11 17:14:11,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:14:11,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1388669785, now seen corresponding path program 1 times [2024-10-11 17:14:11,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:14:11,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198107159] [2024-10-11 17:14:11,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:14:11,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:14:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:14:11,185 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:14:11,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:14:11,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198107159] [2024-10-11 17:14:11,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198107159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:14:11,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:14:11,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:14:11,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731821605] [2024-10-11 17:14:11,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:14:11,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:14:11,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:14:11,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:14:11,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:14:11,203 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 408 out of 430 [2024-10-11 17:14:11,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 381 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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:14:11,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:14:11,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 408 of 430 [2024-10-11 17:14:11,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:14:11,750 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1188] L56-52-->L56-53: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork2_#t~nondet24#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|, #race~result_8~0=|v_#race~result_8~0_1|} AuxVars[] AssignedVars[#race~result_8~0][269], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), 485#true, Black: 451#true, 457#(= |#race~sort_label_2~0| 0), Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), 488#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 470#true, Black: 438#true, Black: 442#true, 393#L56-53true, Black: 476#(not |thread3Thread1of1ForFork2_#t~short19#1|), 453#(= |#race~sort_label_0~0| 0)]) [2024-10-11 17:14:11,751 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2024-10-11 17:14:11,751 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-10-11 17:14:11,751 INFO L297 olderBase$Statistics]: existing Event has 177 ancestors and is cut-off event [2024-10-11 17:14:11,751 INFO L297 olderBase$Statistics]: existing Event has 174 ancestors and is cut-off event [2024-10-11 17:14:11,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1188] L56-52-->L56-53: Formula: (= |v_#race~result_8~0_1| |v_thread3Thread1of1ForFork2_#t~nondet24#1_3|) InVars {thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|} OutVars{thread3Thread1of1ForFork2_#t~nondet24#1=|v_thread3Thread1of1ForFork2_#t~nondet24#1_3|, #race~result_8~0=|v_#race~result_8~0_1|} AuxVars[] AssignedVars[#race~result_8~0][269], [Black: 448#(not |thread1Thread1of1ForFork0_#t~short3#1|), 436#(= |#race~sort_label_is_null_1~0| 0), 485#true, Black: 451#true, 457#(= |#race~sort_label_2~0| 0), Black: 455#true, 254#L76true, 440#(= |#race~sort_label_is_null_3~0| 0), Black: 464#(not |thread2Thread1of1ForFork1_#t~short11#1|), 488#true, Black: 434#true, 444#(= |#race~sort_label_is_null_5~0| 0), 472#(= |#race~sort_label_4~0| 0), Black: 438#true, Black: 470#true, Black: 474#true, Black: 442#true, 393#L56-53true, 453#(= |#race~sort_label_0~0| 0)]) [2024-10-11 17:14:11,759 INFO L294 olderBase$Statistics]: this new event has 174 ancestors and is not cut-off event [2024-10-11 17:14:11,759 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-10-11 17:14:11,760 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is not cut-off event [2024-10-11 17:14:11,760 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2024-10-11 17:14:11,768 INFO L124 PetriNetUnfolderBase]: 285/2989 cut-off events. [2024-10-11 17:14:11,768 INFO L125 PetriNetUnfolderBase]: For 38/52 co-relation queries the response was YES. [2024-10-11 17:14:11,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3652 conditions, 2989 events. 285/2989 cut-off events. For 38/52 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 27973 event pairs, 33 based on Foata normal form. 5/2739 useless extension candidates. Maximal degree in co-relation 3575. Up to 150 conditions per place. [2024-10-11 17:14:11,812 INFO L140 encePairwiseOnDemand]: 427/430 looper letters, 0 selfloop transitions, 0 changer transitions 379/379 dead transitions. [2024-10-11 17:14:11,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 379 transitions, 913 flow [2024-10-11 17:14:11,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:14:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:14:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1236 transitions. [2024-10-11 17:14:11,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.958139534883721 [2024-10-11 17:14:11,815 INFO L175 Difference]: Start difference. First operand has 370 places, 381 transitions, 897 flow. Second operand 3 states and 1236 transitions. [2024-10-11 17:14:11,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 379 transitions, 913 flow [2024-10-11 17:14:11,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 379 transitions, 912 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:14:11,821 INFO L231 Difference]: Finished difference. Result has 369 places, 0 transitions, 0 flow [2024-10-11 17:14:11,822 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=430, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=369, PETRI_TRANSITIONS=0} [2024-10-11 17:14:11,823 INFO L277 CegarLoopForPetriNet]: 392 programPoint places, -23 predicate places. [2024-10-11 17:14:11,823 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 0 transitions, 0 flow [2024-10-11 17:14:11,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.0) internal successors, (1233), 3 states have internal predecessors, (1233), 0 states have call successors, (0), 0 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:14:11,827 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (79 of 80 remaining) [2024-10-11 17:14:11,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (78 of 80 remaining) [2024-10-11 17:14:11,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (77 of 80 remaining) [2024-10-11 17:14:11,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (76 of 80 remaining) [2024-10-11 17:14:11,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 80 remaining) [2024-10-11 17:14:11,828 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (74 of 80 remaining) [2024-10-11 17:14:11,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (73 of 80 remaining) [2024-10-11 17:14:11,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (72 of 80 remaining) [2024-10-11 17:14:11,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (71 of 80 remaining) [2024-10-11 17:14:11,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (70 of 80 remaining) [2024-10-11 17:14:11,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 80 remaining) [2024-10-11 17:14:11,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (68 of 80 remaining) [2024-10-11 17:14:11,829 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 80 remaining) [2024-10-11 17:14:11,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (66 of 80 remaining) [2024-10-11 17:14:11,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (65 of 80 remaining) [2024-10-11 17:14:11,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (64 of 80 remaining) [2024-10-11 17:14:11,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (63 of 80 remaining) [2024-10-11 17:14:11,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 80 remaining) [2024-10-11 17:14:11,830 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (61 of 80 remaining) [2024-10-11 17:14:11,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (60 of 80 remaining) [2024-10-11 17:14:11,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (59 of 80 remaining) [2024-10-11 17:14:11,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (58 of 80 remaining) [2024-10-11 17:14:11,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (57 of 80 remaining) [2024-10-11 17:14:11,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (56 of 80 remaining) [2024-10-11 17:14:11,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (55 of 80 remaining) [2024-10-11 17:14:11,831 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (54 of 80 remaining) [2024-10-11 17:14:11,832 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (53 of 80 remaining) [2024-10-11 17:14:11,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (52 of 80 remaining) [2024-10-11 17:14:11,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (51 of 80 remaining) [2024-10-11 17:14:11,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (50 of 80 remaining) [2024-10-11 17:14:11,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (49 of 80 remaining) [2024-10-11 17:14:11,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (48 of 80 remaining) [2024-10-11 17:14:11,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (47 of 80 remaining) [2024-10-11 17:14:11,833 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (46 of 80 remaining) [2024-10-11 17:14:11,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 80 remaining) [2024-10-11 17:14:11,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (44 of 80 remaining) [2024-10-11 17:14:11,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 80 remaining) [2024-10-11 17:14:11,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (42 of 80 remaining) [2024-10-11 17:14:11,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 80 remaining) [2024-10-11 17:14:11,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (40 of 80 remaining) [2024-10-11 17:14:11,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 80 remaining) [2024-10-11 17:14:11,834 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (38 of 80 remaining) [2024-10-11 17:14:11,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (37 of 80 remaining) [2024-10-11 17:14:11,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (36 of 80 remaining) [2024-10-11 17:14:11,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 80 remaining) [2024-10-11 17:14:11,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 80 remaining) [2024-10-11 17:14:11,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 80 remaining) [2024-10-11 17:14:11,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (32 of 80 remaining) [2024-10-11 17:14:11,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (31 of 80 remaining) [2024-10-11 17:14:11,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 80 remaining) [2024-10-11 17:14:11,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (29 of 80 remaining) [2024-10-11 17:14:11,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 80 remaining) [2024-10-11 17:14:11,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (27 of 80 remaining) [2024-10-11 17:14:11,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (26 of 80 remaining) [2024-10-11 17:14:11,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 80 remaining) [2024-10-11 17:14:11,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 80 remaining) [2024-10-11 17:14:11,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (23 of 80 remaining) [2024-10-11 17:14:11,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (22 of 80 remaining) [2024-10-11 17:14:11,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (21 of 80 remaining) [2024-10-11 17:14:11,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 80 remaining) [2024-10-11 17:14:11,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (19 of 80 remaining) [2024-10-11 17:14:11,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 80 remaining) [2024-10-11 17:14:11,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 80 remaining) [2024-10-11 17:14:11,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (16 of 80 remaining) [2024-10-11 17:14:11,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (15 of 80 remaining) [2024-10-11 17:14:11,838 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (14 of 80 remaining) [2024-10-11 17:14:11,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (13 of 80 remaining) [2024-10-11 17:14:11,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (12 of 80 remaining) [2024-10-11 17:14:11,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (11 of 80 remaining) [2024-10-11 17:14:11,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 80 remaining) [2024-10-11 17:14:11,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 80 remaining) [2024-10-11 17:14:11,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (8 of 80 remaining) [2024-10-11 17:14:11,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (7 of 80 remaining) [2024-10-11 17:14:11,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (6 of 80 remaining) [2024-10-11 17:14:11,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (5 of 80 remaining) [2024-10-11 17:14:11,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (4 of 80 remaining) [2024-10-11 17:14:11,839 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 80 remaining) [2024-10-11 17:14:11,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (2 of 80 remaining) [2024-10-11 17:14:11,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 80 remaining) [2024-10-11 17:14:11,840 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (0 of 80 remaining) [2024-10-11 17:14:11,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:14:11,840 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:14:11,851 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:14:11,851 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:14:11,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:14:11 BasicIcfg [2024-10-11 17:14:11,857 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:14:11,858 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:14:11,858 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:14:11,858 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:14:11,858 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:58" (3/4) ... [2024-10-11 17:14:11,860 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:14:11,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:14:11,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:14:11,864 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:14:11,871 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-11 17:14:11,872 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:14:11,872 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:14:11,872 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:14:11,979 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:14:11,982 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:14:11,982 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:14:11,982 INFO L158 Benchmark]: Toolchain (without parser) took 14721.21ms. Allocated memory was 172.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 105.2MB in the beginning and 604.8MB in the end (delta: -499.6MB). Peak memory consumption was 856.8MB. Max. memory is 16.1GB. [2024-10-11 17:14:11,983 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:14:11,983 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.31ms. Allocated memory is still 172.0MB. Free memory was 105.0MB in the beginning and 91.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 17:14:11,983 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.51ms. Allocated memory is still 172.0MB. Free memory was 91.2MB in the beginning and 88.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:14:11,983 INFO L158 Benchmark]: Boogie Preprocessor took 62.71ms. Allocated memory is still 172.0MB. Free memory was 88.4MB in the beginning and 145.1MB in the end (delta: -56.7MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2024-10-11 17:14:11,983 INFO L158 Benchmark]: RCFGBuilder took 838.96ms. Allocated memory is still 172.0MB. Free memory was 145.1MB in the beginning and 115.3MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 17:14:11,984 INFO L158 Benchmark]: TraceAbstraction took 13253.82ms. Allocated memory was 172.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 114.7MB in the beginning and 610.0MB in the end (delta: -495.4MB). Peak memory consumption was 863.6MB. Max. memory is 16.1GB. [2024-10-11 17:14:11,984 INFO L158 Benchmark]: Witness Printer took 124.31ms. Allocated memory is still 1.5GB. Free memory was 610.0MB in the beginning and 604.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:14:11,987 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.31ms. Allocated memory is still 172.0MB. Free memory was 105.0MB in the beginning and 91.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.51ms. Allocated memory is still 172.0MB. Free memory was 91.2MB in the beginning and 88.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.71ms. Allocated memory is still 172.0MB. Free memory was 88.4MB in the beginning and 145.1MB in the end (delta: -56.7MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * RCFGBuilder took 838.96ms. Allocated memory is still 172.0MB. Free memory was 145.1MB in the beginning and 115.3MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13253.82ms. Allocated memory was 172.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 114.7MB in the beginning and 610.0MB in the end (delta: -495.4MB). Peak memory consumption was 863.6MB. Max. memory is 16.1GB. * Witness Printer took 124.31ms. Allocated memory is still 1.5GB. Free memory was 610.0MB in the beginning and 604.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: 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: 80]: 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: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 674 locations, 80 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: 13.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 550 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 131 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 648 IncrementalHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 131 mSDtfsCounter, 648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=908occurred in iteration=17, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1874 NumberOfCodeBlocks, 1874 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1853 ConstructedInterpolants, 0 QuantifiedInterpolants, 1892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 44 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:14:12,023 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