./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/unroll-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/unroll-5.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:03:05,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:03:06,030 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:03:06,034 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:03:06,035 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:03:06,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:03:06,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:03:06,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:03:06,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:03:06,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:03:06,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:03:06,076 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:03:06,076 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:03:06,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:03:06,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:03:06,079 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:03:06,080 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:03:06,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:03:06,080 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:03:06,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:03:06,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:03:06,082 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:03:06,084 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:03:06,085 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:03:06,085 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:03:06,085 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:03:06,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:03:06,086 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:03:06,086 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:03:06,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:03:06,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:03:06,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:03:06,087 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:03:06,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:03:06,088 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:03:06,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:03:06,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:03:06,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:03:06,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:03:06,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:03:06,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:03:06,094 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 624ca078114fa3c35bb1960efece3c50cba0d03b97522c4936fd5f6e5d783f29 [2024-11-09 07:03:06,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:03:06,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:03:06,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:03:06,381 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:03:06,382 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:03:06,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-5.wvr.c [2024-11-09 07:03:07,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:03:08,114 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:03:08,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-5.wvr.c [2024-11-09 07:03:08,124 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d816be46/949c956715854ba78546c907174d9bb0/FLAG6c8ba40a4 [2024-11-09 07:03:08,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d816be46/949c956715854ba78546c907174d9bb0 [2024-11-09 07:03:08,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:03:08,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:03:08,144 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:03:08,144 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:03:08,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:03:08,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:03:08" (1/1) ... [2024-11-09 07:03:08,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4749c343 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:08, skipping insertion in model container [2024-11-09 07:03:08,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:03:08" (1/1) ... [2024-11-09 07:03:08,183 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:03:08,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:03:08,449 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:03:08,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:03:08,509 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:03:08,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:08 WrapperNode [2024-11-09 07:03:08,510 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:03:08,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:03:08,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:03:08,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:03:08,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:08" (1/1) ... [2024-11-09 07:03:08,525 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:08" (1/1) ... [2024-11-09 07:03:08,558 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 330 [2024-11-09 07:03:08,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:03:08,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:03:08,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:03:08,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:03:08,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:08" (1/1) ... [2024-11-09 07:03:08,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:08" (1/1) ... [2024-11-09 07:03:08,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:08" (1/1) ... [2024-11-09 07:03:08,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:08" (1/1) ... [2024-11-09 07:03:08,598 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:08" (1/1) ... [2024-11-09 07:03:08,606 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:08" (1/1) ... [2024-11-09 07:03:08,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:08" (1/1) ... [2024-11-09 07:03:08,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:08" (1/1) ... [2024-11-09 07:03:08,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:03:08,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:03:08,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:03:08,619 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:03:08,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:08" (1/1) ... [2024-11-09 07:03:08,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:03:08,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:03:08,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:03:08,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:03:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:03:08,701 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 07:03:08,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 07:03:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 07:03:08,702 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 07:03:08,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:03:08,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:03:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:03:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:03:08,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:03:08,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:03:08,706 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:03:08,801 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:03:08,803 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:03:09,425 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:03:09,426 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:03:09,455 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:03:09,457 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-09 07:03:09,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:03:09 BoogieIcfgContainer [2024-11-09 07:03:09,457 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:03:09,459 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:03:09,459 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:03:09,462 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:03:09,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:03:08" (1/3) ... [2024-11-09 07:03:09,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0438b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:03:09, skipping insertion in model container [2024-11-09 07:03:09,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:03:08" (2/3) ... [2024-11-09 07:03:09,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c0438b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:03:09, skipping insertion in model container [2024-11-09 07:03:09,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:03:09" (3/3) ... [2024-11-09 07:03:09,466 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2024-11-09 07:03:09,481 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:03:09,482 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2024-11-09 07:03:09,482 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:03:09,626 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 07:03:09,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 423 places, 439 transitions, 892 flow [2024-11-09 07:03:09,831 INFO L124 PetriNetUnfolderBase]: 23/437 cut-off events. [2024-11-09 07:03:09,832 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 07:03:09,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 437 events. 23/437 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 532 event pairs, 0 based on Foata normal form. 0/361 useless extension candidates. Maximal degree in co-relation 300. Up to 2 conditions per place. [2024-11-09 07:03:09,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 423 places, 439 transitions, 892 flow [2024-11-09 07:03:09,885 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 405 places, 420 transitions, 852 flow [2024-11-09 07:03:09,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:03:09,902 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;@3564e19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:03:09,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 99 error locations. [2024-11-09 07:03:09,907 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:03:09,907 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2024-11-09 07:03:09,907 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:03:09,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:09,908 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] [2024-11-09 07:03:09,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:09,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:09,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1426788379, now seen corresponding path program 1 times [2024-11-09 07:03:09,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:09,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450774775] [2024-11-09 07:03:09,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:09,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:10,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:10,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450774775] [2024-11-09 07:03:10,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450774775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:10,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:10,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:10,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104005890] [2024-11-09 07:03:10,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:10,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:10,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:10,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:10,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:10,166 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 439 [2024-11-09 07:03:10,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 420 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:10,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:10,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 439 [2024-11-09 07:03:10,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:10,309 INFO L124 PetriNetUnfolderBase]: 16/514 cut-off events. [2024-11-09 07:03:10,309 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-09 07:03:10,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 514 events. 16/514 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1066 event pairs, 3 based on Foata normal form. 13/434 useless extension candidates. Maximal degree in co-relation 409. Up to 19 conditions per place. [2024-11-09 07:03:10,319 INFO L140 encePairwiseOnDemand]: 423/439 looper letters, 10 selfloop transitions, 2 changer transitions 4/406 dead transitions. [2024-11-09 07:03:10,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 406 transitions, 848 flow [2024-11-09 07:03:10,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:10,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1256 transitions. [2024-11-09 07:03:10,345 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9536826119969628 [2024-11-09 07:03:10,347 INFO L175 Difference]: Start difference. First operand has 405 places, 420 transitions, 852 flow. Second operand 3 states and 1256 transitions. [2024-11-09 07:03:10,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 406 transitions, 848 flow [2024-11-09 07:03:10,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 406 transitions, 840 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 07:03:10,365 INFO L231 Difference]: Finished difference. Result has 402 places, 402 transitions, 812 flow [2024-11-09 07:03:10,369 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=816, PETRI_DIFFERENCE_MINUEND_PLACES=400, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=402, PETRI_TRANSITIONS=402} [2024-11-09 07:03:10,375 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -3 predicate places. [2024-11-09 07:03:10,375 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 402 transitions, 812 flow [2024-11-09 07:03:10,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 411.3333333333333) internal successors, (1234), 3 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:10,377 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:10,377 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] [2024-11-09 07:03:10,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:03:10,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:10,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:10,379 INFO L85 PathProgramCache]: Analyzing trace with hash 639706644, now seen corresponding path program 1 times [2024-11-09 07:03:10,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:10,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389548409] [2024-11-09 07:03:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:10,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:10,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:10,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:10,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389548409] [2024-11-09 07:03:10,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389548409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:10,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:10,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:10,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983598092] [2024-11-09 07:03:10,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:10,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:10,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:10,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:10,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:10,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 405 out of 439 [2024-11-09 07:03:10,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 402 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:10,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:10,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 405 of 439 [2024-11-09 07:03:10,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:10,638 INFO L124 PetriNetUnfolderBase]: 26/649 cut-off events. [2024-11-09 07:03:10,639 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 07:03:10,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 696 conditions, 649 events. 26/649 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1622 event pairs, 11 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 668. Up to 38 conditions per place. [2024-11-09 07:03:10,644 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 15 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2024-11-09 07:03:10,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 401 transitions, 844 flow [2024-11-09 07:03:10,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:10,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:10,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1233 transitions. [2024-11-09 07:03:10,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9362186788154897 [2024-11-09 07:03:10,648 INFO L175 Difference]: Start difference. First operand has 402 places, 402 transitions, 812 flow. Second operand 3 states and 1233 transitions. [2024-11-09 07:03:10,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 401 transitions, 844 flow [2024-11-09 07:03:10,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 401 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:10,655 INFO L231 Difference]: Finished difference. Result has 397 places, 401 transitions, 810 flow [2024-11-09 07:03:10,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=397, PETRI_TRANSITIONS=401} [2024-11-09 07:03:10,657 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -8 predicate places. [2024-11-09 07:03:10,657 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 401 transitions, 810 flow [2024-11-09 07:03:10,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 406.3333333333333) internal successors, (1219), 3 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:10,658 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:10,658 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] [2024-11-09 07:03:10,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:03:10,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:10,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:10,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1202620902, now seen corresponding path program 1 times [2024-11-09 07:03:10,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:10,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436981333] [2024-11-09 07:03:10,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:10,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:10,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:10,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436981333] [2024-11-09 07:03:10,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436981333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:10,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:10,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:10,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996285876] [2024-11-09 07:03:10,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:10,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:10,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:10,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:10,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:10,769 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 439 [2024-11-09 07:03:10,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 401 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:10,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:10,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 439 [2024-11-09 07:03:10,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:11,051 INFO L124 PetriNetUnfolderBase]: 96/1418 cut-off events. [2024-11-09 07:03:11,052 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-09 07:03:11,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1545 conditions, 1418 events. 96/1418 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 6351 event pairs, 32 based on Foata normal form. 0/1154 useless extension candidates. Maximal degree in co-relation 1509. Up to 117 conditions per place. [2024-11-09 07:03:11,064 INFO L140 encePairwiseOnDemand]: 430/439 looper letters, 20 selfloop transitions, 1 changer transitions 0/393 dead transitions. [2024-11-09 07:03:11,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 393 transitions, 836 flow [2024-11-09 07:03:11,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:11,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:11,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1214 transitions. [2024-11-09 07:03:11,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9217919514047077 [2024-11-09 07:03:11,068 INFO L175 Difference]: Start difference. First operand has 397 places, 401 transitions, 810 flow. Second operand 3 states and 1214 transitions. [2024-11-09 07:03:11,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 393 transitions, 836 flow [2024-11-09 07:03:11,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 393 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:11,078 INFO L231 Difference]: Finished difference. Result has 389 places, 393 transitions, 792 flow [2024-11-09 07:03:11,079 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=393, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=392, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=792, PETRI_PLACES=389, PETRI_TRANSITIONS=393} [2024-11-09 07:03:11,080 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -16 predicate places. [2024-11-09 07:03:11,081 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 393 transitions, 792 flow [2024-11-09 07:03:11,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 396.0) internal successors, (1188), 3 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:11,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:11,082 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] [2024-11-09 07:03:11,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:03:11,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:11,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash 845562235, now seen corresponding path program 1 times [2024-11-09 07:03:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:11,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741559337] [2024-11-09 07:03:11,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:11,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:11,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:11,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:11,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741559337] [2024-11-09 07:03:11,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741559337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:11,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:11,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:11,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850483068] [2024-11-09 07:03:11,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:11,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:11,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:11,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:11,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:11,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 439 [2024-11-09 07:03:11,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 393 transitions, 792 flow. Second operand has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:11,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:11,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 439 [2024-11-09 07:03:11,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:11,328 INFO L124 PetriNetUnfolderBase]: 26/635 cut-off events. [2024-11-09 07:03:11,328 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 07:03:11,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 635 events. 26/635 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1601 event pairs, 11 based on Foata normal form. 0/531 useless extension candidates. Maximal degree in co-relation 643. Up to 36 conditions per place. [2024-11-09 07:03:11,335 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 13 selfloop transitions, 2 changer transitions 0/392 dead transitions. [2024-11-09 07:03:11,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 392 transitions, 820 flow [2024-11-09 07:03:11,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:11,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1237 transitions. [2024-11-09 07:03:11,339 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9392558845861807 [2024-11-09 07:03:11,339 INFO L175 Difference]: Start difference. First operand has 389 places, 393 transitions, 792 flow. Second operand 3 states and 1237 transitions. [2024-11-09 07:03:11,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 392 transitions, 820 flow [2024-11-09 07:03:11,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 392 transitions, 819 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:03:11,346 INFO L231 Difference]: Finished difference. Result has 389 places, 392 transitions, 793 flow [2024-11-09 07:03:11,347 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=390, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=389, PETRI_TRANSITIONS=392} [2024-11-09 07:03:11,348 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -16 predicate places. [2024-11-09 07:03:11,348 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 392 transitions, 793 flow [2024-11-09 07:03:11,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.3333333333333) internal successors, (1225), 3 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:11,349 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:11,349 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] [2024-11-09 07:03:11,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:03:11,350 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:11,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:11,350 INFO L85 PathProgramCache]: Analyzing trace with hash 602574228, now seen corresponding path program 1 times [2024-11-09 07:03:11,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:11,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918706629] [2024-11-09 07:03:11,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:11,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:11,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:11,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:11,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918706629] [2024-11-09 07:03:11,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918706629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:11,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:11,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:11,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059613351] [2024-11-09 07:03:11,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:11,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:11,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:11,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:11,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:12,149 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 382 out of 439 [2024-11-09 07:03:12,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 392 transitions, 793 flow. Second operand has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:12,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:12,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 382 of 439 [2024-11-09 07:03:12,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:12,444 INFO L124 PetriNetUnfolderBase]: 188/1752 cut-off events. [2024-11-09 07:03:12,445 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2024-11-09 07:03:12,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2060 conditions, 1752 events. 188/1752 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8939 event pairs, 104 based on Foata normal form. 0/1456 useless extension candidates. Maximal degree in co-relation 2025. Up to 292 conditions per place. [2024-11-09 07:03:12,461 INFO L140 encePairwiseOnDemand]: 433/439 looper letters, 36 selfloop transitions, 5 changer transitions 0/391 dead transitions. [2024-11-09 07:03:12,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 393 places, 391 transitions, 873 flow [2024-11-09 07:03:12,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2334 transitions. [2024-11-09 07:03:12,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8861047835990888 [2024-11-09 07:03:12,468 INFO L175 Difference]: Start difference. First operand has 389 places, 392 transitions, 793 flow. Second operand 6 states and 2334 transitions. [2024-11-09 07:03:12,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 393 places, 391 transitions, 873 flow [2024-11-09 07:03:12,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 391 transitions, 869 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:12,478 INFO L231 Difference]: Finished difference. Result has 391 places, 391 transitions, 797 flow [2024-11-09 07:03:12,479 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=797, PETRI_PLACES=391, PETRI_TRANSITIONS=391} [2024-11-09 07:03:12,479 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -14 predicate places. [2024-11-09 07:03:12,480 INFO L471 AbstractCegarLoop]: Abstraction has has 391 places, 391 transitions, 797 flow [2024-11-09 07:03:12,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:12,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:12,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] [2024-11-09 07:03:12,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:03:12,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:12,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:12,483 INFO L85 PathProgramCache]: Analyzing trace with hash 736108395, now seen corresponding path program 1 times [2024-11-09 07:03:12,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:12,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217368601] [2024-11-09 07:03:12,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:12,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:12,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:12,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217368601] [2024-11-09 07:03:12,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217368601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:12,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:12,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:12,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744270286] [2024-11-09 07:03:12,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:12,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:12,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:12,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:12,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:12,557 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 439 [2024-11-09 07:03:12,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 391 transitions, 797 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-11-09 07:03:12,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:12,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 439 [2024-11-09 07:03:12,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:12,690 INFO L124 PetriNetUnfolderBase]: 40/1161 cut-off events. [2024-11-09 07:03:12,691 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-09 07:03:12,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 1161 events. 40/1161 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4665 event pairs, 8 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 1189. Up to 32 conditions per place. [2024-11-09 07:03:12,699 INFO L140 encePairwiseOnDemand]: 435/439 looper letters, 10 selfloop transitions, 1 changer transitions 0/388 dead transitions. [2024-11-09 07:03:12,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 388 transitions, 813 flow [2024-11-09 07:03:12,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:12,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1244 transitions. [2024-11-09 07:03:12,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9445709946848899 [2024-11-09 07:03:12,703 INFO L175 Difference]: Start difference. First operand has 391 places, 391 transitions, 797 flow. Second operand 3 states and 1244 transitions. [2024-11-09 07:03:12,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 388 transitions, 813 flow [2024-11-09 07:03:12,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 385 places, 388 transitions, 803 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:12,710 INFO L231 Difference]: Finished difference. Result has 385 places, 388 transitions, 783 flow [2024-11-09 07:03:12,711 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=387, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=385, PETRI_TRANSITIONS=388} [2024-11-09 07:03:12,712 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -20 predicate places. [2024-11-09 07:03:12,712 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 388 transitions, 783 flow [2024-11-09 07:03:12,713 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-11-09 07:03:12,713 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:12,713 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-11-09 07:03:12,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:03:12,713 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:12,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:12,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1894450176, now seen corresponding path program 1 times [2024-11-09 07:03:12,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:12,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729952305] [2024-11-09 07:03:12,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:12,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:12,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:12,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:12,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729952305] [2024-11-09 07:03:12,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729952305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:12,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:12,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:12,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509572323] [2024-11-09 07:03:12,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:12,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:12,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:12,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:12,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:12,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 439 [2024-11-09 07:03:12,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 388 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:12,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:12,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 439 [2024-11-09 07:03:12,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:12,863 INFO L124 PetriNetUnfolderBase]: 19/439 cut-off events. [2024-11-09 07:03:12,864 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 07:03:12,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 439 events. 19/439 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 706 event pairs, 1 based on Foata normal form. 0/385 useless extension candidates. Maximal degree in co-relation 447. Up to 21 conditions per place. [2024-11-09 07:03:12,868 INFO L140 encePairwiseOnDemand]: 432/439 looper letters, 11 selfloop transitions, 3 changer transitions 0/385 dead transitions. [2024-11-09 07:03:12,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 385 transitions, 806 flow [2024-11-09 07:03:12,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1239 transitions. [2024-11-09 07:03:12,872 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9407744874715261 [2024-11-09 07:03:12,872 INFO L175 Difference]: Start difference. First operand has 385 places, 388 transitions, 783 flow. Second operand 3 states and 1239 transitions. [2024-11-09 07:03:12,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 385 transitions, 806 flow [2024-11-09 07:03:12,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 385 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:03:12,880 INFO L231 Difference]: Finished difference. Result has 382 places, 384 transitions, 780 flow [2024-11-09 07:03:12,881 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=380, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=780, PETRI_PLACES=382, PETRI_TRANSITIONS=384} [2024-11-09 07:03:12,882 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -23 predicate places. [2024-11-09 07:03:12,882 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 384 transitions, 780 flow [2024-11-09 07:03:12,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 408.0) internal successors, (1224), 3 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:12,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:12,883 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-11-09 07:03:12,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:03:12,884 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:12,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:12,884 INFO L85 PathProgramCache]: Analyzing trace with hash 296939360, now seen corresponding path program 1 times [2024-11-09 07:03:12,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:12,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551085780] [2024-11-09 07:03:12,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:12,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:12,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:12,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551085780] [2024-11-09 07:03:12,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551085780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:12,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:12,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:12,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586129796] [2024-11-09 07:03:12,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:12,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:12,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:12,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:12,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:13,014 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 439 [2024-11-09 07:03:13,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 384 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:13,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:13,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 439 [2024-11-09 07:03:13,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:13,115 INFO L124 PetriNetUnfolderBase]: 49/568 cut-off events. [2024-11-09 07:03:13,115 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2024-11-09 07:03:13,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 568 events. 49/568 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1665 event pairs, 5 based on Foata normal form. 1/516 useless extension candidates. Maximal degree in co-relation 653. Up to 91 conditions per place. [2024-11-09 07:03:13,120 INFO L140 encePairwiseOnDemand]: 412/439 looper letters, 29 selfloop transitions, 10 changer transitions 4/369 dead transitions. [2024-11-09 07:03:13,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 369 transitions, 833 flow [2024-11-09 07:03:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:13,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1158 transitions. [2024-11-09 07:03:13,123 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8792710706150342 [2024-11-09 07:03:13,123 INFO L175 Difference]: Start difference. First operand has 382 places, 384 transitions, 780 flow. Second operand 3 states and 1158 transitions. [2024-11-09 07:03:13,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 369 transitions, 833 flow [2024-11-09 07:03:13,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 369 transitions, 827 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:13,130 INFO L231 Difference]: Finished difference. Result has 366 places, 364 transitions, 753 flow [2024-11-09 07:03:13,130 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=753, PETRI_PLACES=366, PETRI_TRANSITIONS=364} [2024-11-09 07:03:13,131 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -39 predicate places. [2024-11-09 07:03:13,131 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 364 transitions, 753 flow [2024-11-09 07:03:13,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:13,132 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:13,132 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] [2024-11-09 07:03:13,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:03:13,133 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:13,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1047153410, now seen corresponding path program 1 times [2024-11-09 07:03:13,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:13,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138378096] [2024-11-09 07:03:13,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:13,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:13,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:13,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138378096] [2024-11-09 07:03:13,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138378096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:13,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:13,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:13,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962032927] [2024-11-09 07:03:13,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:13,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:13,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:13,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:13,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:13,213 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 439 [2024-11-09 07:03:13,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 364 transitions, 753 flow. Second operand has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:13,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:13,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 439 [2024-11-09 07:03:13,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:13,352 INFO L124 PetriNetUnfolderBase]: 85/1157 cut-off events. [2024-11-09 07:03:13,352 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-09 07:03:13,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 1157 events. 85/1157 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 4640 event pairs, 10 based on Foata normal form. 0/1046 useless extension candidates. Maximal degree in co-relation 1280. Up to 104 conditions per place. [2024-11-09 07:03:13,363 INFO L140 encePairwiseOnDemand]: 431/439 looper letters, 18 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2024-11-09 07:03:13,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 362 transitions, 791 flow [2024-11-09 07:03:13,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:13,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1229 transitions. [2024-11-09 07:03:13,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9331814730447988 [2024-11-09 07:03:13,367 INFO L175 Difference]: Start difference. First operand has 366 places, 364 transitions, 753 flow. Second operand 3 states and 1229 transitions. [2024-11-09 07:03:13,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 362 transitions, 791 flow [2024-11-09 07:03:13,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 362 transitions, 771 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:13,376 INFO L231 Difference]: Finished difference. Result has 357 places, 360 transitions, 735 flow [2024-11-09 07:03:13,377 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=735, PETRI_PLACES=357, PETRI_TRANSITIONS=360} [2024-11-09 07:03:13,378 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -48 predicate places. [2024-11-09 07:03:13,378 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 360 transitions, 735 flow [2024-11-09 07:03:13,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 402.3333333333333) internal successors, (1207), 3 states have internal predecessors, (1207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:13,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:13,380 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:13,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:03:13,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:13,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:13,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1351136344, now seen corresponding path program 1 times [2024-11-09 07:03:13,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:13,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066903793] [2024-11-09 07:03:13,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:13,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:13,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:13,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066903793] [2024-11-09 07:03:13,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066903793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:13,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:13,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:03:13,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088323180] [2024-11-09 07:03:13,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:13,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:03:13,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:13,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:03:13,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:03:13,535 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 413 out of 439 [2024-11-09 07:03:13,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 360 transitions, 735 flow. Second operand has 4 states, 4 states have (on average 414.25) internal successors, (1657), 4 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:13,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:13,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 413 of 439 [2024-11-09 07:03:13,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:13,724 INFO L124 PetriNetUnfolderBase]: 49/1348 cut-off events. [2024-11-09 07:03:13,724 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 07:03:13,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1419 conditions, 1348 events. 49/1348 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5248 event pairs, 3 based on Foata normal form. 0/1216 useless extension candidates. Maximal degree in co-relation 1383. Up to 18 conditions per place. [2024-11-09 07:03:13,735 INFO L140 encePairwiseOnDemand]: 433/439 looper letters, 13 selfloop transitions, 6 changer transitions 0/369 dead transitions. [2024-11-09 07:03:13,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 369 transitions, 795 flow [2024-11-09 07:03:13,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:03:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 07:03:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2085 transitions. [2024-11-09 07:03:13,739 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9498861047835991 [2024-11-09 07:03:13,739 INFO L175 Difference]: Start difference. First operand has 357 places, 360 transitions, 735 flow. Second operand 5 states and 2085 transitions. [2024-11-09 07:03:13,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 369 transitions, 795 flow [2024-11-09 07:03:13,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 369 transitions, 795 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:13,746 INFO L231 Difference]: Finished difference. Result has 364 places, 364 transitions, 773 flow [2024-11-09 07:03:13,747 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=773, PETRI_PLACES=364, PETRI_TRANSITIONS=364} [2024-11-09 07:03:13,748 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -41 predicate places. [2024-11-09 07:03:13,749 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 364 transitions, 773 flow [2024-11-09 07:03:13,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 414.25) internal successors, (1657), 4 states have internal predecessors, (1657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:13,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:13,751 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] [2024-11-09 07:03:13,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:03:13,751 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:13,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:13,752 INFO L85 PathProgramCache]: Analyzing trace with hash -357243765, now seen corresponding path program 1 times [2024-11-09 07:03:13,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:13,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273887704] [2024-11-09 07:03:13,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:13,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:14,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:14,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273887704] [2024-11-09 07:03:14,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273887704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:14,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:14,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:14,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191830829] [2024-11-09 07:03:14,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:14,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:14,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:14,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:14,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:14,530 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 406 out of 439 [2024-11-09 07:03:14,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 364 transitions, 773 flow. Second operand has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:14,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:14,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 406 of 439 [2024-11-09 07:03:14,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:14,693 INFO L124 PetriNetUnfolderBase]: 42/1051 cut-off events. [2024-11-09 07:03:14,694 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-09 07:03:14,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 1051 events. 42/1051 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 3378 event pairs, 2 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 1107. Up to 17 conditions per place. [2024-11-09 07:03:14,701 INFO L140 encePairwiseOnDemand]: 433/439 looper letters, 15 selfloop transitions, 6 changer transitions 0/367 dead transitions. [2024-11-09 07:03:14,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 367 transitions, 825 flow [2024-11-09 07:03:14,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:14,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2457 transitions. [2024-11-09 07:03:14,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9328018223234624 [2024-11-09 07:03:14,708 INFO L175 Difference]: Start difference. First operand has 364 places, 364 transitions, 773 flow. Second operand 6 states and 2457 transitions. [2024-11-09 07:03:14,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 367 transitions, 825 flow [2024-11-09 07:03:14,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 367 transitions, 825 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:14,716 INFO L231 Difference]: Finished difference. Result has 368 places, 363 transitions, 783 flow [2024-11-09 07:03:14,717 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=783, PETRI_PLACES=368, PETRI_TRANSITIONS=363} [2024-11-09 07:03:14,717 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -37 predicate places. [2024-11-09 07:03:14,717 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 363 transitions, 783 flow [2024-11-09 07:03:14,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 407.5) internal successors, (2445), 6 states have internal predecessors, (2445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:14,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:14,720 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:14,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:03:14,720 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:14,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:14,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1931297439, now seen corresponding path program 1 times [2024-11-09 07:03:14,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:14,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388052997] [2024-11-09 07:03:14,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:14,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:14,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:14,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:14,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388052997] [2024-11-09 07:03:14,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388052997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:14,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:14,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:03:14,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275236531] [2024-11-09 07:03:14,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:14,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:03:14,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:14,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:03:14,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:03:14,936 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 439 [2024-11-09 07:03:14,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 363 transitions, 783 flow. Second operand has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:14,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:14,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 439 [2024-11-09 07:03:14,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:15,130 INFO L124 PetriNetUnfolderBase]: 63/1321 cut-off events. [2024-11-09 07:03:15,130 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2024-11-09 07:03:15,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 1321 events. 63/1321 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 5829 event pairs, 6 based on Foata normal form. 0/1198 useless extension candidates. Maximal degree in co-relation 1430. Up to 67 conditions per place. [2024-11-09 07:03:15,140 INFO L140 encePairwiseOnDemand]: 433/439 looper letters, 16 selfloop transitions, 6 changer transitions 0/371 dead transitions. [2024-11-09 07:03:15,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 371 transitions, 846 flow [2024-11-09 07:03:15,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:03:15,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 07:03:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2068 transitions. [2024-11-09 07:03:15,146 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9421412300683372 [2024-11-09 07:03:15,146 INFO L175 Difference]: Start difference. First operand has 368 places, 363 transitions, 783 flow. Second operand 5 states and 2068 transitions. [2024-11-09 07:03:15,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 371 transitions, 846 flow [2024-11-09 07:03:15,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 367 places, 371 transitions, 834 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:15,153 INFO L231 Difference]: Finished difference. Result has 370 places, 367 transitions, 809 flow [2024-11-09 07:03:15,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=809, PETRI_PLACES=370, PETRI_TRANSITIONS=367} [2024-11-09 07:03:15,155 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -35 predicate places. [2024-11-09 07:03:15,156 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 367 transitions, 809 flow [2024-11-09 07:03:15,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 410.5) internal successors, (1642), 4 states have internal predecessors, (1642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:15,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:15,157 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:15,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:03:15,157 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:15,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash 120975630, now seen corresponding path program 1 times [2024-11-09 07:03:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:15,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433336630] [2024-11-09 07:03:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:15,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:15,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:15,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433336630] [2024-11-09 07:03:15,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433336630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:15,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:15,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:15,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805624974] [2024-11-09 07:03:15,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:15,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:15,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:15,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:15,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:15,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 411 out of 439 [2024-11-09 07:03:15,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 367 transitions, 809 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:15,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:15,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 411 of 439 [2024-11-09 07:03:15,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:15,349 INFO L124 PetriNetUnfolderBase]: 37/937 cut-off events. [2024-11-09 07:03:15,349 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-11-09 07:03:15,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1070 conditions, 937 events. 37/937 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 2536 event pairs, 10 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1025. Up to 29 conditions per place. [2024-11-09 07:03:15,358 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 9 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-11-09 07:03:15,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 367 transitions, 832 flow [2024-11-09 07:03:15,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1245 transitions. [2024-11-09 07:03:15,361 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9453302961275627 [2024-11-09 07:03:15,361 INFO L175 Difference]: Start difference. First operand has 370 places, 367 transitions, 809 flow. Second operand 3 states and 1245 transitions. [2024-11-09 07:03:15,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 367 transitions, 832 flow [2024-11-09 07:03:15,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 367 transitions, 832 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 07:03:15,368 INFO L231 Difference]: Finished difference. Result has 371 places, 366 transitions, 811 flow [2024-11-09 07:03:15,369 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=371, PETRI_TRANSITIONS=366} [2024-11-09 07:03:15,369 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -34 predicate places. [2024-11-09 07:03:15,369 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 366 transitions, 811 flow [2024-11-09 07:03:15,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:15,371 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:15,371 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] [2024-11-09 07:03:15,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:03:15,371 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:15,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:15,372 INFO L85 PathProgramCache]: Analyzing trace with hash 385258091, now seen corresponding path program 1 times [2024-11-09 07:03:15,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:15,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680818754] [2024-11-09 07:03:15,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:15,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:15,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:15,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680818754] [2024-11-09 07:03:15,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680818754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:15,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:15,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:03:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455193687] [2024-11-09 07:03:15,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:15,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:03:15,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:15,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:03:15,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:03:16,011 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 378 out of 439 [2024-11-09 07:03:16,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 366 transitions, 811 flow. Second operand has 6 states, 6 states have (on average 379.6666666666667) internal successors, (2278), 6 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:16,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:16,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 378 of 439 [2024-11-09 07:03:16,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:16,212 INFO L124 PetriNetUnfolderBase]: 102/1146 cut-off events. [2024-11-09 07:03:16,212 INFO L125 PetriNetUnfolderBase]: For 91/92 co-relation queries the response was YES. [2024-11-09 07:03:16,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1495 conditions, 1146 events. 102/1146 cut-off events. For 91/92 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 5719 event pairs, 12 based on Foata normal form. 0/1071 useless extension candidates. Maximal degree in co-relation 1447. Up to 84 conditions per place. [2024-11-09 07:03:16,219 INFO L140 encePairwiseOnDemand]: 409/439 looper letters, 19 selfloop transitions, 26 changer transitions 0/365 dead transitions. [2024-11-09 07:03:16,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 365 transitions, 903 flow [2024-11-09 07:03:16,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:03:16,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:03:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2317 transitions. [2024-11-09 07:03:16,224 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8796507213363706 [2024-11-09 07:03:16,225 INFO L175 Difference]: Start difference. First operand has 371 places, 366 transitions, 811 flow. Second operand 6 states and 2317 transitions. [2024-11-09 07:03:16,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 365 transitions, 903 flow [2024-11-09 07:03:16,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 365 transitions, 899 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:16,233 INFO L231 Difference]: Finished difference. Result has 369 places, 361 transitions, 849 flow [2024-11-09 07:03:16,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=849, PETRI_PLACES=369, PETRI_TRANSITIONS=361} [2024-11-09 07:03:16,235 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -36 predicate places. [2024-11-09 07:03:16,235 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 361 transitions, 849 flow [2024-11-09 07:03:16,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 379.6666666666667) internal successors, (2278), 6 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:16,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:16,237 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:16,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:03:16,237 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:16,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:16,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1119386450, now seen corresponding path program 1 times [2024-11-09 07:03:16,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:16,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010836666] [2024-11-09 07:03:16,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:16,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:16,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:16,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:16,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010836666] [2024-11-09 07:03:16,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010836666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:16,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:16,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:16,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583900479] [2024-11-09 07:03:16,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:16,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:16,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:16,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:16,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:16,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 439 [2024-11-09 07:03:16,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 361 transitions, 849 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-11-09 07:03:16,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:16,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 439 [2024-11-09 07:03:16,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:16,540 INFO L124 PetriNetUnfolderBase]: 89/1309 cut-off events. [2024-11-09 07:03:16,541 INFO L125 PetriNetUnfolderBase]: For 86/87 co-relation queries the response was YES. [2024-11-09 07:03:16,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1733 conditions, 1309 events. 89/1309 cut-off events. For 86/87 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6391 event pairs, 50 based on Foata normal form. 0/1227 useless extension candidates. Maximal degree in co-relation 1687. Up to 170 conditions per place. [2024-11-09 07:03:16,553 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 25 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-09 07:03:16,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 361 transitions, 904 flow [2024-11-09 07:03:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:16,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2024-11-09 07:03:16,557 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9210326499620349 [2024-11-09 07:03:16,557 INFO L175 Difference]: Start difference. First operand has 369 places, 361 transitions, 849 flow. Second operand 3 states and 1213 transitions. [2024-11-09 07:03:16,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 361 transitions, 904 flow [2024-11-09 07:03:16,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 361 transitions, 852 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:03:16,566 INFO L231 Difference]: Finished difference. Result has 365 places, 360 transitions, 799 flow [2024-11-09 07:03:16,567 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=799, PETRI_PLACES=365, PETRI_TRANSITIONS=360} [2024-11-09 07:03:16,568 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -40 predicate places. [2024-11-09 07:03:16,569 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 360 transitions, 799 flow [2024-11-09 07:03:16,569 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-11-09 07:03:16,569 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:16,569 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] [2024-11-09 07:03:16,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:03:16,570 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:16,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:16,570 INFO L85 PathProgramCache]: Analyzing trace with hash 290366597, now seen corresponding path program 1 times [2024-11-09 07:03:16,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:16,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478966961] [2024-11-09 07:03:16,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:16,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:16,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:16,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478966961] [2024-11-09 07:03:16,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478966961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:16,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:16,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:16,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920370070] [2024-11-09 07:03:16,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:16,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:16,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:16,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:16,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:16,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 439 [2024-11-09 07:03:16,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 360 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:16,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:16,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 439 [2024-11-09 07:03:16,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:16,939 INFO L124 PetriNetUnfolderBase]: 88/1272 cut-off events. [2024-11-09 07:03:16,940 INFO L125 PetriNetUnfolderBase]: For 79/80 co-relation queries the response was YES. [2024-11-09 07:03:16,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1561 conditions, 1272 events. 88/1272 cut-off events. For 79/80 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 6149 event pairs, 50 based on Foata normal form. 0/1196 useless extension candidates. Maximal degree in co-relation 1515. Up to 170 conditions per place. [2024-11-09 07:03:16,949 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 25 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-09 07:03:16,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 360 transitions, 854 flow [2024-11-09 07:03:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2024-11-09 07:03:16,952 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9210326499620349 [2024-11-09 07:03:16,953 INFO L175 Difference]: Start difference. First operand has 365 places, 360 transitions, 799 flow. Second operand 3 states and 1213 transitions. [2024-11-09 07:03:16,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 360 transitions, 854 flow [2024-11-09 07:03:16,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 360 transitions, 850 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:16,958 INFO L231 Difference]: Finished difference. Result has 364 places, 359 transitions, 797 flow [2024-11-09 07:03:16,959 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=793, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=797, PETRI_PLACES=364, PETRI_TRANSITIONS=359} [2024-11-09 07:03:16,959 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -41 predicate places. [2024-11-09 07:03:16,960 INFO L471 AbstractCegarLoop]: Abstraction has has 364 places, 359 transitions, 797 flow [2024-11-09 07:03:16,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 398.6666666666667) internal successors, (1196), 3 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:16,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:16,961 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:16,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:03:16,961 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:16,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:16,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1043521148, now seen corresponding path program 1 times [2024-11-09 07:03:16,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:16,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783600645] [2024-11-09 07:03:16,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:17,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:17,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:17,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783600645] [2024-11-09 07:03:17,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783600645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:17,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:17,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:17,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740160852] [2024-11-09 07:03:17,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:17,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:17,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:17,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:17,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:17,098 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 439 [2024-11-09 07:03:17,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 359 transitions, 797 flow. Second operand has 3 states, 3 states have (on average 399.6666666666667) internal successors, (1199), 3 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:17,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:17,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 439 [2024-11-09 07:03:17,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:17,254 INFO L124 PetriNetUnfolderBase]: 87/1234 cut-off events. [2024-11-09 07:03:17,254 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2024-11-09 07:03:17,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 1234 events. 87/1234 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5850 event pairs, 50 based on Foata normal form. 0/1164 useless extension candidates. Maximal degree in co-relation 1476. Up to 170 conditions per place. [2024-11-09 07:03:17,263 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 25 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2024-11-09 07:03:17,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 359 transitions, 852 flow [2024-11-09 07:03:17,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2024-11-09 07:03:17,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9210326499620349 [2024-11-09 07:03:17,266 INFO L175 Difference]: Start difference. First operand has 364 places, 359 transitions, 797 flow. Second operand 3 states and 1213 transitions. [2024-11-09 07:03:17,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 359 transitions, 852 flow [2024-11-09 07:03:17,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 359 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:17,309 INFO L231 Difference]: Finished difference. Result has 363 places, 358 transitions, 795 flow [2024-11-09 07:03:17,310 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=795, PETRI_PLACES=363, PETRI_TRANSITIONS=358} [2024-11-09 07:03:17,311 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -42 predicate places. [2024-11-09 07:03:17,311 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 358 transitions, 795 flow [2024-11-09 07:03:17,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 399.6666666666667) internal successors, (1199), 3 states have internal predecessors, (1199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:17,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:17,312 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:17,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 07:03:17,312 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:17,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:17,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1688451731, now seen corresponding path program 1 times [2024-11-09 07:03:17,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:17,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662352840] [2024-11-09 07:03:17,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:17,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:17,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662352840] [2024-11-09 07:03:17,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662352840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:17,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:17,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:17,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683266470] [2024-11-09 07:03:17,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:17,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:17,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:17,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:17,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:17,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 439 [2024-11-09 07:03:17,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 358 transitions, 795 flow. Second operand has 3 states, 3 states have (on average 400.6666666666667) internal successors, (1202), 3 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:17,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:17,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 439 [2024-11-09 07:03:17,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:17,613 INFO L124 PetriNetUnfolderBase]: 86/1196 cut-off events. [2024-11-09 07:03:17,614 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2024-11-09 07:03:17,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 1196 events. 86/1196 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5610 event pairs, 50 based on Foata normal form. 0/1132 useless extension candidates. Maximal degree in co-relation 1438. Up to 170 conditions per place. [2024-11-09 07:03:17,622 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 25 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-09 07:03:17,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 358 transitions, 850 flow [2024-11-09 07:03:17,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2024-11-09 07:03:17,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9210326499620349 [2024-11-09 07:03:17,625 INFO L175 Difference]: Start difference. First operand has 363 places, 358 transitions, 795 flow. Second operand 3 states and 1213 transitions. [2024-11-09 07:03:17,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 358 transitions, 850 flow [2024-11-09 07:03:17,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 358 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:17,631 INFO L231 Difference]: Finished difference. Result has 362 places, 357 transitions, 793 flow [2024-11-09 07:03:17,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=793, PETRI_PLACES=362, PETRI_TRANSITIONS=357} [2024-11-09 07:03:17,632 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -43 predicate places. [2024-11-09 07:03:17,632 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 357 transitions, 793 flow [2024-11-09 07:03:17,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 400.6666666666667) internal successors, (1202), 3 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:17,632 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:03:17,633 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:03:17,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:03:17,633 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 95 more)] === [2024-11-09 07:03:17,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:03:17,636 INFO L85 PathProgramCache]: Analyzing trace with hash 863158474, now seen corresponding path program 1 times [2024-11-09 07:03:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:03:17,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758553844] [2024-11-09 07:03:17,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:03:17,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:03:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:03:17,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:03:17,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:03:17,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758553844] [2024-11-09 07:03:17,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758553844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:03:17,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:03:17,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:03:17,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444930252] [2024-11-09 07:03:17,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:03:17,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:03:17,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:03:17,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:03:17,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:03:17,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 395 out of 439 [2024-11-09 07:03:17,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 357 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:17,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:03:17,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 395 of 439 [2024-11-09 07:03:17,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:03:17,945 INFO L124 PetriNetUnfolderBase]: 85/1158 cut-off events. [2024-11-09 07:03:17,945 INFO L125 PetriNetUnfolderBase]: For 78/79 co-relation queries the response was YES. [2024-11-09 07:03:17,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1446 conditions, 1158 events. 85/1158 cut-off events. For 78/79 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 5402 event pairs, 50 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1400. Up to 170 conditions per place. [2024-11-09 07:03:17,951 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 0 selfloop transitions, 0 changer transitions 357/357 dead transitions. [2024-11-09 07:03:17,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 357 transitions, 848 flow [2024-11-09 07:03:17,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:03:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:03:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1213 transitions. [2024-11-09 07:03:17,953 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9210326499620349 [2024-11-09 07:03:17,954 INFO L175 Difference]: Start difference. First operand has 362 places, 357 transitions, 793 flow. Second operand 3 states and 1213 transitions. [2024-11-09 07:03:17,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 357 transitions, 848 flow [2024-11-09 07:03:17,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 357 transitions, 844 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:03:17,957 INFO L231 Difference]: Finished difference. Result has 361 places, 0 transitions, 0 flow [2024-11-09 07:03:17,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=361, PETRI_TRANSITIONS=0} [2024-11-09 07:03:17,958 INFO L277 CegarLoopForPetriNet]: 405 programPoint places, -44 predicate places. [2024-11-09 07:03:17,958 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 0 transitions, 0 flow [2024-11-09 07:03:17,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 401.6666666666667) internal successors, (1205), 3 states have internal predecessors, (1205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:03:17,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (98 of 99 remaining) [2024-11-09 07:03:17,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (97 of 99 remaining) [2024-11-09 07:03:17,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (96 of 99 remaining) [2024-11-09 07:03:17,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (95 of 99 remaining) [2024-11-09 07:03:17,962 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (94 of 99 remaining) [2024-11-09 07:03:17,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (93 of 99 remaining) [2024-11-09 07:03:17,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (92 of 99 remaining) [2024-11-09 07:03:17,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (91 of 99 remaining) [2024-11-09 07:03:17,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (90 of 99 remaining) [2024-11-09 07:03:17,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (89 of 99 remaining) [2024-11-09 07:03:17,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (88 of 99 remaining) [2024-11-09 07:03:17,963 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (87 of 99 remaining) [2024-11-09 07:03:17,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (86 of 99 remaining) [2024-11-09 07:03:17,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (85 of 99 remaining) [2024-11-09 07:03:17,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (84 of 99 remaining) [2024-11-09 07:03:17,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (83 of 99 remaining) [2024-11-09 07:03:17,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (82 of 99 remaining) [2024-11-09 07:03:17,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (81 of 99 remaining) [2024-11-09 07:03:17,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (80 of 99 remaining) [2024-11-09 07:03:17,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (79 of 99 remaining) [2024-11-09 07:03:17,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (78 of 99 remaining) [2024-11-09 07:03:17,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (77 of 99 remaining) [2024-11-09 07:03:17,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (76 of 99 remaining) [2024-11-09 07:03:17,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (75 of 99 remaining) [2024-11-09 07:03:17,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (74 of 99 remaining) [2024-11-09 07:03:17,965 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (73 of 99 remaining) [2024-11-09 07:03:17,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (72 of 99 remaining) [2024-11-09 07:03:17,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (71 of 99 remaining) [2024-11-09 07:03:17,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (70 of 99 remaining) [2024-11-09 07:03:17,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (69 of 99 remaining) [2024-11-09 07:03:17,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (68 of 99 remaining) [2024-11-09 07:03:17,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (67 of 99 remaining) [2024-11-09 07:03:17,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (66 of 99 remaining) [2024-11-09 07:03:17,966 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (65 of 99 remaining) [2024-11-09 07:03:17,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (64 of 99 remaining) [2024-11-09 07:03:17,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (63 of 99 remaining) [2024-11-09 07:03:17,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (62 of 99 remaining) [2024-11-09 07:03:17,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (61 of 99 remaining) [2024-11-09 07:03:17,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (60 of 99 remaining) [2024-11-09 07:03:17,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (59 of 99 remaining) [2024-11-09 07:03:17,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (58 of 99 remaining) [2024-11-09 07:03:17,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (57 of 99 remaining) [2024-11-09 07:03:17,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (56 of 99 remaining) [2024-11-09 07:03:17,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (55 of 99 remaining) [2024-11-09 07:03:17,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (54 of 99 remaining) [2024-11-09 07:03:17,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 99 remaining) [2024-11-09 07:03:17,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 99 remaining) [2024-11-09 07:03:17,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (51 of 99 remaining) [2024-11-09 07:03:17,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (50 of 99 remaining) [2024-11-09 07:03:17,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (49 of 99 remaining) [2024-11-09 07:03:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (48 of 99 remaining) [2024-11-09 07:03:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (47 of 99 remaining) [2024-11-09 07:03:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (46 of 99 remaining) [2024-11-09 07:03:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 99 remaining) [2024-11-09 07:03:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 99 remaining) [2024-11-09 07:03:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (43 of 99 remaining) [2024-11-09 07:03:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 99 remaining) [2024-11-09 07:03:17,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (41 of 99 remaining) [2024-11-09 07:03:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (40 of 99 remaining) [2024-11-09 07:03:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (39 of 99 remaining) [2024-11-09 07:03:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (38 of 99 remaining) [2024-11-09 07:03:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (37 of 99 remaining) [2024-11-09 07:03:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (36 of 99 remaining) [2024-11-09 07:03:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 99 remaining) [2024-11-09 07:03:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 99 remaining) [2024-11-09 07:03:17,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 99 remaining) [2024-11-09 07:03:17,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 99 remaining) [2024-11-09 07:03:17,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (31 of 99 remaining) [2024-11-09 07:03:17,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (30 of 99 remaining) [2024-11-09 07:03:17,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (29 of 99 remaining) [2024-11-09 07:03:17,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (28 of 99 remaining) [2024-11-09 07:03:17,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (27 of 99 remaining) [2024-11-09 07:03:17,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (26 of 99 remaining) [2024-11-09 07:03:17,971 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (25 of 99 remaining) [2024-11-09 07:03:17,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (24 of 99 remaining) [2024-11-09 07:03:17,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 99 remaining) [2024-11-09 07:03:17,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 99 remaining) [2024-11-09 07:03:17,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (21 of 99 remaining) [2024-11-09 07:03:17,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (20 of 99 remaining) [2024-11-09 07:03:17,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (19 of 99 remaining) [2024-11-09 07:03:17,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 99 remaining) [2024-11-09 07:03:17,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (17 of 99 remaining) [2024-11-09 07:03:17,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (16 of 99 remaining) [2024-11-09 07:03:17,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (15 of 99 remaining) [2024-11-09 07:03:17,972 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (14 of 99 remaining) [2024-11-09 07:03:17,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (13 of 99 remaining) [2024-11-09 07:03:17,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (12 of 99 remaining) [2024-11-09 07:03:17,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (11 of 99 remaining) [2024-11-09 07:03:17,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (10 of 99 remaining) [2024-11-09 07:03:17,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (9 of 99 remaining) [2024-11-09 07:03:17,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (8 of 99 remaining) [2024-11-09 07:03:17,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (7 of 99 remaining) [2024-11-09 07:03:17,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (6 of 99 remaining) [2024-11-09 07:03:17,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err30ASSERT_VIOLATIONDATA_RACE (5 of 99 remaining) [2024-11-09 07:03:17,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err31ASSERT_VIOLATIONDATA_RACE (4 of 99 remaining) [2024-11-09 07:03:17,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err32ASSERT_VIOLATIONDATA_RACE (3 of 99 remaining) [2024-11-09 07:03:17,973 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err33ASSERT_VIOLATIONDATA_RACE (2 of 99 remaining) [2024-11-09 07:03:17,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err34ASSERT_VIOLATIONDATA_RACE (1 of 99 remaining) [2024-11-09 07:03:17,974 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err35ASSERT_VIOLATIONDATA_RACE (0 of 99 remaining) [2024-11-09 07:03:17,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:03:17,974 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] [2024-11-09 07:03:17,980 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 07:03:17,981 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:03:17,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:03:17 BasicIcfg [2024-11-09 07:03:17,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:03:17,986 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:03:17,986 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:03:17,987 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:03:17,987 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:03:09" (3/4) ... [2024-11-09 07:03:17,988 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:03:17,992 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 07:03:17,992 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 07:03:17,996 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-09 07:03:17,997 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:03:17,997 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 07:03:17,997 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:03:18,092 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:03:18,093 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:03:18,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:03:18,093 INFO L158 Benchmark]: Toolchain (without parser) took 9952.72ms. Allocated memory was 146.8MB in the beginning and 348.1MB in the end (delta: 201.3MB). Free memory was 94.1MB in the beginning and 252.4MB in the end (delta: -158.3MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2024-11-09 07:03:18,094 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 146.8MB. Free memory was 110.5MB in the beginning and 110.4MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:03:18,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.92ms. Allocated memory is still 146.8MB. Free memory was 93.7MB in the beginning and 79.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 07:03:18,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.20ms. Allocated memory is still 146.8MB. Free memory was 79.0MB in the beginning and 76.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:03:18,094 INFO L158 Benchmark]: Boogie Preprocessor took 58.40ms. Allocated memory is still 146.8MB. Free memory was 76.1MB in the beginning and 73.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:03:18,095 INFO L158 Benchmark]: RCFGBuilder took 839.16ms. Allocated memory is still 146.8MB. Free memory was 73.2MB in the beginning and 96.5MB in the end (delta: -23.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-11-09 07:03:18,095 INFO L158 Benchmark]: TraceAbstraction took 8526.85ms. Allocated memory was 146.8MB in the beginning and 348.1MB in the end (delta: 201.3MB). Free memory was 95.8MB in the beginning and 257.7MB in the end (delta: -161.9MB). Peak memory consumption was 192.4MB. Max. memory is 16.1GB. [2024-11-09 07:03:18,095 INFO L158 Benchmark]: Witness Printer took 106.66ms. Allocated memory is still 348.1MB. Free memory was 257.7MB in the beginning and 252.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:03:18,097 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.22ms. Allocated memory is still 146.8MB. Free memory was 110.5MB in the beginning and 110.4MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.92ms. Allocated memory is still 146.8MB. Free memory was 93.7MB in the beginning and 79.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.20ms. Allocated memory is still 146.8MB. Free memory was 79.0MB in the beginning and 76.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.40ms. Allocated memory is still 146.8MB. Free memory was 76.1MB in the beginning and 73.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 839.16ms. Allocated memory is still 146.8MB. Free memory was 73.2MB in the beginning and 96.5MB in the end (delta: -23.3MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8526.85ms. Allocated memory was 146.8MB in the beginning and 348.1MB in the end (delta: 201.3MB). Free memory was 95.8MB in the beginning and 257.7MB in the end (delta: -161.9MB). Peak memory consumption was 192.4MB. Max. memory is 16.1GB. * Witness Printer took 106.66ms. Allocated memory is still 348.1MB. Free memory was 257.7MB in the beginning and 252.4MB 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: 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: 67]: 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: 69]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 695 locations, 99 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: 8.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1726 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 734 mSDsluCounter, 117 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1871 IncrementalHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 297 mSolverCounterUnsat, 95 mSDtfsCounter, 1871 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=852occurred in iteration=0, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2090 NumberOfCodeBlocks, 2090 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2071 ConstructedInterpolants, 0 QuantifiedInterpolants, 2790 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 53 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:03:18,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE