./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/security.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/security.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 0a3d6a7be4cff77b59978ea166f504665a94bd97447fe28973d9c58d928e868d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:40:08,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:40:08,271 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:40:08,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:40:08,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:40:08,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:40:08,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:40:08,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:40:08,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:40:08,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:40:08,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:40:08,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:40:08,297 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:40:08,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:40:08,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:40:08,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:40:08,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:40:08,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:40:08,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:40:08,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:40:08,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:40:08,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:40:08,306 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:40:08,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:40:08,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:40:08,306 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:40:08,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:40:08,307 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:40:08,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:40:08,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:40:08,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:40:08,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:40:08,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:40:08,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:40:08,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:40:08,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:40:08,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:40:08,308 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:40:08,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:40:08,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:40:08,309 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:40:08,310 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 -> 0a3d6a7be4cff77b59978ea166f504665a94bd97447fe28973d9c58d928e868d [2024-11-10 14:40:08,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:40:08,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:40:08,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:40:08,533 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:40:08,534 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:40:08,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/security.wvr.c [2024-11-10 14:40:09,842 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:40:09,985 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:40:09,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/security.wvr.c [2024-11-10 14:40:09,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa6db26a/4edef3477dd3492e8d53634177035c48/FLAGcfb84ce4a [2024-11-10 14:40:10,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fa6db26a/4edef3477dd3492e8d53634177035c48 [2024-11-10 14:40:10,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:40:10,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:40:10,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:40:10,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:40:10,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:40:10,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:40:10" (1/1) ... [2024-11-10 14:40:10,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34cfcc7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:10, skipping insertion in model container [2024-11-10 14:40:10,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:40:10" (1/1) ... [2024-11-10 14:40:10,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:40:10,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:40:10,636 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:40:10,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:40:10,670 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:40:10,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:10 WrapperNode [2024-11-10 14:40:10,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:40:10,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:40:10,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:40:10,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:40:10,676 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:40:10" (1/1) ... [2024-11-10 14:40:10,681 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:40:10" (1/1) ... [2024-11-10 14:40:10,692 INFO L138 Inliner]: procedures = 20, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2024-11-10 14:40:10,692 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:40:10,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:40:10,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:40:10,693 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:40:10,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:10" (1/1) ... [2024-11-10 14:40:10,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:10" (1/1) ... [2024-11-10 14:40:10,699 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:10" (1/1) ... [2024-11-10 14:40:10,699 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:10" (1/1) ... [2024-11-10 14:40:10,702 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:10" (1/1) ... [2024-11-10 14:40:10,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:10" (1/1) ... [2024-11-10 14:40:10,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:10" (1/1) ... [2024-11-10 14:40:10,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:10" (1/1) ... [2024-11-10 14:40:10,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:40:10,705 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:40:10,705 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:40:10,705 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:40:10,706 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:10" (1/1) ... [2024-11-10 14:40:10,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:40:10,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:40:10,736 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:40:10,737 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:40:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:40:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:40:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:40:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:40:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:40:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:40:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:40:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:40:10,775 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:40:10,857 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:40:10,858 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:40:10,988 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:40:10,988 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:40:11,002 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:40:11,002 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:40:11,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:11 BoogieIcfgContainer [2024-11-10 14:40:11,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:40:11,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:40:11,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:40:11,007 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:40:11,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:40:10" (1/3) ... [2024-11-10 14:40:11,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6cc617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:40:11, skipping insertion in model container [2024-11-10 14:40:11,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:40:10" (2/3) ... [2024-11-10 14:40:11,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6cc617 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:40:11, skipping insertion in model container [2024-11-10 14:40:11,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:11" (3/3) ... [2024-11-10 14:40:11,009 INFO L112 eAbstractionObserver]: Analyzing ICFG security.wvr.c [2024-11-10 14:40:11,023 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:40:11,023 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-11-10 14:40:11,023 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:40:11,081 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:40:11,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 147 transitions, 308 flow [2024-11-10 14:40:11,218 INFO L124 PetriNetUnfolderBase]: 3/145 cut-off events. [2024-11-10 14:40:11,218 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:40:11,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 145 events. 3/145 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 215 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2024-11-10 14:40:11,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 147 transitions, 308 flow [2024-11-10 14:40:11,232 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 128 transitions, 268 flow [2024-11-10 14:40:11,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:40:11,254 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;@4ce8571, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:40:11,255 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2024-11-10 14:40:11,261 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:40:11,261 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-11-10 14:40:11,261 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:40:11,261 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:11,262 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:11,262 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:11,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:11,269 INFO L85 PathProgramCache]: Analyzing trace with hash 551453718, now seen corresponding path program 1 times [2024-11-10 14:40:11,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:11,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677866905] [2024-11-10 14:40:11,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:11,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:40:11,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:11,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677866905] [2024-11-10 14:40:11,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677866905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:11,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:11,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:11,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500344906] [2024-11-10 14:40:11,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:11,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:11,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:11,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:11,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:11,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 147 [2024-11-10 14:40:11,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 128 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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:40:11,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:11,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 147 [2024-11-10 14:40:11,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:11,555 INFO L124 PetriNetUnfolderBase]: 6/176 cut-off events. [2024-11-10 14:40:11,555 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2024-11-10 14:40:11,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 176 events. 6/176 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 408 event pairs, 3 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 150. Up to 16 conditions per place. [2024-11-10 14:40:11,558 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-11-10 14:40:11,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 127 transitions, 288 flow [2024-11-10 14:40:11,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2024-11-10 14:40:11,585 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9251700680272109 [2024-11-10 14:40:11,587 INFO L175 Difference]: Start difference. First operand has 133 places, 128 transitions, 268 flow. Second operand 3 states and 408 transitions. [2024-11-10 14:40:11,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 127 transitions, 288 flow [2024-11-10 14:40:11,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 127 transitions, 280 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 14:40:11,594 INFO L231 Difference]: Finished difference. Result has 130 places, 127 transitions, 262 flow [2024-11-10 14:40:11,596 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=130, PETRI_TRANSITIONS=127} [2024-11-10 14:40:11,603 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -3 predicate places. [2024-11-10 14:40:11,603 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 127 transitions, 262 flow [2024-11-10 14:40:11,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 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:40:11,604 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:11,604 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] [2024-11-10 14:40:11,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:40:11,604 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:11,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:11,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1776125632, now seen corresponding path program 1 times [2024-11-10 14:40:11,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:11,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011892885] [2024-11-10 14:40:11,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:11,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:11,695 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:40:11,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:11,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011892885] [2024-11-10 14:40:11,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011892885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:11,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:11,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:11,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698003472] [2024-11-10 14:40:11,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:11,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:11,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:11,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:11,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:11,710 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2024-11-10 14:40:11,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 127 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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:40:11,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:11,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2024-11-10 14:40:11,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:11,741 INFO L124 PetriNetUnfolderBase]: 8/170 cut-off events. [2024-11-10 14:40:11,742 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:40:11,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 170 events. 8/170 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 474 event pairs, 3 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 172. Up to 14 conditions per place. [2024-11-10 14:40:11,744 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 8 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-11-10 14:40:11,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 127 transitions, 283 flow [2024-11-10 14:40:11,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:11,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:11,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-11-10 14:40:11,747 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-11-10 14:40:11,747 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 262 flow. Second operand 3 states and 416 transitions. [2024-11-10 14:40:11,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 127 transitions, 283 flow [2024-11-10 14:40:11,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 127 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:11,750 INFO L231 Difference]: Finished difference. Result has 129 places, 126 transitions, 260 flow [2024-11-10 14:40:11,751 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=260, PETRI_PLACES=129, PETRI_TRANSITIONS=126} [2024-11-10 14:40:11,751 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -4 predicate places. [2024-11-10 14:40:11,751 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 126 transitions, 260 flow [2024-11-10 14:40:11,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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:40:11,752 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:11,752 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:40:11,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:40:11,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:11,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:11,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2084319982, now seen corresponding path program 1 times [2024-11-10 14:40:11,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:11,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768816485] [2024-11-10 14:40:11,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:11,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:11,814 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:40:11,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:11,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768816485] [2024-11-10 14:40:11,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768816485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:11,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:11,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:11,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060819786] [2024-11-10 14:40:11,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:11,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:11,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:11,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:11,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:11,828 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2024-11-10 14:40:11,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 126 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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:40:11,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:11,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2024-11-10 14:40:11,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:11,863 INFO L124 PetriNetUnfolderBase]: 8/169 cut-off events. [2024-11-10 14:40:11,864 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-11-10 14:40:11,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 169 events. 8/169 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 305 event pairs, 2 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 154. Up to 14 conditions per place. [2024-11-10 14:40:11,866 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 8 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2024-11-10 14:40:11,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 126 transitions, 281 flow [2024-11-10 14:40:11,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-11-10 14:40:11,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-11-10 14:40:11,869 INFO L175 Difference]: Start difference. First operand has 129 places, 126 transitions, 260 flow. Second operand 3 states and 416 transitions. [2024-11-10 14:40:11,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 126 transitions, 281 flow [2024-11-10 14:40:11,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 126 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:11,871 INFO L231 Difference]: Finished difference. Result has 128 places, 125 transitions, 258 flow [2024-11-10 14:40:11,872 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=128, PETRI_TRANSITIONS=125} [2024-11-10 14:40:11,873 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -5 predicate places. [2024-11-10 14:40:11,873 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 125 transitions, 258 flow [2024-11-10 14:40:11,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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:40:11,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:11,874 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] [2024-11-10 14:40:11,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:40:11,875 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:11,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:11,876 INFO L85 PathProgramCache]: Analyzing trace with hash 182401104, now seen corresponding path program 1 times [2024-11-10 14:40:11,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:11,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902828788] [2024-11-10 14:40:11,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:11,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:11,910 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:40:11,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:11,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902828788] [2024-11-10 14:40:11,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902828788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:11,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:11,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:11,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759784311] [2024-11-10 14:40:11,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:11,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:11,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:11,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:11,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:11,919 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 147 [2024-11-10 14:40:11,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 125 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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:40:11,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:11,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 147 [2024-11-10 14:40:11,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:11,946 INFO L124 PetriNetUnfolderBase]: 4/199 cut-off events. [2024-11-10 14:40:11,947 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:40:11,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 199 events. 4/199 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 635 event pairs, 1 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 167. Up to 8 conditions per place. [2024-11-10 14:40:11,948 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 9 selfloop transitions, 1 changer transitions 0/127 dead transitions. [2024-11-10 14:40:11,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 127 transitions, 285 flow [2024-11-10 14:40:11,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2024-11-10 14:40:11,950 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9569160997732427 [2024-11-10 14:40:11,950 INFO L175 Difference]: Start difference. First operand has 128 places, 125 transitions, 258 flow. Second operand 3 states and 422 transitions. [2024-11-10 14:40:11,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 127 transitions, 285 flow [2024-11-10 14:40:11,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 127 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:11,953 INFO L231 Difference]: Finished difference. Result has 127 places, 124 transitions, 254 flow [2024-11-10 14:40:11,953 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=127, PETRI_TRANSITIONS=124} [2024-11-10 14:40:11,954 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -6 predicate places. [2024-11-10 14:40:11,954 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 124 transitions, 254 flow [2024-11-10 14:40:11,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 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:40:11,955 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:11,955 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:11,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:40:11,955 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:11,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash -835772686, now seen corresponding path program 1 times [2024-11-10 14:40:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:11,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329979198] [2024-11-10 14:40:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:11,984 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:40:11,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:11,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329979198] [2024-11-10 14:40:11,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329979198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:11,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:11,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:11,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412760923] [2024-11-10 14:40:11,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:11,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:11,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:11,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:11,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:12,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-11-10 14:40:12,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 124 transitions, 254 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:40:12,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-11-10 14:40:12,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:12,029 INFO L124 PetriNetUnfolderBase]: 11/300 cut-off events. [2024-11-10 14:40:12,030 INFO L125 PetriNetUnfolderBase]: For 4/11 co-relation queries the response was YES. [2024-11-10 14:40:12,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 300 events. 11/300 cut-off events. For 4/11 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1198 event pairs, 5 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 207. Up to 22 conditions per place. [2024-11-10 14:40:12,031 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2024-11-10 14:40:12,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 124 transitions, 277 flow [2024-11-10 14:40:12,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:12,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-11-10 14:40:12,033 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2024-11-10 14:40:12,033 INFO L175 Difference]: Start difference. First operand has 127 places, 124 transitions, 254 flow. Second operand 3 states and 414 transitions. [2024-11-10 14:40:12,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 124 transitions, 277 flow [2024-11-10 14:40:12,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 124 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:12,035 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 255 flow [2024-11-10 14:40:12,035 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=127, PETRI_TRANSITIONS=123} [2024-11-10 14:40:12,036 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -6 predicate places. [2024-11-10 14:40:12,036 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 255 flow [2024-11-10 14:40:12,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:40:12,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:12,036 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] [2024-11-10 14:40:12,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:40:12,037 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:12,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:12,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1653726667, now seen corresponding path program 1 times [2024-11-10 14:40:12,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:12,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519718299] [2024-11-10 14:40:12,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:12,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:12,060 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:40:12,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:12,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519718299] [2024-11-10 14:40:12,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519718299] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:12,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:12,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:12,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890299855] [2024-11-10 14:40:12,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:12,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:12,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:12,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:12,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:12,073 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-11-10 14:40:12,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 123 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:40:12,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-11-10 14:40:12,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:12,098 INFO L124 PetriNetUnfolderBase]: 11/299 cut-off events. [2024-11-10 14:40:12,098 INFO L125 PetriNetUnfolderBase]: For 6/13 co-relation queries the response was YES. [2024-11-10 14:40:12,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 299 events. 11/299 cut-off events. For 6/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1216 event pairs, 5 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 212. Up to 22 conditions per place. [2024-11-10 14:40:12,100 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2024-11-10 14:40:12,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 123 transitions, 278 flow [2024-11-10 14:40:12,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:12,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:12,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-11-10 14:40:12,101 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2024-11-10 14:40:12,101 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 255 flow. Second operand 3 states and 414 transitions. [2024-11-10 14:40:12,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 123 transitions, 278 flow [2024-11-10 14:40:12,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 123 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:12,103 INFO L231 Difference]: Finished difference. Result has 126 places, 122 transitions, 253 flow [2024-11-10 14:40:12,103 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=126, PETRI_TRANSITIONS=122} [2024-11-10 14:40:12,104 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -7 predicate places. [2024-11-10 14:40:12,104 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 122 transitions, 253 flow [2024-11-10 14:40:12,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:40:12,104 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:12,104 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] [2024-11-10 14:40:12,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:40:12,105 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:12,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:12,105 INFO L85 PathProgramCache]: Analyzing trace with hash -578391635, now seen corresponding path program 1 times [2024-11-10 14:40:12,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:12,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346248636] [2024-11-10 14:40:12,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:12,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:12,130 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:40:12,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:12,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346248636] [2024-11-10 14:40:12,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346248636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:12,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:12,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:12,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707804411] [2024-11-10 14:40:12,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:12,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:12,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:12,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:12,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:12,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 147 [2024-11-10 14:40:12,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 122 transitions, 253 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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:40:12,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 147 [2024-11-10 14:40:12,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:12,165 INFO L124 PetriNetUnfolderBase]: 9/261 cut-off events. [2024-11-10 14:40:12,166 INFO L125 PetriNetUnfolderBase]: For 6/12 co-relation queries the response was YES. [2024-11-10 14:40:12,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 261 events. 9/261 cut-off events. For 6/12 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 941 event pairs, 2 based on Foata normal form. 2/229 useless extension candidates. Maximal degree in co-relation 197. Up to 16 conditions per place. [2024-11-10 14:40:12,167 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 8 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2024-11-10 14:40:12,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 122 transitions, 272 flow [2024-11-10 14:40:12,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2024-11-10 14:40:12,168 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478458049886621 [2024-11-10 14:40:12,168 INFO L175 Difference]: Start difference. First operand has 126 places, 122 transitions, 253 flow. Second operand 3 states and 418 transitions. [2024-11-10 14:40:12,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 122 transitions, 272 flow [2024-11-10 14:40:12,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 122 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:12,170 INFO L231 Difference]: Finished difference. Result has 125 places, 121 transitions, 249 flow [2024-11-10 14:40:12,170 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=125, PETRI_TRANSITIONS=121} [2024-11-10 14:40:12,171 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -8 predicate places. [2024-11-10 14:40:12,171 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 121 transitions, 249 flow [2024-11-10 14:40:12,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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:40:12,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:12,172 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] [2024-11-10 14:40:12,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:40:12,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:12,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:12,172 INFO L85 PathProgramCache]: Analyzing trace with hash 318027596, now seen corresponding path program 1 times [2024-11-10 14:40:12,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:12,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137990473] [2024-11-10 14:40:12,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:12,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:12,193 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:40:12,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:12,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137990473] [2024-11-10 14:40:12,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137990473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:12,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:12,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:12,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82716571] [2024-11-10 14:40:12,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:12,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:12,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:12,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:12,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:12,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 147 [2024-11-10 14:40:12,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 121 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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:40:12,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 147 [2024-11-10 14:40:12,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:12,227 INFO L124 PetriNetUnfolderBase]: 6/274 cut-off events. [2024-11-10 14:40:12,227 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2024-11-10 14:40:12,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 274 events. 6/274 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 881 event pairs, 4 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 163. Up to 12 conditions per place. [2024-11-10 14:40:12,229 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 8 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2024-11-10 14:40:12,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 122 transitions, 271 flow [2024-11-10 14:40:12,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:12,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2024-11-10 14:40:12,230 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9546485260770975 [2024-11-10 14:40:12,230 INFO L175 Difference]: Start difference. First operand has 125 places, 121 transitions, 249 flow. Second operand 3 states and 421 transitions. [2024-11-10 14:40:12,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 122 transitions, 271 flow [2024-11-10 14:40:12,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 122 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:12,232 INFO L231 Difference]: Finished difference. Result has 125 places, 120 transitions, 248 flow [2024-11-10 14:40:12,233 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=125, PETRI_TRANSITIONS=120} [2024-11-10 14:40:12,235 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -8 predicate places. [2024-11-10 14:40:12,235 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 120 transitions, 248 flow [2024-11-10 14:40:12,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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:40:12,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:12,236 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:40:12,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:40:12,236 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:12,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1783570706, now seen corresponding path program 1 times [2024-11-10 14:40:12,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:12,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012709871] [2024-11-10 14:40:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:12,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:12,279 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:40:12,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:12,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012709871] [2024-11-10 14:40:12,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012709871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:12,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:12,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:12,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799434896] [2024-11-10 14:40:12,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:12,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:12,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:12,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:12,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-11-10 14:40:12,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 120 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:40:12,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-11-10 14:40:12,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:12,338 INFO L124 PetriNetUnfolderBase]: 28/362 cut-off events. [2024-11-10 14:40:12,339 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-10 14:40:12,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 362 events. 28/362 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1743 event pairs, 16 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 295. Up to 70 conditions per place. [2024-11-10 14:40:12,340 INFO L140 encePairwiseOnDemand]: 143/147 looper letters, 10 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2024-11-10 14:40:12,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 121 transitions, 275 flow [2024-11-10 14:40:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-11-10 14:40:12,342 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-11-10 14:40:12,342 INFO L175 Difference]: Start difference. First operand has 125 places, 120 transitions, 248 flow. Second operand 3 states and 416 transitions. [2024-11-10 14:40:12,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 121 transitions, 275 flow [2024-11-10 14:40:12,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 121 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:12,344 INFO L231 Difference]: Finished difference. Result has 125 places, 120 transitions, 257 flow [2024-11-10 14:40:12,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=125, PETRI_TRANSITIONS=120} [2024-11-10 14:40:12,345 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -8 predicate places. [2024-11-10 14:40:12,345 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 120 transitions, 257 flow [2024-11-10 14:40:12,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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:40:12,347 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:12,347 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:12,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:40:12,347 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:12,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:12,348 INFO L85 PathProgramCache]: Analyzing trace with hash 652268590, now seen corresponding path program 1 times [2024-11-10 14:40:12,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:12,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205948142] [2024-11-10 14:40:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:12,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:12,378 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:40:12,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:12,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205948142] [2024-11-10 14:40:12,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205948142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:12,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:12,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:12,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8128097] [2024-11-10 14:40:12,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:12,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:12,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:12,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:12,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:12,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-11-10 14:40:12,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 120 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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:40:12,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-11-10 14:40:12,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:12,429 INFO L124 PetriNetUnfolderBase]: 18/287 cut-off events. [2024-11-10 14:40:12,429 INFO L125 PetriNetUnfolderBase]: For 20/22 co-relation queries the response was YES. [2024-11-10 14:40:12,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 287 events. 18/287 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1152 event pairs, 10 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 193. Up to 34 conditions per place. [2024-11-10 14:40:12,431 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2024-11-10 14:40:12,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 120 transitions, 280 flow [2024-11-10 14:40:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-11-10 14:40:12,433 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2024-11-10 14:40:12,433 INFO L175 Difference]: Start difference. First operand has 125 places, 120 transitions, 257 flow. Second operand 3 states and 414 transitions. [2024-11-10 14:40:12,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 120 transitions, 280 flow [2024-11-10 14:40:12,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 120 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:40:12,435 INFO L231 Difference]: Finished difference. Result has 126 places, 119 transitions, 259 flow [2024-11-10 14:40:12,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=259, PETRI_PLACES=126, PETRI_TRANSITIONS=119} [2024-11-10 14:40:12,436 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -7 predicate places. [2024-11-10 14:40:12,436 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 119 transitions, 259 flow [2024-11-10 14:40:12,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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:40:12,437 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:12,437 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:12,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:40:12,437 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:12,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:12,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1870168655, now seen corresponding path program 1 times [2024-11-10 14:40:12,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:12,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056378488] [2024-11-10 14:40:12,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:12,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:12,467 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:40:12,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:12,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056378488] [2024-11-10 14:40:12,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056378488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:12,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:12,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:12,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272441536] [2024-11-10 14:40:12,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:12,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:12,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:12,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:12,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:12,484 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-11-10 14:40:12,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 119 transitions, 259 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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:40:12,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-11-10 14:40:12,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:12,511 INFO L124 PetriNetUnfolderBase]: 18/284 cut-off events. [2024-11-10 14:40:12,511 INFO L125 PetriNetUnfolderBase]: For 23/25 co-relation queries the response was YES. [2024-11-10 14:40:12,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 284 events. 18/284 cut-off events. For 23/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1147 event pairs, 10 based on Foata normal form. 0/244 useless extension candidates. Maximal degree in co-relation 247. Up to 34 conditions per place. [2024-11-10 14:40:12,513 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2024-11-10 14:40:12,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 119 transitions, 282 flow [2024-11-10 14:40:12,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:12,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-11-10 14:40:12,514 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2024-11-10 14:40:12,514 INFO L175 Difference]: Start difference. First operand has 126 places, 119 transitions, 259 flow. Second operand 3 states and 414 transitions. [2024-11-10 14:40:12,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 119 transitions, 282 flow [2024-11-10 14:40:12,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 119 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:12,517 INFO L231 Difference]: Finished difference. Result has 125 places, 118 transitions, 257 flow [2024-11-10 14:40:12,517 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=125, PETRI_TRANSITIONS=118} [2024-11-10 14:40:12,517 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -8 predicate places. [2024-11-10 14:40:12,518 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 118 transitions, 257 flow [2024-11-10 14:40:12,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 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:40:12,518 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:12,518 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] [2024-11-10 14:40:12,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:40:12,520 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:12,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:12,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2085204560, now seen corresponding path program 1 times [2024-11-10 14:40:12,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:12,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954048007] [2024-11-10 14:40:12,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:12,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:12,549 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:40:12,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:12,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954048007] [2024-11-10 14:40:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954048007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:12,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:12,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:12,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667297166] [2024-11-10 14:40:12,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:12,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:12,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:12,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:12,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:12,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2024-11-10 14:40:12,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 118 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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:40:12,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2024-11-10 14:40:12,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:12,596 INFO L124 PetriNetUnfolderBase]: 12/326 cut-off events. [2024-11-10 14:40:12,596 INFO L125 PetriNetUnfolderBase]: For 6/22 co-relation queries the response was YES. [2024-11-10 14:40:12,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 326 events. 12/326 cut-off events. For 6/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1346 event pairs, 4 based on Foata normal form. 4/300 useless extension candidates. Maximal degree in co-relation 304. Up to 25 conditions per place. [2024-11-10 14:40:12,597 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 8 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2024-11-10 14:40:12,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 118 transitions, 278 flow [2024-11-10 14:40:12,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:12,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-11-10 14:40:12,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-11-10 14:40:12,599 INFO L175 Difference]: Start difference. First operand has 125 places, 118 transitions, 257 flow. Second operand 3 states and 416 transitions. [2024-11-10 14:40:12,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 118 transitions, 278 flow [2024-11-10 14:40:12,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 118 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:12,600 INFO L231 Difference]: Finished difference. Result has 124 places, 117 transitions, 255 flow [2024-11-10 14:40:12,601 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=124, PETRI_TRANSITIONS=117} [2024-11-10 14:40:12,601 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -9 predicate places. [2024-11-10 14:40:12,602 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 117 transitions, 255 flow [2024-11-10 14:40:12,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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:40:12,602 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:12,602 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] [2024-11-10 14:40:12,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:40:12,602 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:12,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1301841371, now seen corresponding path program 1 times [2024-11-10 14:40:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:12,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726230134] [2024-11-10 14:40:12,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:12,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:12,626 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:40:12,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:12,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726230134] [2024-11-10 14:40:12,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726230134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:12,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:12,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:12,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891846713] [2024-11-10 14:40:12,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:12,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:12,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:12,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:12,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:12,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 147 [2024-11-10 14:40:12,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 117 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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:40:12,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 147 [2024-11-10 14:40:12,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:12,660 INFO L124 PetriNetUnfolderBase]: 16/272 cut-off events. [2024-11-10 14:40:12,660 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2024-11-10 14:40:12,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 272 events. 16/272 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1064 event pairs, 8 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 194. Up to 24 conditions per place. [2024-11-10 14:40:12,661 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 8 selfloop transitions, 1 changer transitions 0/117 dead transitions. [2024-11-10 14:40:12,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 117 transitions, 274 flow [2024-11-10 14:40:12,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:12,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2024-11-10 14:40:12,662 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478458049886621 [2024-11-10 14:40:12,662 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 255 flow. Second operand 3 states and 418 transitions. [2024-11-10 14:40:12,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 117 transitions, 274 flow [2024-11-10 14:40:12,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 117 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:12,664 INFO L231 Difference]: Finished difference. Result has 123 places, 116 transitions, 251 flow [2024-11-10 14:40:12,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=251, PETRI_PLACES=123, PETRI_TRANSITIONS=116} [2024-11-10 14:40:12,664 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -10 predicate places. [2024-11-10 14:40:12,665 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 116 transitions, 251 flow [2024-11-10 14:40:12,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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:40:12,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:12,665 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] [2024-11-10 14:40:12,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:40:12,665 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:12,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:12,666 INFO L85 PathProgramCache]: Analyzing trace with hash -430495970, now seen corresponding path program 1 times [2024-11-10 14:40:12,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:12,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468147218] [2024-11-10 14:40:12,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:12,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:12,681 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:40:12,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:12,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468147218] [2024-11-10 14:40:12,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468147218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:12,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:12,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:12,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992470400] [2024-11-10 14:40:12,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:12,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:12,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:12,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:12,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:12,691 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2024-11-10 14:40:12,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 116 transitions, 251 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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:40:12,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2024-11-10 14:40:12,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:12,714 INFO L124 PetriNetUnfolderBase]: 20/234 cut-off events. [2024-11-10 14:40:12,714 INFO L125 PetriNetUnfolderBase]: For 22/24 co-relation queries the response was YES. [2024-11-10 14:40:12,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 234 events. 20/234 cut-off events. For 22/24 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 820 event pairs, 8 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 178. Up to 41 conditions per place. [2024-11-10 14:40:12,715 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 8 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2024-11-10 14:40:12,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 116 transitions, 272 flow [2024-11-10 14:40:12,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-11-10 14:40:12,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-11-10 14:40:12,716 INFO L175 Difference]: Start difference. First operand has 123 places, 116 transitions, 251 flow. Second operand 3 states and 416 transitions. [2024-11-10 14:40:12,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 116 transitions, 272 flow [2024-11-10 14:40:12,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 116 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:12,718 INFO L231 Difference]: Finished difference. Result has 123 places, 115 transitions, 252 flow [2024-11-10 14:40:12,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=123, PETRI_TRANSITIONS=115} [2024-11-10 14:40:12,718 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -10 predicate places. [2024-11-10 14:40:12,718 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 115 transitions, 252 flow [2024-11-10 14:40:12,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 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:40:12,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:12,719 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:40:12,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:40:12,719 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:12,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:12,719 INFO L85 PathProgramCache]: Analyzing trace with hash -269984645, now seen corresponding path program 1 times [2024-11-10 14:40:12,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:12,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077437114] [2024-11-10 14:40:12,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:12,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:12,743 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:40:12,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:12,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077437114] [2024-11-10 14:40:12,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077437114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:12,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:12,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:12,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185478732] [2024-11-10 14:40:12,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:12,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:12,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:12,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:12,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:12,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 147 [2024-11-10 14:40:12,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 115 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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:40:12,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 147 [2024-11-10 14:40:12,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:12,785 INFO L124 PetriNetUnfolderBase]: 6/290 cut-off events. [2024-11-10 14:40:12,785 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2024-11-10 14:40:12,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 290 events. 6/290 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1075 event pairs, 2 based on Foata normal form. 0/280 useless extension candidates. Maximal degree in co-relation 266. Up to 16 conditions per place. [2024-11-10 14:40:12,786 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 6 selfloop transitions, 1 changer transitions 0/114 dead transitions. [2024-11-10 14:40:12,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 114 transitions, 264 flow [2024-11-10 14:40:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:12,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2024-11-10 14:40:12,787 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9501133786848073 [2024-11-10 14:40:12,787 INFO L175 Difference]: Start difference. First operand has 123 places, 115 transitions, 252 flow. Second operand 3 states and 419 transitions. [2024-11-10 14:40:12,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 114 transitions, 264 flow [2024-11-10 14:40:12,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 114 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:40:12,789 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 248 flow [2024-11-10 14:40:12,789 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=122, PETRI_TRANSITIONS=114} [2024-11-10 14:40:12,789 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -11 predicate places. [2024-11-10 14:40:12,790 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 248 flow [2024-11-10 14:40:12,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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:40:12,790 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:40:12,790 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] [2024-11-10 14:40:12,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:40:12,790 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-10 14:40:12,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:40:12,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1286893361, now seen corresponding path program 1 times [2024-11-10 14:40:12,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:40:12,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455881949] [2024-11-10 14:40:12,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:40:12,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:40:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:40:12,811 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:40:12,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:40:12,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455881949] [2024-11-10 14:40:12,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455881949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:40:12,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:40:12,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:40:12,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139069989] [2024-11-10 14:40:12,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:40:12,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:40:12,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:40:12,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:40:12,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:40:12,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 147 [2024-11-10 14:40:12,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 114 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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:40:12,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:40:12,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 147 [2024-11-10 14:40:12,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:40:12,835 INFO L124 PetriNetUnfolderBase]: 8/198 cut-off events. [2024-11-10 14:40:12,835 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2024-11-10 14:40:12,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 198 events. 8/198 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 562 event pairs, 4 based on Foata normal form. 4/192 useless extension candidates. Maximal degree in co-relation 232. Up to 23 conditions per place. [2024-11-10 14:40:12,836 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 0 selfloop transitions, 0 changer transitions 113/113 dead transitions. [2024-11-10 14:40:12,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 113 transitions, 258 flow [2024-11-10 14:40:12,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:40:12,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:40:12,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2024-11-10 14:40:12,837 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9478458049886621 [2024-11-10 14:40:12,837 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 248 flow. Second operand 3 states and 418 transitions. [2024-11-10 14:40:12,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 113 transitions, 258 flow [2024-11-10 14:40:12,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 113 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:40:12,838 INFO L231 Difference]: Finished difference. Result has 122 places, 0 transitions, 0 flow [2024-11-10 14:40:12,838 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=122, PETRI_TRANSITIONS=0} [2024-11-10 14:40:12,839 INFO L277 CegarLoopForPetriNet]: 133 programPoint places, -11 predicate places. [2024-11-10 14:40:12,839 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 0 transitions, 0 flow [2024-11-10 14:40:12,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 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:40:12,841 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (32 of 33 remaining) [2024-11-10 14:40:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2024-11-10 14:40:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2024-11-10 14:40:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2024-11-10 14:40:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2024-11-10 14:40:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2024-11-10 14:40:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2024-11-10 14:40:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2024-11-10 14:40:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2024-11-10 14:40:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2024-11-10 14:40:12,842 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2024-11-10 14:40:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2024-11-10 14:40:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2024-11-10 14:40:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2024-11-10 14:40:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2024-11-10 14:40:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2024-11-10 14:40:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2024-11-10 14:40:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 33 remaining) [2024-11-10 14:40:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 33 remaining) [2024-11-10 14:40:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2024-11-10 14:40:12,843 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2024-11-10 14:40:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2024-11-10 14:40:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2024-11-10 14:40:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2024-11-10 14:40:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2024-11-10 14:40:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2024-11-10 14:40:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2024-11-10 14:40:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 33 remaining) [2024-11-10 14:40:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2024-11-10 14:40:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2024-11-10 14:40:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2024-11-10 14:40:12,844 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2024-11-10 14:40:12,845 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2024-11-10 14:40:12,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:40:12,845 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:40:12,849 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:40:12,849 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:40:12,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:40:12 BasicIcfg [2024-11-10 14:40:12,853 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:40:12,853 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:40:12,853 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:40:12,854 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:40:12,854 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:40:11" (3/4) ... [2024-11-10 14:40:12,855 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:40:12,858 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:40:12,858 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:40:12,860 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-10 14:40:12,861 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:40:12,861 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:40:12,861 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:40:12,917 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:40:12,917 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:40:12,917 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:40:12,918 INFO L158 Benchmark]: Toolchain (without parser) took 2504.28ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 112.5MB in the beginning and 172.6MB in the end (delta: -60.1MB). Peak memory consumption was 206.1kB. Max. memory is 16.1GB. [2024-11-10 14:40:12,918 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:40:12,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.91ms. Allocated memory is still 184.5MB. Free memory was 112.2MB in the beginning and 149.5MB in the end (delta: -37.3MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-10 14:40:12,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.38ms. Allocated memory is still 184.5MB. Free memory was 149.5MB in the beginning and 148.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:40:12,918 INFO L158 Benchmark]: Boogie Preprocessor took 12.33ms. Allocated memory is still 184.5MB. Free memory was 148.5MB in the beginning and 147.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:40:12,919 INFO L158 Benchmark]: IcfgBuilder took 297.63ms. Allocated memory is still 184.5MB. Free memory was 147.4MB in the beginning and 131.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 14:40:12,919 INFO L158 Benchmark]: TraceAbstraction took 1848.72ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 130.7MB in the beginning and 176.8MB in the end (delta: -46.2MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-10 14:40:12,919 INFO L158 Benchmark]: Witness Printer took 63.86ms. Allocated memory is still 243.3MB. Free memory was 176.8MB in the beginning and 172.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:40:12,920 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.15ms. Allocated memory is still 184.5MB. Free memory is still 139.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.91ms. Allocated memory is still 184.5MB. Free memory was 112.2MB in the beginning and 149.5MB in the end (delta: -37.3MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.38ms. Allocated memory is still 184.5MB. Free memory was 149.5MB in the beginning and 148.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.33ms. Allocated memory is still 184.5MB. Free memory was 148.5MB in the beginning and 147.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 297.63ms. Allocated memory is still 184.5MB. Free memory was 147.4MB in the beginning and 131.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1848.72ms. Allocated memory was 184.5MB in the beginning and 243.3MB in the end (delta: 58.7MB). Free memory was 130.7MB in the beginning and 176.8MB in the end (delta: -46.2MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * Witness Printer took 63.86ms. Allocated memory is still 243.3MB. Free memory was 176.8MB in the beginning and 172.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: 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, 231 locations, 33 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: 1.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 325 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 54 mSDtfsCounter, 325 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=268occurred in iteration=0, InterpolantAutomatonStates: 48, 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.4s InterpolantComputationTime, 801 NumberOfCodeBlocks, 801 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 785 ConstructedInterpolants, 0 QuantifiedInterpolants, 817 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 17 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:40:12,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE