./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/array-eq-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f 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/array-eq-symm.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 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:35:50,030 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:35:50,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:35:50,104 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:35:50,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:35:50,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:35:50,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:35:50,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:35:50,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:35:50,152 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:35:50,153 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:35:50,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:35:50,154 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:35:50,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:35:50,156 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:35:50,156 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:35:50,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:35:50,157 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:35:50,157 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:35:50,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:35:50,158 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:35:50,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:35:50,160 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:35:50,160 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:35:50,160 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:35:50,160 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:35:50,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:35:50,161 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:35:50,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:35:50,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:35:50,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:35:50,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:35:50,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:35:50,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:35:50,163 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:35:50,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:35:50,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:35:50,164 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:35:50,164 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:35:50,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:35:50,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:35:50,166 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 -> 6897befed0dbbae24492a1e82d50fcd0be6b3857b241d882a904d02a513d7a6d [2024-11-12 12:35:50,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:35:50,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:35:50,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:35:50,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:35:50,455 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:35:50,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2024-11-12 12:35:51,927 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:35:52,113 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:35:52,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-symm.wvr.c [2024-11-12 12:35:52,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a1fad12/9c88cd837f1f4a5593ea1f699425a45b/FLAG6e3129924 [2024-11-12 12:35:52,496 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56a1fad12/9c88cd837f1f4a5593ea1f699425a45b [2024-11-12 12:35:52,498 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:35:52,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:35:52,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:35:52,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:35:52,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:35:52,507 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:35:52" (1/1) ... [2024-11-12 12:35:52,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40551cf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:35:52, skipping insertion in model container [2024-11-12 12:35:52,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:35:52" (1/1) ... [2024-11-12 12:35:52,529 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:35:52,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:35:52,762 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:35:52,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:35:52,804 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:35:52,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:35:52 WrapperNode [2024-11-12 12:35:52,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:35:52,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:35:52,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:35:52,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:35:52,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:35:52" (1/1) ... [2024-11-12 12:35:52,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:35:52" (1/1) ... [2024-11-12 12:35:52,852 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 145 [2024-11-12 12:35:52,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:35:52,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:35:52,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:35:52,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:35:52,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:35:52" (1/1) ... [2024-11-12 12:35:52,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:35:52" (1/1) ... [2024-11-12 12:35:52,868 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:35:52" (1/1) ... [2024-11-12 12:35:52,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:35:52" (1/1) ... [2024-11-12 12:35:52,884 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:35:52" (1/1) ... [2024-11-12 12:35:52,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:35:52" (1/1) ... [2024-11-12 12:35:52,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:35:52" (1/1) ... [2024-11-12 12:35:52,891 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:35:52" (1/1) ... [2024-11-12 12:35:52,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:35:52,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:35:52,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:35:52,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:35:52,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:35:52" (1/1) ... [2024-11-12 12:35:52,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:35:52,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:35:52,935 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-12 12:35:52,940 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-12 12:35:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:35:52,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 12:35:52,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 12:35:52,990 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 12:35:52,990 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 12:35:52,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:35:52,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:35:52,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:35:52,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:35:52,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:35:52,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:35:52,993 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:35:53,108 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:35:53,111 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:35:53,594 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:35:53,597 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:35:53,625 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:35:53,626 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-12 12:35:53,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:35:53 BoogieIcfgContainer [2024-11-12 12:35:53,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:35:53,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:35:53,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:35:53,633 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:35:53,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:35:52" (1/3) ... [2024-11-12 12:35:53,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15dfa094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:35:53, skipping insertion in model container [2024-11-12 12:35:53,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:35:52" (2/3) ... [2024-11-12 12:35:53,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15dfa094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:35:53, skipping insertion in model container [2024-11-12 12:35:53,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:35:53" (3/3) ... [2024-11-12 12:35:53,636 INFO L112 eAbstractionObserver]: Analyzing ICFG array-eq-symm.wvr.c [2024-11-12 12:35:53,655 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:35:53,656 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2024-11-12 12:35:53,656 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:35:53,775 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 12:35:53,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 310 places, 320 transitions, 654 flow [2024-11-12 12:35:53,974 INFO L124 PetriNetUnfolderBase]: 17/318 cut-off events. [2024-11-12 12:35:53,975 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 12:35:53,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 318 events. 17/318 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 537 event pairs, 0 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 226. Up to 3 conditions per place. [2024-11-12 12:35:53,987 INFO L82 GeneralOperation]: Start removeDead. Operand has 310 places, 320 transitions, 654 flow [2024-11-12 12:35:53,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 292 places, 301 transitions, 614 flow [2024-11-12 12:35:54,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:35:54,023 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;@59dfeab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:35:54,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2024-11-12 12:35:54,031 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:35:54,032 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-11-12 12:35:54,032 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:35:54,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:54,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:35:54,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:54,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash -729778242, now seen corresponding path program 1 times [2024-11-12 12:35:54,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:54,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969859172] [2024-11-12 12:35:54,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:54,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:54,237 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-12 12:35:54,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:54,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969859172] [2024-11-12 12:35:54,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969859172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:54,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:54,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:35:54,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212335508] [2024-11-12 12:35:54,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:54,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:35:54,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:54,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:35:54,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:35:54,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 320 [2024-11-12 12:35:54,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 301 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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-12 12:35:54,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:54,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 320 [2024-11-12 12:35:54,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:54,455 INFO L124 PetriNetUnfolderBase]: 17/428 cut-off events. [2024-11-12 12:35:54,456 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-12 12:35:54,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 428 events. 17/428 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1193 event pairs, 3 based on Foata normal form. 14/366 useless extension candidates. Maximal degree in co-relation 287. Up to 19 conditions per place. [2024-11-12 12:35:54,461 INFO L140 encePairwiseOnDemand]: 309/320 looper letters, 10 selfloop transitions, 2 changer transitions 4/292 dead transitions. [2024-11-12 12:35:54,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 292 transitions, 620 flow [2024-11-12 12:35:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:35:54,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:35:54,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 909 transitions. [2024-11-12 12:35:54,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.946875 [2024-11-12 12:35:54,486 INFO L175 Difference]: Start difference. First operand has 292 places, 301 transitions, 614 flow. Second operand 3 states and 909 transitions. [2024-11-12 12:35:54,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 292 transitions, 620 flow [2024-11-12 12:35:54,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 292 transitions, 612 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 12:35:54,499 INFO L231 Difference]: Finished difference. Result has 289 places, 288 transitions, 584 flow [2024-11-12 12:35:54,502 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=289, PETRI_TRANSITIONS=288} [2024-11-12 12:35:54,505 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -3 predicate places. [2024-11-12 12:35:54,506 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 288 transitions, 584 flow [2024-11-12 12:35:54,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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-12 12:35:54,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:54,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:35:54,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:35:54,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:54,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1256530651, now seen corresponding path program 1 times [2024-11-12 12:35:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:54,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449705233] [2024-11-12 12:35:54,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:54,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:54,578 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-12 12:35:54,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:54,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449705233] [2024-11-12 12:35:54,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449705233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:54,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:54,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:35:54,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96595830] [2024-11-12 12:35:54,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:54,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:35:54,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:54,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:35:54,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:35:54,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 320 [2024-11-12 12:35:54,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 288 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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-12 12:35:54,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:54,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 320 [2024-11-12 12:35:54,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:54,692 INFO L124 PetriNetUnfolderBase]: 17/425 cut-off events. [2024-11-12 12:35:54,694 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-12 12:35:54,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 425 events. 17/425 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1139 event pairs, 3 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 422. Up to 18 conditions per place. [2024-11-12 12:35:54,701 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 10 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2024-11-12 12:35:54,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 287 transitions, 606 flow [2024-11-12 12:35:54,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:35:54,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:35:54,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 901 transitions. [2024-11-12 12:35:54,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9385416666666667 [2024-11-12 12:35:54,703 INFO L175 Difference]: Start difference. First operand has 289 places, 288 transitions, 584 flow. Second operand 3 states and 901 transitions. [2024-11-12 12:35:54,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 287 transitions, 606 flow [2024-11-12 12:35:54,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 287 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:35:54,712 INFO L231 Difference]: Finished difference. Result has 284 places, 287 transitions, 582 flow [2024-11-12 12:35:54,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=284, PETRI_TRANSITIONS=287} [2024-11-12 12:35:54,715 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -8 predicate places. [2024-11-12 12:35:54,715 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 287 transitions, 582 flow [2024-11-12 12:35:54,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 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-12 12:35:54,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:54,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:35:54,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:35:54,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:54,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:54,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1013617658, now seen corresponding path program 1 times [2024-11-12 12:35:54,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:54,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606752144] [2024-11-12 12:35:54,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:54,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:54,787 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-12 12:35:54,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:54,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606752144] [2024-11-12 12:35:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606752144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:54,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:54,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:35:54,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957740823] [2024-11-12 12:35:54,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:54,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:35:54,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:54,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:35:54,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:35:54,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 320 [2024-11-12 12:35:54,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 287 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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-12 12:35:54,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:54,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 320 [2024-11-12 12:35:54,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:54,936 INFO L124 PetriNetUnfolderBase]: 33/617 cut-off events. [2024-11-12 12:35:54,936 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 12:35:54,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 617 events. 33/617 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2319 event pairs, 8 based on Foata normal form. 0/505 useless extension candidates. Maximal degree in co-relation 622. Up to 33 conditions per place. [2024-11-12 12:35:54,943 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2024-11-12 12:35:54,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 284 transitions, 598 flow [2024-11-12 12:35:54,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:35:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:35:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2024-11-12 12:35:54,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9395833333333333 [2024-11-12 12:35:54,947 INFO L175 Difference]: Start difference. First operand has 284 places, 287 transitions, 582 flow. Second operand 3 states and 902 transitions. [2024-11-12 12:35:54,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 284 transitions, 598 flow [2024-11-12 12:35:54,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 284 transitions, 594 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:35:54,952 INFO L231 Difference]: Finished difference. Result has 281 places, 284 transitions, 574 flow [2024-11-12 12:35:54,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=281, PETRI_TRANSITIONS=284} [2024-11-12 12:35:54,954 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -11 predicate places. [2024-11-12 12:35:54,954 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 284 transitions, 574 flow [2024-11-12 12:35:54,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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-12 12:35:54,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:54,956 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:35:54,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:35:54,956 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:54,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:54,957 INFO L85 PathProgramCache]: Analyzing trace with hash 105830857, now seen corresponding path program 1 times [2024-11-12 12:35:54,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:54,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750182869] [2024-11-12 12:35:54,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:55,646 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-12 12:35:55,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:55,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750182869] [2024-11-12 12:35:55,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750182869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:55,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:55,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:35:55,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028407397] [2024-11-12 12:35:55,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:55,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:35:55,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:55,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:35:55,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:35:55,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 320 [2024-11-12 12:35:55,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 284 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 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-12 12:35:55,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:55,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 320 [2024-11-12 12:35:55,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:56,190 INFO L124 PetriNetUnfolderBase]: 146/1249 cut-off events. [2024-11-12 12:35:56,190 INFO L125 PetriNetUnfolderBase]: For 19/20 co-relation queries the response was YES. [2024-11-12 12:35:56,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1496 conditions, 1249 events. 146/1249 cut-off events. For 19/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7405 event pairs, 80 based on Foata normal form. 0/1005 useless extension candidates. Maximal degree in co-relation 1459. Up to 224 conditions per place. [2024-11-12 12:35:56,203 INFO L140 encePairwiseOnDemand]: 308/320 looper letters, 36 selfloop transitions, 10 changer transitions 0/282 dead transitions. [2024-11-12 12:35:56,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 282 transitions, 662 flow [2024-11-12 12:35:56,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:35:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:35:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1620 transitions. [2024-11-12 12:35:56,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.84375 [2024-11-12 12:35:56,209 INFO L175 Difference]: Start difference. First operand has 281 places, 284 transitions, 574 flow. Second operand 6 states and 1620 transitions. [2024-11-12 12:35:56,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 282 transitions, 662 flow [2024-11-12 12:35:56,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 282 transitions, 661 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:35:56,216 INFO L231 Difference]: Finished difference. Result has 283 places, 282 transitions, 589 flow [2024-11-12 12:35:56,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=589, PETRI_PLACES=283, PETRI_TRANSITIONS=282} [2024-11-12 12:35:56,219 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -9 predicate places. [2024-11-12 12:35:56,219 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 282 transitions, 589 flow [2024-11-12 12:35:56,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 263.5) internal successors, (1581), 6 states have internal predecessors, (1581), 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-12 12:35:56,220 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:56,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:35:56,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:35:56,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:56,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:56,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1814160356, now seen corresponding path program 1 times [2024-11-12 12:35:56,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:56,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940010800] [2024-11-12 12:35:56,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:56,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:35:56,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:56,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940010800] [2024-11-12 12:35:56,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940010800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:56,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:56,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:35:56,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030622878] [2024-11-12 12:35:56,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:56,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:35:56,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:56,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:35:56,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:35:56,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 320 [2024-11-12 12:35:56,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 282 transitions, 589 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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-12 12:35:56,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:56,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 320 [2024-11-12 12:35:56,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:56,342 INFO L124 PetriNetUnfolderBase]: 14/353 cut-off events. [2024-11-12 12:35:56,342 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-11-12 12:35:56,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 353 events. 14/353 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 851 event pairs, 3 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 354. Up to 16 conditions per place. [2024-11-12 12:35:56,345 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 9 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2024-11-12 12:35:56,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 281 transitions, 609 flow [2024-11-12 12:35:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:35:56,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:35:56,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2024-11-12 12:35:56,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.940625 [2024-11-12 12:35:56,347 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 589 flow. Second operand 3 states and 903 transitions. [2024-11-12 12:35:56,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 281 transitions, 609 flow [2024-11-12 12:35:56,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 281 transitions, 589 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:35:56,352 INFO L231 Difference]: Finished difference. Result has 279 places, 281 transitions, 571 flow [2024-11-12 12:35:56,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=279, PETRI_TRANSITIONS=281} [2024-11-12 12:35:56,353 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -13 predicate places. [2024-11-12 12:35:56,353 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 281 transitions, 571 flow [2024-11-12 12:35:56,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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-12 12:35:56,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:56,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:35:56,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:35:56,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:56,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:56,355 INFO L85 PathProgramCache]: Analyzing trace with hash 2916052, now seen corresponding path program 1 times [2024-11-12 12:35:56,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:56,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494554487] [2024-11-12 12:35:56,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:56,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:56,387 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-12 12:35:56,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:56,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494554487] [2024-11-12 12:35:56,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494554487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:56,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:56,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:35:56,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187104676] [2024-11-12 12:35:56,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:56,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:35:56,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:56,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:35:56,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:35:56,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 320 [2024-11-12 12:35:56,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 281 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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-12 12:35:56,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:56,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 320 [2024-11-12 12:35:56,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:56,473 INFO L124 PetriNetUnfolderBase]: 35/610 cut-off events. [2024-11-12 12:35:56,473 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-11-12 12:35:56,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 655 conditions, 610 events. 35/610 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2457 event pairs, 8 based on Foata normal form. 0/510 useless extension candidates. Maximal degree in co-relation 617. Up to 34 conditions per place. [2024-11-12 12:35:56,478 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 1 changer transitions 0/278 dead transitions. [2024-11-12 12:35:56,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 278 transitions, 587 flow [2024-11-12 12:35:56,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:35:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:35:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 902 transitions. [2024-11-12 12:35:56,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9395833333333333 [2024-11-12 12:35:56,481 INFO L175 Difference]: Start difference. First operand has 279 places, 281 transitions, 571 flow. Second operand 3 states and 902 transitions. [2024-11-12 12:35:56,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 278 transitions, 587 flow [2024-11-12 12:35:56,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 278 transitions, 583 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:35:56,486 INFO L231 Difference]: Finished difference. Result has 276 places, 278 transitions, 563 flow [2024-11-12 12:35:56,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=276, PETRI_TRANSITIONS=278} [2024-11-12 12:35:56,487 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -16 predicate places. [2024-11-12 12:35:56,488 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 278 transitions, 563 flow [2024-11-12 12:35:56,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.0) internal successors, (891), 3 states have internal predecessors, (891), 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-12 12:35:56,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:56,489 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:35:56,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:35:56,489 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:56,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1117541342, now seen corresponding path program 1 times [2024-11-12 12:35:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:56,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977472065] [2024-11-12 12:35:56,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:56,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:56,536 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-12 12:35:56,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:56,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977472065] [2024-11-12 12:35:56,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977472065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:56,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:56,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:35:56,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132951288] [2024-11-12 12:35:56,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:56,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:35:56,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:56,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:35:56,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:35:56,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 320 [2024-11-12 12:35:56,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 278 transitions, 563 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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-12 12:35:56,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:56,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 320 [2024-11-12 12:35:56,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:56,595 INFO L124 PetriNetUnfolderBase]: 14/348 cut-off events. [2024-11-12 12:35:56,596 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-11-12 12:35:56,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 348 events. 14/348 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 738 event pairs, 3 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 335. Up to 16 conditions per place. [2024-11-12 12:35:56,599 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 9 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2024-11-12 12:35:56,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 277 transitions, 583 flow [2024-11-12 12:35:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:35:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:35:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 903 transitions. [2024-11-12 12:35:56,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.940625 [2024-11-12 12:35:56,601 INFO L175 Difference]: Start difference. First operand has 276 places, 278 transitions, 563 flow. Second operand 3 states and 903 transitions. [2024-11-12 12:35:56,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 277 transitions, 583 flow [2024-11-12 12:35:56,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 277 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:35:56,606 INFO L231 Difference]: Finished difference. Result has 276 places, 277 transitions, 564 flow [2024-11-12 12:35:56,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=276, PETRI_TRANSITIONS=277} [2024-11-12 12:35:56,607 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -16 predicate places. [2024-11-12 12:35:56,607 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 277 transitions, 564 flow [2024-11-12 12:35:56,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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-12 12:35:56,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:56,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:35:56,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:35:56,609 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:56,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:56,609 INFO L85 PathProgramCache]: Analyzing trace with hash 226025314, now seen corresponding path program 1 times [2024-11-12 12:35:56,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:56,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638578217] [2024-11-12 12:35:56,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:56,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:56,664 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-12 12:35:56,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:56,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638578217] [2024-11-12 12:35:56,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638578217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:56,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:56,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:35:56,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392854218] [2024-11-12 12:35:56,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:56,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:35:56,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:56,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:35:56,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:35:56,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 320 [2024-11-12 12:35:56,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 277 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 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-12 12:35:56,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:56,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 320 [2024-11-12 12:35:56,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:56,740 INFO L124 PetriNetUnfolderBase]: 22/341 cut-off events. [2024-11-12 12:35:56,741 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:35:56,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 341 events. 22/341 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 867 event pairs, 1 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 364. Up to 35 conditions per place. [2024-11-12 12:35:56,743 INFO L140 encePairwiseOnDemand]: 312/320 looper letters, 16 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2024-11-12 12:35:56,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 272 transitions, 591 flow [2024-11-12 12:35:56,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:35:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:35:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 885 transitions. [2024-11-12 12:35:56,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.921875 [2024-11-12 12:35:56,746 INFO L175 Difference]: Start difference. First operand has 276 places, 277 transitions, 564 flow. Second operand 3 states and 885 transitions. [2024-11-12 12:35:56,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 272 transitions, 591 flow [2024-11-12 12:35:56,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 272 transitions, 587 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:35:56,751 INFO L231 Difference]: Finished difference. Result has 270 places, 271 transitions, 552 flow [2024-11-12 12:35:56,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=270, PETRI_TRANSITIONS=271} [2024-11-12 12:35:56,752 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -22 predicate places. [2024-11-12 12:35:56,752 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 271 transitions, 552 flow [2024-11-12 12:35:56,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.0) internal successors, (864), 3 states have internal predecessors, (864), 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-12 12:35:56,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:56,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:35:56,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:35:56,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:56,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:56,755 INFO L85 PathProgramCache]: Analyzing trace with hash -242011099, now seen corresponding path program 1 times [2024-11-12 12:35:56,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:56,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158685820] [2024-11-12 12:35:56,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:56,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:35:56,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:56,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158685820] [2024-11-12 12:35:56,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158685820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:56,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:56,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:35:56,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264388432] [2024-11-12 12:35:56,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:56,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:35:56,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:56,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:35:56,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:35:56,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 320 [2024-11-12 12:35:56,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 271 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 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-12 12:35:56,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:56,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 320 [2024-11-12 12:35:56,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:56,888 INFO L124 PetriNetUnfolderBase]: 22/335 cut-off events. [2024-11-12 12:35:56,888 INFO L125 PetriNetUnfolderBase]: For 13/14 co-relation queries the response was YES. [2024-11-12 12:35:56,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 335 events. 22/335 cut-off events. For 13/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 885 event pairs, 1 based on Foata normal form. 1/309 useless extension candidates. Maximal degree in co-relation 346. Up to 33 conditions per place. [2024-11-12 12:35:56,890 INFO L140 encePairwiseOnDemand]: 312/320 looper letters, 13 selfloop transitions, 2 changer transitions 4/266 dead transitions. [2024-11-12 12:35:56,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 266 transitions, 577 flow [2024-11-12 12:35:56,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:35:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:35:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2024-11-12 12:35:56,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9208333333333333 [2024-11-12 12:35:56,893 INFO L175 Difference]: Start difference. First operand has 270 places, 271 transitions, 552 flow. Second operand 3 states and 884 transitions. [2024-11-12 12:35:56,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 266 transitions, 577 flow [2024-11-12 12:35:56,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 266 transitions, 573 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:35:56,897 INFO L231 Difference]: Finished difference. Result has 264 places, 261 transitions, 531 flow [2024-11-12 12:35:56,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=264, PETRI_TRANSITIONS=261} [2024-11-12 12:35:56,898 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -28 predicate places. [2024-11-12 12:35:56,899 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 261 transitions, 531 flow [2024-11-12 12:35:56,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 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-12 12:35:56,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:56,900 INFO L206 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-12 12:35:56,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:35:56,900 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:56,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:56,901 INFO L85 PathProgramCache]: Analyzing trace with hash -161525969, now seen corresponding path program 1 times [2024-11-12 12:35:56,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:56,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961045088] [2024-11-12 12:35:56,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:56,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:56,940 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-12 12:35:56,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:56,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961045088] [2024-11-12 12:35:56,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961045088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:56,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:56,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:35:56,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490333438] [2024-11-12 12:35:56,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:56,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:35:56,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:56,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:35:56,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:35:56,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 320 [2024-11-12 12:35:56,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 261 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 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-12 12:35:56,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:56,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 320 [2024-11-12 12:35:56,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:57,002 INFO L124 PetriNetUnfolderBase]: 22/391 cut-off events. [2024-11-12 12:35:57,003 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:35:57,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440 conditions, 391 events. 22/391 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1024 event pairs, 6 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 403. Up to 23 conditions per place. [2024-11-12 12:35:57,006 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 3 changer transitions 0/263 dead transitions. [2024-11-12 12:35:57,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 263 transitions, 562 flow [2024-11-12 12:35:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:35:57,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:35:57,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2024-11-12 12:35:57,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9458333333333333 [2024-11-12 12:35:57,009 INFO L175 Difference]: Start difference. First operand has 264 places, 261 transitions, 531 flow. Second operand 3 states and 908 transitions. [2024-11-12 12:35:57,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 263 transitions, 562 flow [2024-11-12 12:35:57,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 263 transitions, 558 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:35:57,015 INFO L231 Difference]: Finished difference. Result has 262 places, 262 transitions, 545 flow [2024-11-12 12:35:57,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=545, PETRI_PLACES=262, PETRI_TRANSITIONS=262} [2024-11-12 12:35:57,017 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -30 predicate places. [2024-11-12 12:35:57,018 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 262 transitions, 545 flow [2024-11-12 12:35:57,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.6666666666667) internal successors, (899), 3 states have internal predecessors, (899), 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-12 12:35:57,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:57,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:35:57,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:35:57,019 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:57,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:57,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1390540956, now seen corresponding path program 1 times [2024-11-12 12:35:57,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:57,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661823454] [2024-11-12 12:35:57,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:57,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:57,063 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-12 12:35:57,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:57,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661823454] [2024-11-12 12:35:57,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661823454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:57,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:57,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:35:57,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424884218] [2024-11-12 12:35:57,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:57,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:35:57,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:57,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:35:57,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:35:57,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 320 [2024-11-12 12:35:57,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 262 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 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-12 12:35:57,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:57,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 320 [2024-11-12 12:35:57,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:57,139 INFO L124 PetriNetUnfolderBase]: 37/614 cut-off events. [2024-11-12 12:35:57,139 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-11-12 12:35:57,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 614 events. 37/614 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2196 event pairs, 2 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 654. Up to 32 conditions per place. [2024-11-12 12:35:57,144 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2024-11-12 12:35:57,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 264 transitions, 575 flow [2024-11-12 12:35:57,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:35:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:35:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2024-11-12 12:35:57,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9489583333333333 [2024-11-12 12:35:57,147 INFO L175 Difference]: Start difference. First operand has 262 places, 262 transitions, 545 flow. Second operand 3 states and 911 transitions. [2024-11-12 12:35:57,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 264 transitions, 575 flow [2024-11-12 12:35:57,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 264 transitions, 569 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:35:57,152 INFO L231 Difference]: Finished difference. Result has 261 places, 262 transitions, 549 flow [2024-11-12 12:35:57,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=549, PETRI_PLACES=261, PETRI_TRANSITIONS=262} [2024-11-12 12:35:57,153 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -31 predicate places. [2024-11-12 12:35:57,153 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 262 transitions, 549 flow [2024-11-12 12:35:57,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.3333333333333) internal successors, (901), 3 states have internal predecessors, (901), 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-12 12:35:57,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:57,154 INFO L206 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-12 12:35:57,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:35:57,154 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:57,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:57,155 INFO L85 PathProgramCache]: Analyzing trace with hash 56279666, now seen corresponding path program 1 times [2024-11-12 12:35:57,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:57,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372173934] [2024-11-12 12:35:57,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:57,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:57,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:35:57,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:57,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372173934] [2024-11-12 12:35:57,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372173934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:57,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:57,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:35:57,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335505527] [2024-11-12 12:35:57,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:57,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:35:57,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:57,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:35:57,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:35:57,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 298 out of 320 [2024-11-12 12:35:57,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 262 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 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-12 12:35:57,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:57,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 298 of 320 [2024-11-12 12:35:57,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:57,270 INFO L124 PetriNetUnfolderBase]: 50/492 cut-off events. [2024-11-12 12:35:57,270 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2024-11-12 12:35:57,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 492 events. 50/492 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1497 event pairs, 11 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 565. Up to 58 conditions per place. [2024-11-12 12:35:57,273 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 9 selfloop transitions, 3 changer transitions 1/264 dead transitions. [2024-11-12 12:35:57,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 264 transitions, 580 flow [2024-11-12 12:35:57,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:35:57,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:35:57,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 908 transitions. [2024-11-12 12:35:57,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9458333333333333 [2024-11-12 12:35:57,276 INFO L175 Difference]: Start difference. First operand has 261 places, 262 transitions, 549 flow. Second operand 3 states and 908 transitions. [2024-11-12 12:35:57,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 264 transitions, 580 flow [2024-11-12 12:35:57,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 264 transitions, 580 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:35:57,280 INFO L231 Difference]: Finished difference. Result has 265 places, 263 transitions, 567 flow [2024-11-12 12:35:57,280 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=567, PETRI_PLACES=265, PETRI_TRANSITIONS=263} [2024-11-12 12:35:57,281 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -27 predicate places. [2024-11-12 12:35:57,281 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 263 transitions, 567 flow [2024-11-12 12:35:57,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.0) internal successors, (900), 3 states have internal predecessors, (900), 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-12 12:35:57,282 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:57,282 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:35:57,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:35:57,282 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:57,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash -566577476, now seen corresponding path program 1 times [2024-11-12 12:35:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:57,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556332684] [2024-11-12 12:35:57,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:57,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:57,318 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-12 12:35:57,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:57,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556332684] [2024-11-12 12:35:57,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556332684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:57,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:57,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:35:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213537577] [2024-11-12 12:35:57,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:57,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:35:57,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:57,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:35:57,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:35:57,330 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 320 [2024-11-12 12:35:57,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 263 transitions, 567 flow. Second operand has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 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-12 12:35:57,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:57,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 320 [2024-11-12 12:35:57,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:57,399 INFO L124 PetriNetUnfolderBase]: 45/676 cut-off events. [2024-11-12 12:35:57,399 INFO L125 PetriNetUnfolderBase]: For 18/19 co-relation queries the response was YES. [2024-11-12 12:35:57,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811 conditions, 676 events. 45/676 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2660 event pairs, 3 based on Foata normal form. 0/630 useless extension candidates. Maximal degree in co-relation 771. Up to 38 conditions per place. [2024-11-12 12:35:57,404 INFO L140 encePairwiseOnDemand]: 316/320 looper letters, 10 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-11-12 12:35:57,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 265 transitions, 597 flow [2024-11-12 12:35:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:35:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:35:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 911 transitions. [2024-11-12 12:35:57,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9489583333333333 [2024-11-12 12:35:57,407 INFO L175 Difference]: Start difference. First operand has 265 places, 263 transitions, 567 flow. Second operand 3 states and 911 transitions. [2024-11-12 12:35:57,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 265 transitions, 597 flow [2024-11-12 12:35:57,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 265 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:35:57,411 INFO L231 Difference]: Finished difference. Result has 264 places, 263 transitions, 571 flow [2024-11-12 12:35:57,412 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=264, PETRI_TRANSITIONS=263} [2024-11-12 12:35:57,412 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -28 predicate places. [2024-11-12 12:35:57,412 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 263 transitions, 571 flow [2024-11-12 12:35:57,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 300.6666666666667) internal successors, (902), 3 states have internal predecessors, (902), 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-12 12:35:57,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:57,413 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:35:57,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:35:57,414 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:57,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:57,414 INFO L85 PathProgramCache]: Analyzing trace with hash -741705406, now seen corresponding path program 1 times [2024-11-12 12:35:57,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:57,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760044161] [2024-11-12 12:35:57,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:57,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:57,625 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-12 12:35:57,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:57,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760044161] [2024-11-12 12:35:57,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760044161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:57,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:57,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 12:35:57,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485833082] [2024-11-12 12:35:57,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:57,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:35:57,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:57,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:35:57,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:35:57,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 320 [2024-11-12 12:35:57,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 263 transitions, 571 flow. Second operand has 8 states, 8 states have (on average 279.125) internal successors, (2233), 8 states have internal predecessors, (2233), 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-12 12:35:57,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:57,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 320 [2024-11-12 12:35:57,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:58,211 INFO L124 PetriNetUnfolderBase]: 64/1040 cut-off events. [2024-11-12 12:35:58,212 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-12 12:35:58,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 1040 events. 64/1040 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4300 event pairs, 8 based on Foata normal form. 2/977 useless extension candidates. Maximal degree in co-relation 1288. Up to 45 conditions per place. [2024-11-12 12:35:58,220 INFO L140 encePairwiseOnDemand]: 303/320 looper letters, 50 selfloop transitions, 19 changer transitions 0/298 dead transitions. [2024-11-12 12:35:58,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 298 transitions, 802 flow [2024-11-12 12:35:58,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 12:35:58,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 12:35:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3381 transitions. [2024-11-12 12:35:58,226 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.88046875 [2024-11-12 12:35:58,226 INFO L175 Difference]: Start difference. First operand has 264 places, 263 transitions, 571 flow. Second operand 12 states and 3381 transitions. [2024-11-12 12:35:58,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 298 transitions, 802 flow [2024-11-12 12:35:58,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 298 transitions, 802 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:35:58,232 INFO L231 Difference]: Finished difference. Result has 280 places, 274 transitions, 678 flow [2024-11-12 12:35:58,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=678, PETRI_PLACES=280, PETRI_TRANSITIONS=274} [2024-11-12 12:35:58,233 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -12 predicate places. [2024-11-12 12:35:58,233 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 274 transitions, 678 flow [2024-11-12 12:35:58,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.125) internal successors, (2233), 8 states have internal predecessors, (2233), 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-12 12:35:58,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:58,234 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:35:58,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:35:58,235 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:58,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:58,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1483188450, now seen corresponding path program 1 times [2024-11-12 12:35:58,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:58,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446442667] [2024-11-12 12:35:58,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:58,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:58,444 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-12 12:35:58,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:58,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446442667] [2024-11-12 12:35:58,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446442667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:58,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:58,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 12:35:58,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127178688] [2024-11-12 12:35:58,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:58,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:35:58,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:58,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:35:58,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:35:58,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 320 [2024-11-12 12:35:58,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 274 transitions, 678 flow. Second operand has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 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-12 12:35:58,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:58,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 320 [2024-11-12 12:35:58,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:59,041 INFO L124 PetriNetUnfolderBase]: 106/1071 cut-off events. [2024-11-12 12:35:59,042 INFO L125 PetriNetUnfolderBase]: For 91/95 co-relation queries the response was YES. [2024-11-12 12:35:59,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1071 events. 106/1071 cut-off events. For 91/95 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5202 event pairs, 25 based on Foata normal form. 0/988 useless extension candidates. Maximal degree in co-relation 1422. Up to 86 conditions per place. [2024-11-12 12:35:59,051 INFO L140 encePairwiseOnDemand]: 303/320 looper letters, 33 selfloop transitions, 13 changer transitions 27/306 dead transitions. [2024-11-12 12:35:59,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 306 transitions, 908 flow [2024-11-12 12:35:59,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 12:35:59,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 12:35:59,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3382 transitions. [2024-11-12 12:35:59,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8807291666666667 [2024-11-12 12:35:59,058 INFO L175 Difference]: Start difference. First operand has 280 places, 274 transitions, 678 flow. Second operand 12 states and 3382 transitions. [2024-11-12 12:35:59,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 306 transitions, 908 flow [2024-11-12 12:35:59,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 306 transitions, 908 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:35:59,066 INFO L231 Difference]: Finished difference. Result has 295 places, 272 transitions, 714 flow [2024-11-12 12:35:59,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=714, PETRI_PLACES=295, PETRI_TRANSITIONS=272} [2024-11-12 12:35:59,068 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, 3 predicate places. [2024-11-12 12:35:59,068 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 272 transitions, 714 flow [2024-11-12 12:35:59,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 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-12 12:35:59,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:59,070 INFO L206 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] [2024-11-12 12:35:59,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:35:59,071 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:59,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:59,071 INFO L85 PathProgramCache]: Analyzing trace with hash -399579792, now seen corresponding path program 1 times [2024-11-12 12:35:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:59,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443911970] [2024-11-12 12:35:59,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:59,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:35:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 12:35:59,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:35:59,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443911970] [2024-11-12 12:35:59,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443911970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:35:59,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:35:59,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 12:35:59,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832387800] [2024-11-12 12:35:59,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:35:59,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:35:59,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:35:59,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:35:59,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:35:59,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 320 [2024-11-12 12:35:59,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 272 transitions, 714 flow. Second operand has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 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-12 12:35:59,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:35:59,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 320 [2024-11-12 12:35:59,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:35:59,886 INFO L124 PetriNetUnfolderBase]: 72/1239 cut-off events. [2024-11-12 12:35:59,887 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2024-11-12 12:35:59,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1747 conditions, 1239 events. 72/1239 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5481 event pairs, 14 based on Foata normal form. 2/1172 useless extension candidates. Maximal degree in co-relation 1683. Up to 57 conditions per place. [2024-11-12 12:35:59,901 INFO L140 encePairwiseOnDemand]: 303/320 looper letters, 44 selfloop transitions, 20 changer transitions 0/297 dead transitions. [2024-11-12 12:35:59,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 297 transitions, 928 flow [2024-11-12 12:35:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 12:35:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 12:35:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3374 transitions. [2024-11-12 12:35:59,907 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8786458333333333 [2024-11-12 12:35:59,907 INFO L175 Difference]: Start difference. First operand has 295 places, 272 transitions, 714 flow. Second operand 12 states and 3374 transitions. [2024-11-12 12:35:59,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 297 transitions, 928 flow [2024-11-12 12:35:59,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 297 transitions, 878 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-11-12 12:35:59,916 INFO L231 Difference]: Finished difference. Result has 290 places, 281 transitions, 780 flow [2024-11-12 12:35:59,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=780, PETRI_PLACES=290, PETRI_TRANSITIONS=281} [2024-11-12 12:35:59,917 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -2 predicate places. [2024-11-12 12:35:59,917 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 281 transitions, 780 flow [2024-11-12 12:35:59,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.25) internal successors, (2234), 8 states have internal predecessors, (2234), 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-12 12:35:59,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:35:59,919 INFO L206 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] [2024-11-12 12:35:59,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 12:35:59,919 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:35:59,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:35:59,920 INFO L85 PathProgramCache]: Analyzing trace with hash 875149968, now seen corresponding path program 1 times [2024-11-12 12:35:59,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:35:59,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004785927] [2024-11-12 12:35:59,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:35:59,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:35:59,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:00,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 12:36:00,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:00,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004785927] [2024-11-12 12:36:00,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004785927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:00,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:00,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 12:36:00,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651164228] [2024-11-12 12:36:00,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:00,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:36:00,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:00,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:36:00,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:36:00,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 320 [2024-11-12 12:36:00,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 281 transitions, 780 flow. Second operand has 8 states, 8 states have (on average 279.375) internal successors, (2235), 8 states have internal predecessors, (2235), 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-12 12:36:00,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:00,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 320 [2024-11-12 12:36:00,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:00,837 INFO L124 PetriNetUnfolderBase]: 102/1027 cut-off events. [2024-11-12 12:36:00,837 INFO L125 PetriNetUnfolderBase]: For 192/196 co-relation queries the response was YES. [2024-11-12 12:36:00,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 1027 events. 102/1027 cut-off events. For 192/196 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4945 event pairs, 24 based on Foata normal form. 2/955 useless extension candidates. Maximal degree in co-relation 1444. Up to 86 conditions per place. [2024-11-12 12:36:00,847 INFO L140 encePairwiseOnDemand]: 303/320 looper letters, 34 selfloop transitions, 13 changer transitions 17/297 dead transitions. [2024-11-12 12:36:00,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 297 transitions, 956 flow [2024-11-12 12:36:00,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 12:36:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-12 12:36:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3371 transitions. [2024-11-12 12:36:00,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778645833333333 [2024-11-12 12:36:00,853 INFO L175 Difference]: Start difference. First operand has 290 places, 281 transitions, 780 flow. Second operand 12 states and 3371 transitions. [2024-11-12 12:36:00,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 297 transitions, 956 flow [2024-11-12 12:36:00,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 297 transitions, 954 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:36:00,861 INFO L231 Difference]: Finished difference. Result has 302 places, 273 transitions, 753 flow [2024-11-12 12:36:00,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=753, PETRI_PLACES=302, PETRI_TRANSITIONS=273} [2024-11-12 12:36:00,862 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, 10 predicate places. [2024-11-12 12:36:00,862 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 273 transitions, 753 flow [2024-11-12 12:36:00,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.375) internal successors, (2235), 8 states have internal predecessors, (2235), 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-12 12:36:00,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:00,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:36:00,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 12:36:00,864 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:36:00,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:00,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1529152956, now seen corresponding path program 1 times [2024-11-12 12:36:00,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:00,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536912293] [2024-11-12 12:36:00,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:00,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 12:36:01,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:01,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536912293] [2024-11-12 12:36:01,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536912293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:01,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:01,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:36:01,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793853392] [2024-11-12 12:36:01,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:01,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:36:01,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:01,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:36:01,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:36:01,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 320 [2024-11-12 12:36:01,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 273 transitions, 753 flow. Second operand has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 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-12 12:36:01,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:01,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 320 [2024-11-12 12:36:01,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:01,807 INFO L124 PetriNetUnfolderBase]: 42/812 cut-off events. [2024-11-12 12:36:01,808 INFO L125 PetriNetUnfolderBase]: For 113/115 co-relation queries the response was YES. [2024-11-12 12:36:01,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 812 events. 42/812 cut-off events. For 113/115 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2604 event pairs, 6 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1066. Up to 35 conditions per place. [2024-11-12 12:36:01,818 INFO L140 encePairwiseOnDemand]: 314/320 looper letters, 20 selfloop transitions, 6 changer transitions 0/277 dead transitions. [2024-11-12 12:36:01,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 277 transitions, 818 flow [2024-11-12 12:36:01,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:36:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:36:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2024-11-12 12:36:01,822 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9135416666666667 [2024-11-12 12:36:01,822 INFO L175 Difference]: Start difference. First operand has 302 places, 273 transitions, 753 flow. Second operand 6 states and 1754 transitions. [2024-11-12 12:36:01,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 277 transitions, 818 flow [2024-11-12 12:36:01,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 277 transitions, 765 flow, removed 5 selfloop flow, removed 16 redundant places. [2024-11-12 12:36:01,827 INFO L231 Difference]: Finished difference. Result has 282 places, 272 transitions, 710 flow [2024-11-12 12:36:01,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=710, PETRI_PLACES=282, PETRI_TRANSITIONS=272} [2024-11-12 12:36:01,828 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -10 predicate places. [2024-11-12 12:36:01,828 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 272 transitions, 710 flow [2024-11-12 12:36:01,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 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-12 12:36:01,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:01,830 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:36:01,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 12:36:01,830 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:36:01,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:01,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1960845212, now seen corresponding path program 1 times [2024-11-12 12:36:01,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:01,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567399814] [2024-11-12 12:36:01,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:01,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:02,298 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 12:36:02,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:02,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567399814] [2024-11-12 12:36:02,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567399814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:02,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:02,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:36:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336377600] [2024-11-12 12:36:02,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:02,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:36:02,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:02,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:36:02,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:36:02,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 320 [2024-11-12 12:36:02,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 272 transitions, 710 flow. Second operand has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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-12 12:36:02,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:02,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 320 [2024-11-12 12:36:02,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:02,747 INFO L124 PetriNetUnfolderBase]: 79/1071 cut-off events. [2024-11-12 12:36:02,747 INFO L125 PetriNetUnfolderBase]: For 139/143 co-relation queries the response was YES. [2024-11-12 12:36:02,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1440 conditions, 1071 events. 79/1071 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4761 event pairs, 12 based on Foata normal form. 0/1009 useless extension candidates. Maximal degree in co-relation 1381. Up to 54 conditions per place. [2024-11-12 12:36:02,759 INFO L140 encePairwiseOnDemand]: 314/320 looper letters, 19 selfloop transitions, 6 changer transitions 0/275 dead transitions. [2024-11-12 12:36:02,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 275 transitions, 770 flow [2024-11-12 12:36:02,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:36:02,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:36:02,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2024-11-12 12:36:02,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130208333333333 [2024-11-12 12:36:02,766 INFO L175 Difference]: Start difference. First operand has 282 places, 272 transitions, 710 flow. Second operand 6 states and 1753 transitions. [2024-11-12 12:36:02,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 275 transitions, 770 flow [2024-11-12 12:36:02,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 275 transitions, 758 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:36:02,772 INFO L231 Difference]: Finished difference. Result has 281 places, 271 transitions, 708 flow [2024-11-12 12:36:02,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=708, PETRI_PLACES=281, PETRI_TRANSITIONS=271} [2024-11-12 12:36:02,773 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -11 predicate places. [2024-11-12 12:36:02,773 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 271 transitions, 708 flow [2024-11-12 12:36:02,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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-12 12:36:02,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:02,774 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:36:02,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 12:36:02,774 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:36:02,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1379084268, now seen corresponding path program 1 times [2024-11-12 12:36:02,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:02,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518500867] [2024-11-12 12:36:02,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:02,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 12:36:03,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:03,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518500867] [2024-11-12 12:36:03,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518500867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:03,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:03,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:36:03,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150300560] [2024-11-12 12:36:03,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:03,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:36:03,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:03,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:36:03,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:36:03,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 320 [2024-11-12 12:36:03,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 271 transitions, 708 flow. Second operand has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 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-12 12:36:03,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:03,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 320 [2024-11-12 12:36:03,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:03,703 INFO L124 PetriNetUnfolderBase]: 39/787 cut-off events. [2024-11-12 12:36:03,703 INFO L125 PetriNetUnfolderBase]: For 89/91 co-relation queries the response was YES. [2024-11-12 12:36:03,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 787 events. 39/787 cut-off events. For 89/91 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2468 event pairs, 6 based on Foata normal form. 0/755 useless extension candidates. Maximal degree in co-relation 1022. Up to 35 conditions per place. [2024-11-12 12:36:03,714 INFO L140 encePairwiseOnDemand]: 314/320 looper letters, 20 selfloop transitions, 6 changer transitions 0/275 dead transitions. [2024-11-12 12:36:03,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 275 transitions, 773 flow [2024-11-12 12:36:03,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:36:03,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:36:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1754 transitions. [2024-11-12 12:36:03,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9135416666666667 [2024-11-12 12:36:03,721 INFO L175 Difference]: Start difference. First operand has 281 places, 271 transitions, 708 flow. Second operand 6 states and 1754 transitions. [2024-11-12 12:36:03,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 275 transitions, 773 flow [2024-11-12 12:36:03,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 275 transitions, 761 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:36:03,726 INFO L231 Difference]: Finished difference. Result has 280 places, 270 transitions, 706 flow [2024-11-12 12:36:03,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=706, PETRI_PLACES=280, PETRI_TRANSITIONS=270} [2024-11-12 12:36:03,727 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -12 predicate places. [2024-11-12 12:36:03,727 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 270 transitions, 706 flow [2024-11-12 12:36:03,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 290.8333333333333) internal successors, (1745), 6 states have internal predecessors, (1745), 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-12 12:36:03,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:03,729 INFO L206 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] [2024-11-12 12:36:03,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 12:36:03,729 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:36:03,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:03,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2078466068, now seen corresponding path program 1 times [2024-11-12 12:36:03,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:03,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723275850] [2024-11-12 12:36:03,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:03,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 12:36:04,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:04,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723275850] [2024-11-12 12:36:04,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723275850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:04,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:04,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:36:04,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911876914] [2024-11-12 12:36:04,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:04,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:36:04,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:04,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:36:04,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:36:04,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 288 out of 320 [2024-11-12 12:36:04,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 270 transitions, 706 flow. Second operand has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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-12 12:36:04,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:04,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 288 of 320 [2024-11-12 12:36:04,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:04,520 INFO L124 PetriNetUnfolderBase]: 79/971 cut-off events. [2024-11-12 12:36:04,521 INFO L125 PetriNetUnfolderBase]: For 139/143 co-relation queries the response was YES. [2024-11-12 12:36:04,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 971 events. 79/971 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4540 event pairs, 12 based on Foata normal form. 0/929 useless extension candidates. Maximal degree in co-relation 1295. Up to 54 conditions per place. [2024-11-12 12:36:04,529 INFO L140 encePairwiseOnDemand]: 314/320 looper letters, 19 selfloop transitions, 6 changer transitions 0/273 dead transitions. [2024-11-12 12:36:04,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 273 transitions, 766 flow [2024-11-12 12:36:04,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:36:04,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:36:04,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1753 transitions. [2024-11-12 12:36:04,533 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130208333333333 [2024-11-12 12:36:04,534 INFO L175 Difference]: Start difference. First operand has 280 places, 270 transitions, 706 flow. Second operand 6 states and 1753 transitions. [2024-11-12 12:36:04,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 273 transitions, 766 flow [2024-11-12 12:36:04,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 273 transitions, 754 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:36:04,539 INFO L231 Difference]: Finished difference. Result has 279 places, 269 transitions, 704 flow [2024-11-12 12:36:04,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=704, PETRI_PLACES=279, PETRI_TRANSITIONS=269} [2024-11-12 12:36:04,540 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -13 predicate places. [2024-11-12 12:36:04,540 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 269 transitions, 704 flow [2024-11-12 12:36:04,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 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-12 12:36:04,541 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:04,542 INFO L206 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] [2024-11-12 12:36:04,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 12:36:04,542 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:36:04,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:04,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1214540652, now seen corresponding path program 1 times [2024-11-12 12:36:04,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:04,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91226052] [2024-11-12 12:36:04,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:04,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:36:04,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:04,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91226052] [2024-11-12 12:36:04,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91226052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:04,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:04,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:04,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761950526] [2024-11-12 12:36:04,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:04,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:04,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:04,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:04,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:04,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 320 [2024-11-12 12:36:04,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 269 transitions, 704 flow. Second operand has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 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-12 12:36:04,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:04,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 320 [2024-11-12 12:36:04,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:04,752 INFO L124 PetriNetUnfolderBase]: 46/820 cut-off events. [2024-11-12 12:36:04,753 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-11-12 12:36:04,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 820 events. 46/820 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2622 event pairs, 17 based on Foata normal form. 0/798 useless extension candidates. Maximal degree in co-relation 1079. Up to 64 conditions per place. [2024-11-12 12:36:04,759 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 11 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-11-12 12:36:04,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 269 transitions, 731 flow [2024-11-12 12:36:04,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:04,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2024-11-12 12:36:04,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9364583333333333 [2024-11-12 12:36:04,761 INFO L175 Difference]: Start difference. First operand has 279 places, 269 transitions, 704 flow. Second operand 3 states and 899 transitions. [2024-11-12 12:36:04,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 269 transitions, 731 flow [2024-11-12 12:36:04,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 269 transitions, 719 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:36:04,766 INFO L231 Difference]: Finished difference. Result has 275 places, 268 transitions, 694 flow [2024-11-12 12:36:04,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=275, PETRI_TRANSITIONS=268} [2024-11-12 12:36:04,767 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -17 predicate places. [2024-11-12 12:36:04,767 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 268 transitions, 694 flow [2024-11-12 12:36:04,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.0) internal successors, (894), 3 states have internal predecessors, (894), 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-12 12:36:04,768 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:36:04,768 INFO L206 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] [2024-11-12 12:36:04,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 12:36:04,768 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2024-11-12 12:36:04,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:36:04,769 INFO L85 PathProgramCache]: Analyzing trace with hash 585483892, now seen corresponding path program 1 times [2024-11-12 12:36:04,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:36:04,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210150233] [2024-11-12 12:36:04,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:36:04,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:36:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:36:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:36:04,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:36:04,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210150233] [2024-11-12 12:36:04,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210150233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:36:04,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:36:04,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:36:04,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555475033] [2024-11-12 12:36:04,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:36:04,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:36:04,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:36:04,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:36:04,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:36:04,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 295 out of 320 [2024-11-12 12:36:04,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 268 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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-12 12:36:04,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:36:04,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 295 of 320 [2024-11-12 12:36:04,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:36:04,969 INFO L124 PetriNetUnfolderBase]: 89/968 cut-off events. [2024-11-12 12:36:04,969 INFO L125 PetriNetUnfolderBase]: For 138/141 co-relation queries the response was YES. [2024-11-12 12:36:04,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1318 conditions, 968 events. 89/968 cut-off events. For 138/141 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4260 event pairs, 33 based on Foata normal form. 0/926 useless extension candidates. Maximal degree in co-relation 1261. Up to 102 conditions per place. [2024-11-12 12:36:04,977 INFO L140 encePairwiseOnDemand]: 317/320 looper letters, 0 selfloop transitions, 0 changer transitions 268/268 dead transitions. [2024-11-12 12:36:04,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 268 transitions, 721 flow [2024-11-12 12:36:04,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:36:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:36:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 899 transitions. [2024-11-12 12:36:04,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9364583333333333 [2024-11-12 12:36:04,979 INFO L175 Difference]: Start difference. First operand has 275 places, 268 transitions, 694 flow. Second operand 3 states and 899 transitions. [2024-11-12 12:36:04,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 268 transitions, 721 flow [2024-11-12 12:36:04,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 268 transitions, 717 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:36:04,983 INFO L231 Difference]: Finished difference. Result has 274 places, 0 transitions, 0 flow [2024-11-12 12:36:04,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=274, PETRI_TRANSITIONS=0} [2024-11-12 12:36:04,983 INFO L279 CegarLoopForPetriNet]: 292 programPoint places, -18 predicate places. [2024-11-12 12:36:04,984 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 0 transitions, 0 flow [2024-11-12 12:36:04,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 298.3333333333333) internal successors, (895), 3 states have internal predecessors, (895), 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-12 12:36:04,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (59 of 60 remaining) [2024-11-12 12:36:04,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (58 of 60 remaining) [2024-11-12 12:36:04,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (57 of 60 remaining) [2024-11-12 12:36:04,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 60 remaining) [2024-11-12 12:36:04,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (55 of 60 remaining) [2024-11-12 12:36:04,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (54 of 60 remaining) [2024-11-12 12:36:04,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (53 of 60 remaining) [2024-11-12 12:36:04,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (52 of 60 remaining) [2024-11-12 12:36:04,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (51 of 60 remaining) [2024-11-12 12:36:04,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (50 of 60 remaining) [2024-11-12 12:36:04,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (49 of 60 remaining) [2024-11-12 12:36:04,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (48 of 60 remaining) [2024-11-12 12:36:04,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (47 of 60 remaining) [2024-11-12 12:36:04,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (46 of 60 remaining) [2024-11-12 12:36:04,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (45 of 60 remaining) [2024-11-12 12:36:04,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (44 of 60 remaining) [2024-11-12 12:36:04,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (43 of 60 remaining) [2024-11-12 12:36:04,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (42 of 60 remaining) [2024-11-12 12:36:04,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (41 of 60 remaining) [2024-11-12 12:36:04,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (40 of 60 remaining) [2024-11-12 12:36:04,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (39 of 60 remaining) [2024-11-12 12:36:04,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (38 of 60 remaining) [2024-11-12 12:36:04,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (37 of 60 remaining) [2024-11-12 12:36:04,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (36 of 60 remaining) [2024-11-12 12:36:04,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (35 of 60 remaining) [2024-11-12 12:36:04,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (34 of 60 remaining) [2024-11-12 12:36:04,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (33 of 60 remaining) [2024-11-12 12:36:04,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (32 of 60 remaining) [2024-11-12 12:36:04,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (31 of 60 remaining) [2024-11-12 12:36:04,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (30 of 60 remaining) [2024-11-12 12:36:04,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (29 of 60 remaining) [2024-11-12 12:36:04,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (28 of 60 remaining) [2024-11-12 12:36:04,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 60 remaining) [2024-11-12 12:36:04,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (26 of 60 remaining) [2024-11-12 12:36:04,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 60 remaining) [2024-11-12 12:36:04,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 60 remaining) [2024-11-12 12:36:04,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (23 of 60 remaining) [2024-11-12 12:36:04,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 60 remaining) [2024-11-12 12:36:04,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 60 remaining) [2024-11-12 12:36:04,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (20 of 60 remaining) [2024-11-12 12:36:04,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (19 of 60 remaining) [2024-11-12 12:36:04,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (18 of 60 remaining) [2024-11-12 12:36:04,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (17 of 60 remaining) [2024-11-12 12:36:04,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (16 of 60 remaining) [2024-11-12 12:36:04,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (15 of 60 remaining) [2024-11-12 12:36:04,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (14 of 60 remaining) [2024-11-12 12:36:04,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (13 of 60 remaining) [2024-11-12 12:36:04,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (12 of 60 remaining) [2024-11-12 12:36:04,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 60 remaining) [2024-11-12 12:36:04,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 60 remaining) [2024-11-12 12:36:04,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 60 remaining) [2024-11-12 12:36:04,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 60 remaining) [2024-11-12 12:36:04,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (7 of 60 remaining) [2024-11-12 12:36:04,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (6 of 60 remaining) [2024-11-12 12:36:04,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (5 of 60 remaining) [2024-11-12 12:36:04,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (4 of 60 remaining) [2024-11-12 12:36:04,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (3 of 60 remaining) [2024-11-12 12:36:04,995 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (2 of 60 remaining) [2024-11-12 12:36:04,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (1 of 60 remaining) [2024-11-12 12:36:04,996 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (0 of 60 remaining) [2024-11-12 12:36:04,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 12:36:04,997 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:36:05,003 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 12:36:05,003 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:36:05,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:36:05 BasicIcfg [2024-11-12 12:36:05,009 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:36:05,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:36:05,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:36:05,009 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:36:05,010 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:35:53" (3/4) ... [2024-11-12 12:36:05,011 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 12:36:05,014 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-12 12:36:05,014 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-12 12:36:05,020 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-12 12:36:05,021 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 12:36:05,021 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 12:36:05,021 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 12:36:05,120 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:36:05,121 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 12:36:05,121 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:36:05,121 INFO L158 Benchmark]: Toolchain (without parser) took 12622.16ms. Allocated memory was 172.0MB in the beginning and 375.4MB in the end (delta: 203.4MB). Free memory was 115.9MB in the beginning and 170.8MB in the end (delta: -55.0MB). Peak memory consumption was 151.2MB. Max. memory is 16.1GB. [2024-11-12 12:36:05,122 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 172.0MB. Free memory was 137.0MB in the beginning and 136.8MB in the end (delta: 162.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:36:05,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.44ms. Allocated memory is still 172.0MB. Free memory was 115.9MB in the beginning and 101.9MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-12 12:36:05,123 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.95ms. Allocated memory is still 172.0MB. Free memory was 101.9MB in the beginning and 99.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:36:05,123 INFO L158 Benchmark]: Boogie Preprocessor took 41.85ms. Allocated memory is still 172.0MB. Free memory was 99.8MB in the beginning and 97.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:36:05,123 INFO L158 Benchmark]: RCFGBuilder took 730.97ms. Allocated memory is still 172.0MB. Free memory was 97.7MB in the beginning and 70.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-12 12:36:05,123 INFO L158 Benchmark]: TraceAbstraction took 11379.52ms. Allocated memory was 172.0MB in the beginning and 375.4MB in the end (delta: 203.4MB). Free memory was 69.7MB in the beginning and 176.1MB in the end (delta: -106.3MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. [2024-11-12 12:36:05,124 INFO L158 Benchmark]: Witness Printer took 111.67ms. Allocated memory is still 375.4MB. Free memory was 176.1MB in the beginning and 170.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:36:05,125 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.20ms. Allocated memory is still 172.0MB. Free memory was 137.0MB in the beginning and 136.8MB in the end (delta: 162.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.44ms. Allocated memory is still 172.0MB. Free memory was 115.9MB in the beginning and 101.9MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.95ms. Allocated memory is still 172.0MB. Free memory was 101.9MB in the beginning and 99.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.85ms. Allocated memory is still 172.0MB. Free memory was 99.8MB in the beginning and 97.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 730.97ms. Allocated memory is still 172.0MB. Free memory was 97.7MB in the beginning and 70.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11379.52ms. Allocated memory was 172.0MB in the beginning and 375.4MB in the end (delta: 203.4MB). Free memory was 69.7MB in the beginning and 176.1MB in the end (delta: -106.3MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. * Witness Printer took 111.67ms. Allocated memory is still 375.4MB. Free memory was 176.1MB in the beginning and 170.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: 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: 59]: 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: 59]: 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: 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: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: 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: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 434 locations, 60 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.2s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2619 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1733 mSDsluCounter, 1830 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1655 mSDsCounter, 342 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4105 IncrementalHoareTripleChecker+Invalid, 4447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 342 mSolverCounterUnsat, 175 mSDtfsCounter, 4105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780occurred in iteration=16, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2662 NumberOfCodeBlocks, 2662 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2639 ConstructedInterpolants, 0 QuantifiedInterpolants, 5208 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 PerfectInterpolantSequences, 16/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 34 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-12 12:36:05,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE