./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/clever.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f 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/clever.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 f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:37:37,346 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:37:37,414 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:37:37,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:37:37,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:37:37,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:37:37,458 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:37:37,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:37:37,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:37:37,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:37:37,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:37:37,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:37:37,461 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:37:37,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:37:37,465 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:37:37,465 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:37:37,465 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:37:37,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:37:37,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:37:37,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:37:37,466 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:37:37,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:37:37,467 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:37:37,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:37:37,467 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:37:37,468 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:37:37,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:37:37,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:37:37,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:37:37,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:37:37,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:37:37,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:37:37,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:37:37,469 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:37:37,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:37:37,470 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:37:37,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:37:37,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:37:37,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:37:37,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:37:37,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:37:37,474 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 -> f1b460e4dbdd0bf3097d690d1720c7a2141566e2aa4ca1ed003c7fa25661851d [2024-11-10 14:37:37,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:37:37,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:37:37,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:37:37,804 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:37:37,805 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:37:37,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/clever.wvr.c [2024-11-10 14:37:39,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:37:39,414 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:37:39,415 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/clever.wvr.c [2024-11-10 14:37:39,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7582ee56/c597718b83f24500809685531ef5fccf/FLAG295dc782a [2024-11-10 14:37:39,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7582ee56/c597718b83f24500809685531ef5fccf [2024-11-10 14:37:39,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:37:39,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:37:39,819 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:37:39,819 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:37:39,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:37:39,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:37:39" (1/1) ... [2024-11-10 14:37:39,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39367a7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:39, skipping insertion in model container [2024-11-10 14:37:39,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:37:39" (1/1) ... [2024-11-10 14:37:39,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:37:40,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:37:40,092 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:37:40,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:37:40,144 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:37:40,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:40 WrapperNode [2024-11-10 14:37:40,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:37:40,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:37:40,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:37:40,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:37:40,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:40" (1/1) ... [2024-11-10 14:37:40,167 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:40" (1/1) ... [2024-11-10 14:37:40,193 INFO L138 Inliner]: procedures = 18, calls = 12, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 134 [2024-11-10 14:37:40,194 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:37:40,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:37:40,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:37:40,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:37:40,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:40" (1/1) ... [2024-11-10 14:37:40,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:40" (1/1) ... [2024-11-10 14:37:40,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:40" (1/1) ... [2024-11-10 14:37:40,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:40" (1/1) ... [2024-11-10 14:37:40,216 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:40" (1/1) ... [2024-11-10 14:37:40,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:40" (1/1) ... [2024-11-10 14:37:40,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:40" (1/1) ... [2024-11-10 14:37:40,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:40" (1/1) ... [2024-11-10 14:37:40,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:37:40,229 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:37:40,229 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:37:40,229 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:37:40,230 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:40" (1/1) ... [2024-11-10 14:37:40,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:37:40,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:37:40,271 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-10 14:37:40,278 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-10 14:37:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:37:40,326 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:37:40,327 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:37:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:37:40,327 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:37:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:37:40,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:37:40,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:37:40,330 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:37:40,451 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:37:40,453 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:37:40,752 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:37:40,752 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:37:40,788 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:37:40,789 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:37:40,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:37:40 BoogieIcfgContainer [2024-11-10 14:37:40,793 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:37:40,795 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:37:40,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:37:40,801 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:37:40,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:37:39" (1/3) ... [2024-11-10 14:37:40,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c852b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:37:40, skipping insertion in model container [2024-11-10 14:37:40,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:40" (2/3) ... [2024-11-10 14:37:40,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c852b04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:37:40, skipping insertion in model container [2024-11-10 14:37:40,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:37:40" (3/3) ... [2024-11-10 14:37:40,805 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2024-11-10 14:37:40,829 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:37:40,829 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2024-11-10 14:37:40,830 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:37:40,927 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:37:40,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 266 transitions, 546 flow [2024-11-10 14:37:41,122 INFO L124 PetriNetUnfolderBase]: 12/264 cut-off events. [2024-11-10 14:37:41,125 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:37:41,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 264 events. 12/264 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 460 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 204. Up to 2 conditions per place. [2024-11-10 14:37:41,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 266 transitions, 546 flow [2024-11-10 14:37:41,179 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 247 transitions, 506 flow [2024-11-10 14:37:41,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:37:41,203 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;@2a5531df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:37:41,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-11-10 14:37:41,213 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:37:41,213 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-10 14:37:41,213 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:37:41,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:41,214 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:41,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:41,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:41,221 INFO L85 PathProgramCache]: Analyzing trace with hash -607739469, now seen corresponding path program 1 times [2024-11-10 14:37:41,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:41,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250181228] [2024-11-10 14:37:41,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:41,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:41,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:41,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250181228] [2024-11-10 14:37:41,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250181228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:41,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:41,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:41,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987846621] [2024-11-10 14:37:41,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:41,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:41,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:41,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:41,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:41,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-11-10 14:37:41,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 247 transitions, 506 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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-10 14:37:41,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:41,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-11-10 14:37:41,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:41,617 INFO L124 PetriNetUnfolderBase]: 13/361 cut-off events. [2024-11-10 14:37:41,617 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-10 14:37:41,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 361 events. 13/361 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1042 event pairs, 3 based on Foata normal form. 13/306 useless extension candidates. Maximal degree in co-relation 231. Up to 18 conditions per place. [2024-11-10 14:37:41,623 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 9 selfloop transitions, 2 changer transitions 2/241 dead transitions. [2024-11-10 14:37:41,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 241 transitions, 516 flow [2024-11-10 14:37:41,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 755 transitions. [2024-11-10 14:37:41,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9461152882205514 [2024-11-10 14:37:41,651 INFO L175 Difference]: Start difference. First operand has 243 places, 247 transitions, 506 flow. Second operand 3 states and 755 transitions. [2024-11-10 14:37:41,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 241 transitions, 516 flow [2024-11-10 14:37:41,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 241 transitions, 508 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 14:37:41,662 INFO L231 Difference]: Finished difference. Result has 240 places, 239 transitions, 486 flow [2024-11-10 14:37:41,665 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=240, PETRI_TRANSITIONS=239} [2024-11-10 14:37:41,670 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -3 predicate places. [2024-11-10 14:37:41,671 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 239 transitions, 486 flow [2024-11-10 14:37:41,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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-10 14:37:41,672 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:41,672 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:41,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:37:41,673 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:41,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:41,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2121915350, now seen corresponding path program 1 times [2024-11-10 14:37:41,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:41,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168543933] [2024-11-10 14:37:41,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:41,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:41,744 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-10 14:37:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:41,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168543933] [2024-11-10 14:37:41,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168543933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:41,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:41,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:41,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812906409] [2024-11-10 14:37:41,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:41,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:41,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:41,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:41,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:41,784 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 266 [2024-11-10 14:37:41,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 239 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 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-10 14:37:41,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:41,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 266 [2024-11-10 14:37:41,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:41,839 INFO L124 PetriNetUnfolderBase]: 10/279 cut-off events. [2024-11-10 14:37:41,840 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-11-10 14:37:41,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 279 events. 10/279 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 623 event pairs, 3 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 274. Up to 17 conditions per place. [2024-11-10 14:37:41,844 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2024-11-10 14:37:41,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 238 transitions, 508 flow [2024-11-10 14:37:41,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2024-11-10 14:37:41,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373433583959899 [2024-11-10 14:37:41,849 INFO L175 Difference]: Start difference. First operand has 240 places, 239 transitions, 486 flow. Second operand 3 states and 748 transitions. [2024-11-10 14:37:41,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 238 transitions, 508 flow [2024-11-10 14:37:41,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 238 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:41,858 INFO L231 Difference]: Finished difference. Result has 237 places, 238 transitions, 484 flow [2024-11-10 14:37:41,859 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=237, PETRI_TRANSITIONS=238} [2024-11-10 14:37:41,860 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -6 predicate places. [2024-11-10 14:37:41,860 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 238 transitions, 484 flow [2024-11-10 14:37:41,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 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-10 14:37:41,860 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:41,861 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:41,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:37:41,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:41,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1176068983, now seen corresponding path program 1 times [2024-11-10 14:37:41,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:41,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798590440] [2024-11-10 14:37:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:41,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:41,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:41,938 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-10 14:37:41,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:41,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798590440] [2024-11-10 14:37:41,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798590440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:41,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:41,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:41,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568470798] [2024-11-10 14:37:41,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:41,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:41,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:41,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:41,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:41,984 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 266 [2024-11-10 14:37:41,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 238 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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-10 14:37:41,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:41,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 266 [2024-11-10 14:37:41,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:42,032 INFO L124 PetriNetUnfolderBase]: 11/298 cut-off events. [2024-11-10 14:37:42,033 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:37:42,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 298 events. 11/298 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 704 event pairs, 3 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 292. Up to 22 conditions per place. [2024-11-10 14:37:42,037 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 14 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2024-11-10 14:37:42,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 237 transitions, 514 flow [2024-11-10 14:37:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:42,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 740 transitions. [2024-11-10 14:37:42,041 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9273182957393483 [2024-11-10 14:37:42,041 INFO L175 Difference]: Start difference. First operand has 237 places, 238 transitions, 484 flow. Second operand 3 states and 740 transitions. [2024-11-10 14:37:42,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 237 transitions, 514 flow [2024-11-10 14:37:42,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 237 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:42,082 INFO L231 Difference]: Finished difference. Result has 236 places, 237 transitions, 482 flow [2024-11-10 14:37:42,083 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=236, PETRI_TRANSITIONS=237} [2024-11-10 14:37:42,084 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -7 predicate places. [2024-11-10 14:37:42,084 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 237 transitions, 482 flow [2024-11-10 14:37:42,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 242.33333333333334) internal successors, (727), 3 states have internal predecessors, (727), 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-10 14:37:42,086 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:42,086 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:42,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:37:42,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:42,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:42,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1761892484, now seen corresponding path program 1 times [2024-11-10 14:37:42,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:42,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437183356] [2024-11-10 14:37:42,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:42,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:42,159 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-10 14:37:42,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:42,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437183356] [2024-11-10 14:37:42,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437183356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:42,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:42,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:42,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141118818] [2024-11-10 14:37:42,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:42,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:42,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:42,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:42,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:42,206 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-11-10 14:37:42,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 237 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10 14:37:42,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:42,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-11-10 14:37:42,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:42,255 INFO L124 PetriNetUnfolderBase]: 10/273 cut-off events. [2024-11-10 14:37:42,255 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2024-11-10 14:37:42,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 273 events. 10/273 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 583 event pairs, 3 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 253. Up to 19 conditions per place. [2024-11-10 14:37:42,257 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2024-11-10 14:37:42,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 236 transitions, 506 flow [2024-11-10 14:37:42,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-11-10 14:37:42,262 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-11-10 14:37:42,262 INFO L175 Difference]: Start difference. First operand has 236 places, 237 transitions, 482 flow. Second operand 3 states and 746 transitions. [2024-11-10 14:37:42,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 236 transitions, 506 flow [2024-11-10 14:37:42,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 236 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:42,269 INFO L231 Difference]: Finished difference. Result has 235 places, 236 transitions, 480 flow [2024-11-10 14:37:42,269 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=235, PETRI_TRANSITIONS=236} [2024-11-10 14:37:42,270 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -8 predicate places. [2024-11-10 14:37:42,272 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 236 transitions, 480 flow [2024-11-10 14:37:42,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10 14:37:42,273 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:42,273 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:42,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:37:42,273 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:42,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:42,274 INFO L85 PathProgramCache]: Analyzing trace with hash -229923240, now seen corresponding path program 1 times [2024-11-10 14:37:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:42,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318930286] [2024-11-10 14:37:42,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:42,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:42,340 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-10 14:37:42,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:42,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318930286] [2024-11-10 14:37:42,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318930286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:42,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:42,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:42,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521615058] [2024-11-10 14:37:42,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:42,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:42,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:42,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:42,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-11-10 14:37:42,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 236 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10 14:37:42,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:42,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-11-10 14:37:42,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:42,435 INFO L124 PetriNetUnfolderBase]: 14/387 cut-off events. [2024-11-10 14:37:42,436 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-11-10 14:37:42,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419 conditions, 387 events. 14/387 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1060 event pairs, 4 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 364. Up to 20 conditions per place. [2024-11-10 14:37:42,439 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2024-11-10 14:37:42,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 235 transitions, 504 flow [2024-11-10 14:37:42,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-11-10 14:37:42,443 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-11-10 14:37:42,443 INFO L175 Difference]: Start difference. First operand has 235 places, 236 transitions, 480 flow. Second operand 3 states and 746 transitions. [2024-11-10 14:37:42,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 235 transitions, 504 flow [2024-11-10 14:37:42,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 235 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:42,449 INFO L231 Difference]: Finished difference. Result has 234 places, 235 transitions, 478 flow [2024-11-10 14:37:42,449 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=232, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=234, PETRI_TRANSITIONS=235} [2024-11-10 14:37:42,450 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -9 predicate places. [2024-11-10 14:37:42,451 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 235 transitions, 478 flow [2024-11-10 14:37:42,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10 14:37:42,452 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:42,452 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:42,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:37:42,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:42,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:42,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1979569751, now seen corresponding path program 1 times [2024-11-10 14:37:42,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:42,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714236383] [2024-11-10 14:37:42,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:42,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:42,514 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-10 14:37:42,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:42,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714236383] [2024-11-10 14:37:42,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714236383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:42,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:42,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:42,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701548691] [2024-11-10 14:37:42,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:42,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:42,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:42,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:42,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:42,545 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-11-10 14:37:42,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 235 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10 14:37:42,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:42,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-11-10 14:37:42,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:42,593 INFO L124 PetriNetUnfolderBase]: 10/310 cut-off events. [2024-11-10 14:37:42,593 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-11-10 14:37:42,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 310 events. 10/310 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 658 event pairs, 2 based on Foata normal form. 0/259 useless extension candidates. Maximal degree in co-relation 273. Up to 16 conditions per place. [2024-11-10 14:37:42,595 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/234 dead transitions. [2024-11-10 14:37:42,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 234 transitions, 502 flow [2024-11-10 14:37:42,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-11-10 14:37:42,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-11-10 14:37:42,598 INFO L175 Difference]: Start difference. First operand has 234 places, 235 transitions, 478 flow. Second operand 3 states and 746 transitions. [2024-11-10 14:37:42,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 234 transitions, 502 flow [2024-11-10 14:37:42,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 234 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:42,603 INFO L231 Difference]: Finished difference. Result has 233 places, 234 transitions, 476 flow [2024-11-10 14:37:42,603 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=233, PETRI_TRANSITIONS=234} [2024-11-10 14:37:42,604 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -10 predicate places. [2024-11-10 14:37:42,604 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 234 transitions, 476 flow [2024-11-10 14:37:42,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10 14:37:42,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:42,605 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:42,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:37:42,606 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:42,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1804706442, now seen corresponding path program 1 times [2024-11-10 14:37:42,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:42,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854567568] [2024-11-10 14:37:42,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:42,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:42,645 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-10 14:37:42,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:42,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854567568] [2024-11-10 14:37:42,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854567568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:42,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:42,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:42,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457543606] [2024-11-10 14:37:42,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:42,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:42,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:42,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:42,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:42,679 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-11-10 14:37:42,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 234 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10 14:37:42,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:42,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-11-10 14:37:42,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:42,713 INFO L124 PetriNetUnfolderBase]: 8/237 cut-off events. [2024-11-10 14:37:42,714 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-10 14:37:42,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 237 events. 8/237 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 432 event pairs, 2 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 191. Up to 16 conditions per place. [2024-11-10 14:37:42,715 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 11 selfloop transitions, 2 changer transitions 0/233 dead transitions. [2024-11-10 14:37:42,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 233 transitions, 500 flow [2024-11-10 14:37:42,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:42,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:42,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 746 transitions. [2024-11-10 14:37:42,718 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9348370927318296 [2024-11-10 14:37:42,718 INFO L175 Difference]: Start difference. First operand has 233 places, 234 transitions, 476 flow. Second operand 3 states and 746 transitions. [2024-11-10 14:37:42,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 233 transitions, 500 flow [2024-11-10 14:37:42,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 233 transitions, 496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:42,722 INFO L231 Difference]: Finished difference. Result has 232 places, 233 transitions, 474 flow [2024-11-10 14:37:42,723 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=232, PETRI_TRANSITIONS=233} [2024-11-10 14:37:42,723 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -11 predicate places. [2024-11-10 14:37:42,723 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 233 transitions, 474 flow [2024-11-10 14:37:42,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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-10 14:37:42,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:42,724 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:42,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:37:42,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:42,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:42,725 INFO L85 PathProgramCache]: Analyzing trace with hash 774560004, now seen corresponding path program 1 times [2024-11-10 14:37:42,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:42,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645634793] [2024-11-10 14:37:42,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:42,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:42,786 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-10 14:37:42,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:42,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645634793] [2024-11-10 14:37:42,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645634793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:42,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:42,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:42,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40083634] [2024-11-10 14:37:42,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:42,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:42,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:42,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:42,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:42,823 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 266 [2024-11-10 14:37:42,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 233 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-10 14:37:42,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:42,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 266 [2024-11-10 14:37:42,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:42,875 INFO L124 PetriNetUnfolderBase]: 13/289 cut-off events. [2024-11-10 14:37:42,875 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:37:42,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 289 events. 13/289 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 700 event pairs, 4 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 254. Up to 26 conditions per place. [2024-11-10 14:37:42,876 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 17 selfloop transitions, 3 changer transitions 0/229 dead transitions. [2024-11-10 14:37:42,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 229 transitions, 507 flow [2024-11-10 14:37:42,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 731 transitions. [2024-11-10 14:37:42,879 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9160401002506265 [2024-11-10 14:37:42,879 INFO L175 Difference]: Start difference. First operand has 232 places, 233 transitions, 474 flow. Second operand 3 states and 731 transitions. [2024-11-10 14:37:42,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 229 transitions, 507 flow [2024-11-10 14:37:42,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 229 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:42,883 INFO L231 Difference]: Finished difference. Result has 227 places, 228 transitions, 471 flow [2024-11-10 14:37:42,883 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=227, PETRI_TRANSITIONS=228} [2024-11-10 14:37:42,884 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -16 predicate places. [2024-11-10 14:37:42,884 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 228 transitions, 471 flow [2024-11-10 14:37:42,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-10 14:37:42,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:42,885 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:42,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:37:42,885 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:42,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:42,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1322829772, now seen corresponding path program 1 times [2024-11-10 14:37:42,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:42,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741724831] [2024-11-10 14:37:42,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:42,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:42,915 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-10 14:37:42,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:42,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741724831] [2024-11-10 14:37:42,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741724831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:42,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:42,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:42,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639056432] [2024-11-10 14:37:42,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:42,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:42,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:42,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:42,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:42,934 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-11-10 14:37:42,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 228 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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-10 14:37:42,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:42,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-11-10 14:37:42,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:42,964 INFO L124 PetriNetUnfolderBase]: 12/263 cut-off events. [2024-11-10 14:37:42,964 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-11-10 14:37:42,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 263 events. 12/263 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 567 event pairs, 4 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 211. Up to 20 conditions per place. [2024-11-10 14:37:42,965 INFO L140 encePairwiseOnDemand]: 260/266 looper letters, 11 selfloop transitions, 3 changer transitions 0/227 dead transitions. [2024-11-10 14:37:42,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 227 transitions, 498 flow [2024-11-10 14:37:42,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:42,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 749 transitions. [2024-11-10 14:37:42,968 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9385964912280702 [2024-11-10 14:37:42,968 INFO L175 Difference]: Start difference. First operand has 227 places, 228 transitions, 471 flow. Second operand 3 states and 749 transitions. [2024-11-10 14:37:42,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 227 transitions, 498 flow [2024-11-10 14:37:42,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 227 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:37:42,971 INFO L231 Difference]: Finished difference. Result has 226 places, 226 transitions, 475 flow [2024-11-10 14:37:42,972 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=475, PETRI_PLACES=226, PETRI_TRANSITIONS=226} [2024-11-10 14:37:42,972 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -17 predicate places. [2024-11-10 14:37:42,972 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 226 transitions, 475 flow [2024-11-10 14:37:42,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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-10 14:37:42,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:42,973 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:42,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:37:42,973 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:42,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:42,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1851719432, now seen corresponding path program 1 times [2024-11-10 14:37:42,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:42,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487141059] [2024-11-10 14:37:42,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:42,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:43,002 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-10 14:37:43,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:43,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487141059] [2024-11-10 14:37:43,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487141059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:43,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:43,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:43,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436009228] [2024-11-10 14:37:43,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:43,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:43,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:43,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:43,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:43,027 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-11-10 14:37:43,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 226 transitions, 475 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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-10 14:37:43,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:43,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-11-10 14:37:43,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:43,078 INFO L124 PetriNetUnfolderBase]: 16/385 cut-off events. [2024-11-10 14:37:43,079 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2024-11-10 14:37:43,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 385 events. 16/385 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1142 event pairs, 1 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 333. Up to 17 conditions per place. [2024-11-10 14:37:43,081 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 14 selfloop transitions, 4 changer transitions 0/229 dead transitions. [2024-11-10 14:37:43,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 229 transitions, 521 flow [2024-11-10 14:37:43,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-11-10 14:37:43,083 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.943609022556391 [2024-11-10 14:37:43,083 INFO L175 Difference]: Start difference. First operand has 226 places, 226 transitions, 475 flow. Second operand 3 states and 753 transitions. [2024-11-10 14:37:43,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 229 transitions, 521 flow [2024-11-10 14:37:43,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 229 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:37:43,087 INFO L231 Difference]: Finished difference. Result has 225 places, 225 transitions, 486 flow [2024-11-10 14:37:43,088 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=225, PETRI_TRANSITIONS=225} [2024-11-10 14:37:43,090 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -18 predicate places. [2024-11-10 14:37:43,090 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 225 transitions, 486 flow [2024-11-10 14:37:43,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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-10 14:37:43,091 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:43,091 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:43,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:37:43,091 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:43,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash 948341292, now seen corresponding path program 1 times [2024-11-10 14:37:43,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:43,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652111660] [2024-11-10 14:37:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:43,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:43,138 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-10 14:37:43,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:43,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652111660] [2024-11-10 14:37:43,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652111660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:43,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:43,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:43,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207456025] [2024-11-10 14:37:43,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:43,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:43,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:43,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:43,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:43,166 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 266 [2024-11-10 14:37:43,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 225 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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-10 14:37:43,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:43,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 266 [2024-11-10 14:37:43,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:43,238 INFO L124 PetriNetUnfolderBase]: 27/553 cut-off events. [2024-11-10 14:37:43,238 INFO L125 PetriNetUnfolderBase]: For 12/16 co-relation queries the response was YES. [2024-11-10 14:37:43,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 553 events. 27/553 cut-off events. For 12/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2651 event pairs, 2 based on Foata normal form. 1/493 useless extension candidates. Maximal degree in co-relation 407. Up to 30 conditions per place. [2024-11-10 14:37:43,241 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 10 selfloop transitions, 3 changer transitions 7/228 dead transitions. [2024-11-10 14:37:43,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 228 transitions, 530 flow [2024-11-10 14:37:43,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:43,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2024-11-10 14:37:43,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423558897243107 [2024-11-10 14:37:43,244 INFO L175 Difference]: Start difference. First operand has 225 places, 225 transitions, 486 flow. Second operand 3 states and 752 transitions. [2024-11-10 14:37:43,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 228 transitions, 530 flow [2024-11-10 14:37:43,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 228 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:37:43,249 INFO L231 Difference]: Finished difference. Result has 224 places, 218 transitions, 474 flow [2024-11-10 14:37:43,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=224, PETRI_TRANSITIONS=218} [2024-11-10 14:37:43,250 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -19 predicate places. [2024-11-10 14:37:43,250 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 218 transitions, 474 flow [2024-11-10 14:37:43,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 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-10 14:37:43,251 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:43,251 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:43,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:37:43,252 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:43,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1261852795, now seen corresponding path program 1 times [2024-11-10 14:37:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:43,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759084040] [2024-11-10 14:37:43,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:43,305 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-10 14:37:43,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:43,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759084040] [2024-11-10 14:37:43,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759084040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:43,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:43,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:43,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681749067] [2024-11-10 14:37:43,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:43,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:43,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:43,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:43,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:43,327 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 266 [2024-11-10 14:37:43,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 218 transitions, 474 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 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-10 14:37:43,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:43,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 266 [2024-11-10 14:37:43,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:43,437 INFO L124 PetriNetUnfolderBase]: 66/1009 cut-off events. [2024-11-10 14:37:43,437 INFO L125 PetriNetUnfolderBase]: For 24/28 co-relation queries the response was YES. [2024-11-10 14:37:43,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1009 events. 66/1009 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6001 event pairs, 20 based on Foata normal form. 0/877 useless extension candidates. Maximal degree in co-relation 658. Up to 92 conditions per place. [2024-11-10 14:37:43,442 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 9 selfloop transitions, 1 changer transitions 0/215 dead transitions. [2024-11-10 14:37:43,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 488 flow [2024-11-10 14:37:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:43,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2024-11-10 14:37:43,445 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373433583959899 [2024-11-10 14:37:43,445 INFO L175 Difference]: Start difference. First operand has 224 places, 218 transitions, 474 flow. Second operand 3 states and 748 transitions. [2024-11-10 14:37:43,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 488 flow [2024-11-10 14:37:43,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 215 transitions, 485 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:37:43,449 INFO L231 Difference]: Finished difference. Result has 218 places, 215 transitions, 467 flow [2024-11-10 14:37:43,449 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=218, PETRI_TRANSITIONS=215} [2024-11-10 14:37:43,449 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-11-10 14:37:43,450 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 215 transitions, 467 flow [2024-11-10 14:37:43,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 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-10 14:37:43,450 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:43,450 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:43,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:37:43,451 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:43,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:43,451 INFO L85 PathProgramCache]: Analyzing trace with hash 311315482, now seen corresponding path program 1 times [2024-11-10 14:37:43,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:43,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995635477] [2024-11-10 14:37:43,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:43,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:43,482 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-10 14:37:43,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:43,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995635477] [2024-11-10 14:37:43,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995635477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:43,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:43,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:43,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899581155] [2024-11-10 14:37:43,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:43,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:43,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:43,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:43,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:43,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 266 [2024-11-10 14:37:43,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 215 transitions, 467 flow. Second operand has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 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-10 14:37:43,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:43,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 266 [2024-11-10 14:37:43,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:43,596 INFO L124 PetriNetUnfolderBase]: 80/1099 cut-off events. [2024-11-10 14:37:43,596 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-10 14:37:43,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1338 conditions, 1099 events. 80/1099 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 7329 event pairs, 16 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 636. Up to 108 conditions per place. [2024-11-10 14:37:43,603 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 9 selfloop transitions, 2 changer transitions 0/216 dead transitions. [2024-11-10 14:37:43,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 216 transitions, 492 flow [2024-11-10 14:37:43,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 757 transitions. [2024-11-10 14:37:43,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9486215538847118 [2024-11-10 14:37:43,605 INFO L175 Difference]: Start difference. First operand has 218 places, 215 transitions, 467 flow. Second operand 3 states and 757 transitions. [2024-11-10 14:37:43,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 216 transitions, 492 flow [2024-11-10 14:37:43,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 216 transitions, 491 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:37:43,609 INFO L231 Difference]: Finished difference. Result has 218 places, 215 transitions, 476 flow [2024-11-10 14:37:43,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=218, PETRI_TRANSITIONS=215} [2024-11-10 14:37:43,610 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-11-10 14:37:43,611 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 215 transitions, 476 flow [2024-11-10 14:37:43,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.33333333333334) internal successors, (748), 3 states have internal predecessors, (748), 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-10 14:37:43,611 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:43,611 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:43,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:37:43,612 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:43,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:43,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1340216038, now seen corresponding path program 1 times [2024-11-10 14:37:43,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:43,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354737583] [2024-11-10 14:37:43,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:43,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:43,644 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-10 14:37:43,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:43,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354737583] [2024-11-10 14:37:43,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354737583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:43,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:43,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:43,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296019757] [2024-11-10 14:37:43,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:43,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:43,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:43,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:43,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:43,668 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-11-10 14:37:43,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 215 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-10 14:37:43,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:43,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-11-10 14:37:43,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:43,748 INFO L124 PetriNetUnfolderBase]: 72/875 cut-off events. [2024-11-10 14:37:43,748 INFO L125 PetriNetUnfolderBase]: For 8/12 co-relation queries the response was YES. [2024-11-10 14:37:43,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1134 conditions, 875 events. 72/875 cut-off events. For 8/12 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5181 event pairs, 16 based on Foata normal form. 0/792 useless extension candidates. Maximal degree in co-relation 740. Up to 70 conditions per place. [2024-11-10 14:37:43,753 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2024-11-10 14:37:43,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 501 flow [2024-11-10 14:37:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-11-10 14:37:43,756 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411027568922306 [2024-11-10 14:37:43,756 INFO L175 Difference]: Start difference. First operand has 218 places, 215 transitions, 476 flow. Second operand 3 states and 751 transitions. [2024-11-10 14:37:43,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 501 flow [2024-11-10 14:37:43,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 215 transitions, 501 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:37:43,760 INFO L231 Difference]: Finished difference. Result has 219 places, 214 transitions, 478 flow [2024-11-10 14:37:43,761 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=219, PETRI_TRANSITIONS=214} [2024-11-10 14:37:43,761 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -24 predicate places. [2024-11-10 14:37:43,762 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 214 transitions, 478 flow [2024-11-10 14:37:43,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-10 14:37:43,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:43,762 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:43,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:37:43,763 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:43,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:43,764 INFO L85 PathProgramCache]: Analyzing trace with hash 360516864, now seen corresponding path program 1 times [2024-11-10 14:37:43,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:43,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707294746] [2024-11-10 14:37:43,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:43,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:43,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:43,819 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-10 14:37:43,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:43,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707294746] [2024-11-10 14:37:43,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707294746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:43,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:43,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:43,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986800847] [2024-11-10 14:37:43,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:43,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:43,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:43,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:43,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:43,839 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-11-10 14:37:43,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 214 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-10 14:37:43,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:43,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-11-10 14:37:43,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:43,938 INFO L124 PetriNetUnfolderBase]: 62/985 cut-off events. [2024-11-10 14:37:43,938 INFO L125 PetriNetUnfolderBase]: For 24/28 co-relation queries the response was YES. [2024-11-10 14:37:43,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 985 events. 62/985 cut-off events. For 24/28 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5826 event pairs, 10 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 744. Up to 44 conditions per place. [2024-11-10 14:37:43,945 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 10 selfloop transitions, 3 changer transitions 0/215 dead transitions. [2024-11-10 14:37:43,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 215 transitions, 510 flow [2024-11-10 14:37:43,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2024-11-10 14:37:43,947 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.943609022556391 [2024-11-10 14:37:43,948 INFO L175 Difference]: Start difference. First operand has 219 places, 214 transitions, 478 flow. Second operand 3 states and 753 transitions. [2024-11-10 14:37:43,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 215 transitions, 510 flow [2024-11-10 14:37:43,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 215 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:43,952 INFO L231 Difference]: Finished difference. Result has 218 places, 213 transitions, 483 flow [2024-11-10 14:37:43,953 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=483, PETRI_PLACES=218, PETRI_TRANSITIONS=213} [2024-11-10 14:37:43,953 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-11-10 14:37:43,953 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 213 transitions, 483 flow [2024-11-10 14:37:43,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-10 14:37:43,954 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:43,954 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:43,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:37:43,955 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:43,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:43,955 INFO L85 PathProgramCache]: Analyzing trace with hash -7612044, now seen corresponding path program 1 times [2024-11-10 14:37:43,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:43,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964597735] [2024-11-10 14:37:43,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:43,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:43,992 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-10 14:37:43,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:43,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964597735] [2024-11-10 14:37:43,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964597735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:43,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:43,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:43,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577908623] [2024-11-10 14:37:43,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:43,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:43,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:43,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:43,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:44,014 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-11-10 14:37:44,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 213 transitions, 483 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-10 14:37:44,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:44,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-11-10 14:37:44,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:44,091 INFO L124 PetriNetUnfolderBase]: 60/811 cut-off events. [2024-11-10 14:37:44,091 INFO L125 PetriNetUnfolderBase]: For 60/68 co-relation queries the response was YES. [2024-11-10 14:37:44,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 811 events. 60/811 cut-off events. For 60/68 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4059 event pairs, 16 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 669. Up to 76 conditions per place. [2024-11-10 14:37:44,097 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2024-11-10 14:37:44,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 213 transitions, 508 flow [2024-11-10 14:37:44,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-11-10 14:37:44,099 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9398496240601504 [2024-11-10 14:37:44,100 INFO L175 Difference]: Start difference. First operand has 218 places, 213 transitions, 483 flow. Second operand 3 states and 750 transitions. [2024-11-10 14:37:44,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 213 transitions, 508 flow [2024-11-10 14:37:44,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 213 transitions, 505 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:37:44,104 INFO L231 Difference]: Finished difference. Result has 218 places, 212 transitions, 482 flow [2024-11-10 14:37:44,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=218, PETRI_TRANSITIONS=212} [2024-11-10 14:37:44,105 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -25 predicate places. [2024-11-10 14:37:44,105 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 212 transitions, 482 flow [2024-11-10 14:37:44,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-10 14:37:44,106 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:44,106 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:44,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:37:44,106 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:44,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:44,106 INFO L85 PathProgramCache]: Analyzing trace with hash -162976821, now seen corresponding path program 1 times [2024-11-10 14:37:44,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:44,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053001921] [2024-11-10 14:37:44,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:44,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:44,138 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-10 14:37:44,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:44,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053001921] [2024-11-10 14:37:44,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053001921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:44,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:44,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:44,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163694853] [2024-11-10 14:37:44,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:44,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:44,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:44,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:44,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:44,160 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-11-10 14:37:44,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 212 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 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-10 14:37:44,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:44,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-11-10 14:37:44,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:44,267 INFO L124 PetriNetUnfolderBase]: 58/877 cut-off events. [2024-11-10 14:37:44,268 INFO L125 PetriNetUnfolderBase]: For 31/39 co-relation queries the response was YES. [2024-11-10 14:37:44,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1135 conditions, 877 events. 58/877 cut-off events. For 31/39 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4650 event pairs, 10 based on Foata normal form. 0/810 useless extension candidates. Maximal degree in co-relation 956. Up to 45 conditions per place. [2024-11-10 14:37:44,274 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2024-11-10 14:37:44,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 212 transitions, 507 flow [2024-11-10 14:37:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2024-11-10 14:37:44,277 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9398496240601504 [2024-11-10 14:37:44,277 INFO L175 Difference]: Start difference. First operand has 218 places, 212 transitions, 482 flow. Second operand 3 states and 750 transitions. [2024-11-10 14:37:44,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 212 transitions, 507 flow [2024-11-10 14:37:44,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 212 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:44,282 INFO L231 Difference]: Finished difference. Result has 217 places, 211 transitions, 480 flow [2024-11-10 14:37:44,283 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=217, PETRI_TRANSITIONS=211} [2024-11-10 14:37:44,283 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -26 predicate places. [2024-11-10 14:37:44,283 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 211 transitions, 480 flow [2024-11-10 14:37:44,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 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-10 14:37:44,285 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:44,285 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:44,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:37:44,285 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:44,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:44,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1809197700, now seen corresponding path program 1 times [2024-11-10 14:37:44,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:44,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170933471] [2024-11-10 14:37:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:44,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:44,338 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-10 14:37:44,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:44,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170933471] [2024-11-10 14:37:44,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170933471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:44,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:44,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:44,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021099887] [2024-11-10 14:37:44,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:44,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:44,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:44,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:44,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:44,378 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 266 [2024-11-10 14:37:44,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 211 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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-10 14:37:44,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:44,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 266 [2024-11-10 14:37:44,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:44,492 INFO L124 PetriNetUnfolderBase]: 68/901 cut-off events. [2024-11-10 14:37:44,492 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-10 14:37:44,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 901 events. 68/901 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5063 event pairs, 24 based on Foata normal form. 0/840 useless extension candidates. Maximal degree in co-relation 1143. Up to 86 conditions per place. [2024-11-10 14:37:44,498 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 14 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-11-10 14:37:44,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 211 transitions, 513 flow [2024-11-10 14:37:44,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:44,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 745 transitions. [2024-11-10 14:37:44,501 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9335839598997494 [2024-11-10 14:37:44,501 INFO L175 Difference]: Start difference. First operand has 217 places, 211 transitions, 480 flow. Second operand 3 states and 745 transitions. [2024-11-10 14:37:44,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 211 transitions, 513 flow [2024-11-10 14:37:44,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 211 transitions, 509 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:44,506 INFO L231 Difference]: Finished difference. Result has 216 places, 210 transitions, 478 flow [2024-11-10 14:37:44,506 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=478, PETRI_PLACES=216, PETRI_TRANSITIONS=210} [2024-11-10 14:37:44,507 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -27 predicate places. [2024-11-10 14:37:44,507 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 210 transitions, 478 flow [2024-11-10 14:37:44,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.66666666666666) internal successors, (737), 3 states have internal predecessors, (737), 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-10 14:37:44,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:44,508 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:44,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:37:44,509 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:44,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:44,509 INFO L85 PathProgramCache]: Analyzing trace with hash 499503161, now seen corresponding path program 1 times [2024-11-10 14:37:44,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:44,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412671461] [2024-11-10 14:37:44,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:44,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:44,546 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-10 14:37:44,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:44,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412671461] [2024-11-10 14:37:44,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412671461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:44,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:44,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:44,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507877483] [2024-11-10 14:37:44,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:44,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:44,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:44,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:44,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:44,572 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-11-10 14:37:44,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 210 transitions, 478 flow. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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-10 14:37:44,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:44,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-11-10 14:37:44,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:44,652 INFO L124 PetriNetUnfolderBase]: 72/847 cut-off events. [2024-11-10 14:37:44,653 INFO L125 PetriNetUnfolderBase]: For 57/65 co-relation queries the response was YES. [2024-11-10 14:37:44,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1147 conditions, 847 events. 72/847 cut-off events. For 57/65 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4560 event pairs, 24 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 804. Up to 95 conditions per place. [2024-11-10 14:37:44,657 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 10 selfloop transitions, 2 changer transitions 1/210 dead transitions. [2024-11-10 14:37:44,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 210 transitions, 505 flow [2024-11-10 14:37:44,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-11-10 14:37:44,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411027568922306 [2024-11-10 14:37:44,660 INFO L175 Difference]: Start difference. First operand has 216 places, 210 transitions, 478 flow. Second operand 3 states and 751 transitions. [2024-11-10 14:37:44,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 210 transitions, 505 flow [2024-11-10 14:37:44,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 210 transitions, 501 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:44,664 INFO L231 Difference]: Finished difference. Result has 215 places, 209 transitions, 476 flow [2024-11-10 14:37:44,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=476, PETRI_PLACES=215, PETRI_TRANSITIONS=209} [2024-11-10 14:37:44,665 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -28 predicate places. [2024-11-10 14:37:44,666 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 209 transitions, 476 flow [2024-11-10 14:37:44,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 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-10 14:37:44,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:44,666 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:44,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:37:44,667 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 51 more)] === [2024-11-10 14:37:44,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:44,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1294914044, now seen corresponding path program 1 times [2024-11-10 14:37:44,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:44,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784575935] [2024-11-10 14:37:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:44,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:44,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:44,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:44,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784575935] [2024-11-10 14:37:44,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784575935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:44,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:44,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:44,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607309266] [2024-11-10 14:37:44,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:44,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:44,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:44,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:44,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:44,735 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 266 [2024-11-10 14:37:44,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 209 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 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-10 14:37:44,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:44,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 266 [2024-11-10 14:37:44,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:44,838 INFO L124 PetriNetUnfolderBase]: 66/963 cut-off events. [2024-11-10 14:37:44,838 INFO L125 PetriNetUnfolderBase]: For 46/54 co-relation queries the response was YES. [2024-11-10 14:37:44,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 963 events. 66/963 cut-off events. For 46/54 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5657 event pairs, 16 based on Foata normal form. 0/906 useless extension candidates. Maximal degree in co-relation 1151. Up to 68 conditions per place. [2024-11-10 14:37:44,841 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 0 selfloop transitions, 0 changer transitions 209/209 dead transitions. [2024-11-10 14:37:44,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 209 transitions, 503 flow [2024-11-10 14:37:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:44,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2024-11-10 14:37:44,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9411027568922306 [2024-11-10 14:37:44,844 INFO L175 Difference]: Start difference. First operand has 215 places, 209 transitions, 476 flow. Second operand 3 states and 751 transitions. [2024-11-10 14:37:44,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 209 transitions, 503 flow [2024-11-10 14:37:44,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 209 transitions, 499 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:44,847 INFO L231 Difference]: Finished difference. Result has 214 places, 0 transitions, 0 flow [2024-11-10 14:37:44,847 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=214, PETRI_TRANSITIONS=0} [2024-11-10 14:37:44,848 INFO L277 CegarLoopForPetriNet]: 243 programPoint places, -29 predicate places. [2024-11-10 14:37:44,848 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 0 transitions, 0 flow [2024-11-10 14:37:44,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.66666666666666) internal successors, (746), 3 states have internal predecessors, (746), 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-10 14:37:44,852 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (54 of 55 remaining) [2024-11-10 14:37:44,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (53 of 55 remaining) [2024-11-10 14:37:44,853 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (52 of 55 remaining) [2024-11-10 14:37:44,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (51 of 55 remaining) [2024-11-10 14:37:44,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (50 of 55 remaining) [2024-11-10 14:37:44,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (49 of 55 remaining) [2024-11-10 14:37:44,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (48 of 55 remaining) [2024-11-10 14:37:44,855 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (47 of 55 remaining) [2024-11-10 14:37:44,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (46 of 55 remaining) [2024-11-10 14:37:44,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 55 remaining) [2024-11-10 14:37:44,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (44 of 55 remaining) [2024-11-10 14:37:44,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (43 of 55 remaining) [2024-11-10 14:37:44,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (42 of 55 remaining) [2024-11-10 14:37:44,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (41 of 55 remaining) [2024-11-10 14:37:44,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (40 of 55 remaining) [2024-11-10 14:37:44,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (39 of 55 remaining) [2024-11-10 14:37:44,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (38 of 55 remaining) [2024-11-10 14:37:44,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (37 of 55 remaining) [2024-11-10 14:37:44,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (36 of 55 remaining) [2024-11-10 14:37:44,856 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (35 of 55 remaining) [2024-11-10 14:37:44,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (34 of 55 remaining) [2024-11-10 14:37:44,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (33 of 55 remaining) [2024-11-10 14:37:44,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (32 of 55 remaining) [2024-11-10 14:37:44,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 55 remaining) [2024-11-10 14:37:44,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (30 of 55 remaining) [2024-11-10 14:37:44,857 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (29 of 55 remaining) [2024-11-10 14:37:44,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 55 remaining) [2024-11-10 14:37:44,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (27 of 55 remaining) [2024-11-10 14:37:44,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 55 remaining) [2024-11-10 14:37:44,858 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 55 remaining) [2024-11-10 14:37:44,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 55 remaining) [2024-11-10 14:37:44,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (23 of 55 remaining) [2024-11-10 14:37:44,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 55 remaining) [2024-11-10 14:37:44,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 55 remaining) [2024-11-10 14:37:44,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 55 remaining) [2024-11-10 14:37:44,859 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 55 remaining) [2024-11-10 14:37:44,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 55 remaining) [2024-11-10 14:37:44,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (17 of 55 remaining) [2024-11-10 14:37:44,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (16 of 55 remaining) [2024-11-10 14:37:44,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (15 of 55 remaining) [2024-11-10 14:37:44,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (14 of 55 remaining) [2024-11-10 14:37:44,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (13 of 55 remaining) [2024-11-10 14:37:44,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (12 of 55 remaining) [2024-11-10 14:37:44,860 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 55 remaining) [2024-11-10 14:37:44,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (10 of 55 remaining) [2024-11-10 14:37:44,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (9 of 55 remaining) [2024-11-10 14:37:44,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (8 of 55 remaining) [2024-11-10 14:37:44,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (7 of 55 remaining) [2024-11-10 14:37:44,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 55 remaining) [2024-11-10 14:37:44,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 55 remaining) [2024-11-10 14:37:44,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 55 remaining) [2024-11-10 14:37:44,861 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 55 remaining) [2024-11-10 14:37:44,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 55 remaining) [2024-11-10 14:37:44,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 55 remaining) [2024-11-10 14:37:44,862 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 55 remaining) [2024-11-10 14:37:44,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:37:44,862 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:44,868 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:37:44,868 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:37:44,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:37:44 BasicIcfg [2024-11-10 14:37:44,874 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:37:44,874 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:37:44,874 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:37:44,875 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:37:44,875 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:37:40" (3/4) ... [2024-11-10 14:37:44,877 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:37:44,880 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:37:44,880 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:37:44,888 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-10 14:37:44,888 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:37:44,888 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:37:44,888 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:37:44,985 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:37:44,987 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:37:44,988 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:37:44,988 INFO L158 Benchmark]: Toolchain (without parser) took 5173.15ms. Allocated memory was 176.2MB in the beginning and 312.5MB in the end (delta: 136.3MB). Free memory was 122.9MB in the beginning and 249.2MB in the end (delta: -126.3MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-11-10 14:37:44,988 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 176.2MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:37:44,989 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.58ms. Allocated memory is still 176.2MB. Free memory was 122.9MB in the beginning and 108.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 14:37:44,989 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.06ms. Allocated memory is still 176.2MB. Free memory was 108.9MB in the beginning and 107.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:37:44,989 INFO L158 Benchmark]: Boogie Preprocessor took 33.72ms. Allocated memory is still 176.2MB. Free memory was 107.4MB in the beginning and 106.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:37:44,989 INFO L158 Benchmark]: IcfgBuilder took 563.72ms. Allocated memory is still 176.2MB. Free memory was 106.1MB in the beginning and 85.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 14:37:44,990 INFO L158 Benchmark]: TraceAbstraction took 4078.89ms. Allocated memory was 176.2MB in the beginning and 312.5MB in the end (delta: 136.3MB). Free memory was 84.4MB in the beginning and 255.5MB in the end (delta: -171.1MB). Peak memory consumption was 127.3MB. Max. memory is 16.1GB. [2024-11-10 14:37:44,990 INFO L158 Benchmark]: Witness Printer took 113.41ms. Allocated memory is still 312.5MB. Free memory was 255.5MB in the beginning and 249.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 14:37:44,991 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.28ms. Allocated memory is still 176.2MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.58ms. Allocated memory is still 176.2MB. Free memory was 122.9MB in the beginning and 108.9MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.06ms. Allocated memory is still 176.2MB. Free memory was 108.9MB in the beginning and 107.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.72ms. Allocated memory is still 176.2MB. Free memory was 107.4MB in the beginning and 106.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 563.72ms. Allocated memory is still 176.2MB. Free memory was 106.1MB in the beginning and 85.1MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4078.89ms. Allocated memory was 176.2MB in the beginning and 312.5MB in the end (delta: 136.3MB). Free memory was 84.4MB in the beginning and 255.5MB in the end (delta: -171.1MB). Peak memory consumption was 127.3MB. Max. memory is 16.1GB. * Witness Printer took 113.41ms. Allocated memory is still 312.5MB. Free memory was 255.5MB in the beginning and 249.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 348 locations, 55 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: 3.9s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 640 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 610 IncrementalHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 82 mSDtfsCounter, 610 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=506occurred in iteration=0, InterpolantAutomatonStates: 60, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1700 NumberOfCodeBlocks, 1700 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1680 ConstructedInterpolants, 0 QuantifiedInterpolants, 1720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:37:45,026 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