./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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:40:16,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:40:16,525 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:40:16,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:40:16,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:40:16,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:40:16,553 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:40:16,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:40:16,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:40:16,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:40:16,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:40:16,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:40:16,559 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:40:16,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:40:16,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:40:16,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:40:16,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:40:16,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:40:16,560 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:40:16,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:40:16,561 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:40:16,562 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:40:16,562 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:40:16,562 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:40:16,563 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:40:16,563 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:40:16,563 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:40:16,563 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:40:16,563 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:40:16,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:40:16,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:40:16,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:40:16,565 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:40:16,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:40:16,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:40:16,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:40:16,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:40:16,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:40:16,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:40:16,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:40:16,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:40:16,567 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-12 12:40:16,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:40:16,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:40:16,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:40:16,821 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:40:16,821 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:40:16,822 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-12 12:40:18,242 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:40:18,420 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:40:18,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/security.wvr.c [2024-11-12 12:40:18,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1842f0f0/2d79495916d94b53b628df64c7cc677c/FLAGc6d8a5088 [2024-11-12 12:40:18,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1842f0f0/2d79495916d94b53b628df64c7cc677c [2024-11-12 12:40:18,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:40:18,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:40:18,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:40:18,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:40:18,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:40:18,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:40:18" (1/1) ... [2024-11-12 12:40:18,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e792753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:18, skipping insertion in model container [2024-11-12 12:40:18,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:40:18" (1/1) ... [2024-11-12 12:40:18,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:40:18,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:40:18,669 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:40:18,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:40:18,749 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:40:18,750 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:18 WrapperNode [2024-11-12 12:40:18,750 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:40:18,751 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:40:18,751 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:40:18,751 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:40:18,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:18" (1/1) ... [2024-11-12 12:40:18,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:18" (1/1) ... [2024-11-12 12:40:18,796 INFO L138 Inliner]: procedures = 20, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 51 [2024-11-12 12:40:18,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:40:18,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:40:18,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:40:18,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:40:18,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:18" (1/1) ... [2024-11-12 12:40:18,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:18" (1/1) ... [2024-11-12 12:40:18,811 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:18" (1/1) ... [2024-11-12 12:40:18,811 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:18" (1/1) ... [2024-11-12 12:40:18,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:18" (1/1) ... [2024-11-12 12:40:18,818 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:18" (1/1) ... [2024-11-12 12:40:18,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:18" (1/1) ... [2024-11-12 12:40:18,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:18" (1/1) ... [2024-11-12 12:40:18,821 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:40:18,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:40:18,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:40:18,822 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:40:18,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:18" (1/1) ... [2024-11-12 12:40:18,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:40:18,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:18,853 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:40:18,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:40:18,889 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:40:18,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 12:40:18,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 12:40:18,889 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 12:40:18,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 12:40:18,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:40:18,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:40:18,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:40:18,891 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:40:18,969 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:40:18,971 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:40:19,122 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:40:19,122 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:40:19,135 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:40:19,136 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-12 12:40:19,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:19 BoogieIcfgContainer [2024-11-12 12:40:19,136 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:40:19,138 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:40:19,138 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:40:19,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:40:19,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:40:18" (1/3) ... [2024-11-12 12:40:19,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a99cdde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:40:19, skipping insertion in model container [2024-11-12 12:40:19,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:18" (2/3) ... [2024-11-12 12:40:19,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a99cdde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:40:19, skipping insertion in model container [2024-11-12 12:40:19,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:19" (3/3) ... [2024-11-12 12:40:19,147 INFO L112 eAbstractionObserver]: Analyzing ICFG security.wvr.c [2024-11-12 12:40:19,161 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:40:19,161 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 17 error locations. [2024-11-12 12:40:19,162 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:40:19,244 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 12:40:19,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 147 transitions, 308 flow [2024-11-12 12:40:19,319 INFO L124 PetriNetUnfolderBase]: 3/145 cut-off events. [2024-11-12 12:40:19,320 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 12:40:19,328 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 6. Compared 203 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-12 12:40:19,330 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 147 transitions, 308 flow [2024-11-12 12:40:19,334 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 128 transitions, 268 flow [2024-11-12 12:40:19,341 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:40:19,347 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;@112174e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:40:19,348 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2024-11-12 12:40:19,353 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:40:19,353 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-11-12 12:40:19,353 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:40:19,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:19,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:19,355 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:19,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:19,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1652043013, now seen corresponding path program 1 times [2024-11-12 12:40:19,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:19,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758255728] [2024-11-12 12:40:19,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:19,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:19,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:19,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758255728] [2024-11-12 12:40:19,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758255728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:19,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:19,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:19,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124440675] [2024-11-12 12:40:19,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:19,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:19,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:19,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:19,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:19,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 147 [2024-11-12 12:40:19,605 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-12 12:40:19,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:19,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 147 [2024-11-12 12:40:19,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:19,676 INFO L124 PetriNetUnfolderBase]: 6/176 cut-off events. [2024-11-12 12:40:19,677 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2024-11-12 12:40:19,678 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 402 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-12 12:40:19,681 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-11-12 12:40:19,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 127 transitions, 288 flow [2024-11-12 12:40:19,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:19,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2024-11-12 12:40:19,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9251700680272109 [2024-11-12 12:40:19,720 INFO L175 Difference]: Start difference. First operand has 133 places, 128 transitions, 268 flow. Second operand 3 states and 408 transitions. [2024-11-12 12:40:19,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 127 transitions, 288 flow [2024-11-12 12:40:19,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 127 transitions, 280 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 12:40:19,733 INFO L231 Difference]: Finished difference. Result has 130 places, 127 transitions, 262 flow [2024-11-12 12:40:19,735 INFO L262 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-12 12:40:19,763 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -3 predicate places. [2024-11-12 12:40:19,764 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 127 transitions, 262 flow [2024-11-12 12:40:19,764 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-12 12:40:19,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:19,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:19,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:40:19,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:19,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:19,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1233895533, now seen corresponding path program 1 times [2024-11-12 12:40:19,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:19,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892601766] [2024-11-12 12:40:19,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:19,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:19,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:19,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892601766] [2024-11-12 12:40:19,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892601766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:19,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:19,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:19,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383905251] [2024-11-12 12:40:19,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:19,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:19,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:19,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:19,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:19,859 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2024-11-12 12:40:19,860 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-12 12:40:19,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:19,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2024-11-12 12:40:19,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:19,896 INFO L124 PetriNetUnfolderBase]: 8/170 cut-off events. [2024-11-12 12:40:19,897 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-12 12:40:19,898 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 471 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-12 12:40:19,898 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 8 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-11-12 12:40:19,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 127 transitions, 283 flow [2024-11-12 12:40:19,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-11-12 12:40:19,901 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-11-12 12:40:19,901 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 262 flow. Second operand 3 states and 416 transitions. [2024-11-12 12:40:19,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 127 transitions, 283 flow [2024-11-12 12:40:19,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 127 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:19,904 INFO L231 Difference]: Finished difference. Result has 129 places, 126 transitions, 260 flow [2024-11-12 12:40:19,904 INFO L262 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-12 12:40:19,905 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -4 predicate places. [2024-11-12 12:40:19,905 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 126 transitions, 260 flow [2024-11-12 12:40:19,905 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-12 12:40:19,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:19,905 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:19,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:40:19,905 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:19,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:19,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1432322502, now seen corresponding path program 1 times [2024-11-12 12:40:19,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:19,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022012408] [2024-11-12 12:40:19,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:19,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:19,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:19,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:19,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022012408] [2024-11-12 12:40:19,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022012408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:19,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:19,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:19,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112316913] [2024-11-12 12:40:19,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:19,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:19,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:19,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:19,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:19,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2024-11-12 12:40:19,962 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-12 12:40:19,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:19,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2024-11-12 12:40:19,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:19,987 INFO L124 PetriNetUnfolderBase]: 8/169 cut-off events. [2024-11-12 12:40:19,987 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-11-12 12:40:19,989 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 290 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-12 12:40:19,989 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 8 selfloop transitions, 2 changer transitions 0/126 dead transitions. [2024-11-12 12:40:19,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 126 transitions, 281 flow [2024-11-12 12:40:19,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-11-12 12:40:19,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-11-12 12:40:19,991 INFO L175 Difference]: Start difference. First operand has 129 places, 126 transitions, 260 flow. Second operand 3 states and 416 transitions. [2024-11-12 12:40:19,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 126 transitions, 281 flow [2024-11-12 12:40:19,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 126 transitions, 277 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:19,993 INFO L231 Difference]: Finished difference. Result has 128 places, 125 transitions, 258 flow [2024-11-12 12:40:19,994 INFO L262 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-12 12:40:19,994 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -5 predicate places. [2024-11-12 12:40:19,994 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 125 transitions, 258 flow [2024-11-12 12:40:19,995 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-12 12:40:19,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:19,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:19,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:40:19,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:19,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1053979864, now seen corresponding path program 1 times [2024-11-12 12:40:19,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:19,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141691956] [2024-11-12 12:40:19,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:20,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:20,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141691956] [2024-11-12 12:40:20,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141691956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:20,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:20,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:20,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115739841] [2024-11-12 12:40:20,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:20,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:20,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:20,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:20,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:20,039 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 147 [2024-11-12 12:40:20,039 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-12 12:40:20,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:20,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 147 [2024-11-12 12:40:20,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:20,087 INFO L124 PetriNetUnfolderBase]: 4/199 cut-off events. [2024-11-12 12:40:20,087 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 12:40:20,088 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 628 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-12 12:40:20,089 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 9 selfloop transitions, 1 changer transitions 0/127 dead transitions. [2024-11-12 12:40:20,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 127 transitions, 285 flow [2024-11-12 12:40:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2024-11-12 12:40:20,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9569160997732427 [2024-11-12 12:40:20,090 INFO L175 Difference]: Start difference. First operand has 128 places, 125 transitions, 258 flow. Second operand 3 states and 422 transitions. [2024-11-12 12:40:20,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 127 transitions, 285 flow [2024-11-12 12:40:20,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 127 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:20,093 INFO L231 Difference]: Finished difference. Result has 127 places, 124 transitions, 254 flow [2024-11-12 12:40:20,093 INFO L262 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-12 12:40:20,094 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -6 predicate places. [2024-11-12 12:40:20,094 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 124 transitions, 254 flow [2024-11-12 12:40:20,094 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-12 12:40:20,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:20,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:20,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:40:20,095 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:20,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:20,095 INFO L85 PathProgramCache]: Analyzing trace with hash 708059466, now seen corresponding path program 1 times [2024-11-12 12:40:20,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:20,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724786091] [2024-11-12 12:40:20,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:20,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:20,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:20,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724786091] [2024-11-12 12:40:20,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724786091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:20,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:20,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:20,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888394843] [2024-11-12 12:40:20,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:20,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:20,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:20,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:20,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:20,151 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-11-12 12:40:20,152 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-12 12:40:20,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:20,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-11-12 12:40:20,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:20,193 INFO L124 PetriNetUnfolderBase]: 11/300 cut-off events. [2024-11-12 12:40:20,193 INFO L125 PetriNetUnfolderBase]: For 4/11 co-relation queries the response was YES. [2024-11-12 12:40:20,194 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 1203 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-12 12:40:20,195 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2024-11-12 12:40:20,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 124 transitions, 277 flow [2024-11-12 12:40:20,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:20,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-11-12 12:40:20,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2024-11-12 12:40:20,197 INFO L175 Difference]: Start difference. First operand has 127 places, 124 transitions, 254 flow. Second operand 3 states and 414 transitions. [2024-11-12 12:40:20,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 124 transitions, 277 flow [2024-11-12 12:40:20,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 124 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:20,200 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 255 flow [2024-11-12 12:40:20,201 INFO L262 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-12 12:40:20,202 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -6 predicate places. [2024-11-12 12:40:20,202 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 255 flow [2024-11-12 12:40:20,203 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-12 12:40:20,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:20,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:20,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:40:20,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:20,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash 206179214, now seen corresponding path program 1 times [2024-11-12 12:40:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:20,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662119122] [2024-11-12 12:40:20,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:20,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:20,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662119122] [2024-11-12 12:40:20,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662119122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:20,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:20,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:20,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102611996] [2024-11-12 12:40:20,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:20,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:20,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:20,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:20,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:20,286 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-11-12 12:40:20,287 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-12 12:40:20,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:20,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-11-12 12:40:20,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:20,328 INFO L124 PetriNetUnfolderBase]: 11/299 cut-off events. [2024-11-12 12:40:20,329 INFO L125 PetriNetUnfolderBase]: For 6/13 co-relation queries the response was YES. [2024-11-12 12:40:20,330 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 1212 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-12 12:40:20,331 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/123 dead transitions. [2024-11-12 12:40:20,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 123 transitions, 278 flow [2024-11-12 12:40:20,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-11-12 12:40:20,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2024-11-12 12:40:20,333 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 255 flow. Second operand 3 states and 414 transitions. [2024-11-12 12:40:20,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 123 transitions, 278 flow [2024-11-12 12:40:20,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 123 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:20,336 INFO L231 Difference]: Finished difference. Result has 126 places, 122 transitions, 253 flow [2024-11-12 12:40:20,336 INFO L262 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-12 12:40:20,337 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -7 predicate places. [2024-11-12 12:40:20,338 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 122 transitions, 253 flow [2024-11-12 12:40:20,338 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-12 12:40:20,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:20,339 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:20,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:40:20,339 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:20,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:20,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1215516512, now seen corresponding path program 1 times [2024-11-12 12:40:20,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:20,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516746252] [2024-11-12 12:40:20,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:20,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:20,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:20,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516746252] [2024-11-12 12:40:20,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516746252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:20,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:20,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:20,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291027412] [2024-11-12 12:40:20,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:20,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:20,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:20,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:20,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:20,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 147 [2024-11-12 12:40:20,407 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-12 12:40:20,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:20,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 147 [2024-11-12 12:40:20,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:20,440 INFO L124 PetriNetUnfolderBase]: 9/261 cut-off events. [2024-11-12 12:40:20,440 INFO L125 PetriNetUnfolderBase]: For 6/12 co-relation queries the response was YES. [2024-11-12 12:40:20,441 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 938 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-12 12:40:20,441 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 8 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2024-11-12 12:40:20,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 122 transitions, 272 flow [2024-11-12 12:40:20,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:20,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:20,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2024-11-12 12:40:20,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9478458049886621 [2024-11-12 12:40:20,445 INFO L175 Difference]: Start difference. First operand has 126 places, 122 transitions, 253 flow. Second operand 3 states and 418 transitions. [2024-11-12 12:40:20,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 122 transitions, 272 flow [2024-11-12 12:40:20,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 122 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:20,447 INFO L231 Difference]: Finished difference. Result has 125 places, 121 transitions, 249 flow [2024-11-12 12:40:20,447 INFO L262 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-12 12:40:20,448 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -8 predicate places. [2024-11-12 12:40:20,448 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 121 transitions, 249 flow [2024-11-12 12:40:20,449 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-12 12:40:20,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:20,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:20,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:40:20,449 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:20,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:20,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1260704255, now seen corresponding path program 1 times [2024-11-12 12:40:20,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:20,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9027433] [2024-11-12 12:40:20,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:20,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:20,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:20,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9027433] [2024-11-12 12:40:20,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9027433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:20,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:20,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:20,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840404347] [2024-11-12 12:40:20,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:20,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:20,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:20,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:20,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:20,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 147 [2024-11-12 12:40:20,503 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-12 12:40:20,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:20,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 147 [2024-11-12 12:40:20,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:20,534 INFO L124 PetriNetUnfolderBase]: 6/274 cut-off events. [2024-11-12 12:40:20,534 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2024-11-12 12:40:20,534 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 880 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-12 12:40:20,535 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 8 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2024-11-12 12:40:20,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 122 transitions, 271 flow [2024-11-12 12:40:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:20,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2024-11-12 12:40:20,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9546485260770975 [2024-11-12 12:40:20,537 INFO L175 Difference]: Start difference. First operand has 125 places, 121 transitions, 249 flow. Second operand 3 states and 421 transitions. [2024-11-12 12:40:20,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 122 transitions, 271 flow [2024-11-12 12:40:20,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 122 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:20,540 INFO L231 Difference]: Finished difference. Result has 125 places, 120 transitions, 248 flow [2024-11-12 12:40:20,540 INFO L262 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-12 12:40:20,543 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -8 predicate places. [2024-11-12 12:40:20,543 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 120 transitions, 248 flow [2024-11-12 12:40:20,544 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-12 12:40:20,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:20,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:20,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:40:20,545 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:20,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:20,545 INFO L85 PathProgramCache]: Analyzing trace with hash -119724766, now seen corresponding path program 1 times [2024-11-12 12:40:20,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:20,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069191337] [2024-11-12 12:40:20,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:20,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:20,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:20,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:20,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069191337] [2024-11-12 12:40:20,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069191337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:20,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:20,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:20,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424430456] [2024-11-12 12:40:20,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:20,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:20,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:20,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:20,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:20,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-11-12 12:40:20,586 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-12 12:40:20,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:20,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-11-12 12:40:20,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:20,619 INFO L124 PetriNetUnfolderBase]: 28/362 cut-off events. [2024-11-12 12:40:20,619 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-12 12:40:20,620 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 1749 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-12 12:40:20,621 INFO L140 encePairwiseOnDemand]: 143/147 looper letters, 10 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2024-11-12 12:40:20,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 121 transitions, 275 flow [2024-11-12 12:40:20,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-11-12 12:40:20,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-11-12 12:40:20,622 INFO L175 Difference]: Start difference. First operand has 125 places, 120 transitions, 248 flow. Second operand 3 states and 416 transitions. [2024-11-12 12:40:20,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 121 transitions, 275 flow [2024-11-12 12:40:20,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 121 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:20,625 INFO L231 Difference]: Finished difference. Result has 125 places, 120 transitions, 257 flow [2024-11-12 12:40:20,625 INFO L262 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-12 12:40:20,626 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -8 predicate places. [2024-11-12 12:40:20,626 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 120 transitions, 257 flow [2024-11-12 12:40:20,626 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-12 12:40:20,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:20,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:20,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:40:20,627 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:20,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:20,628 INFO L85 PathProgramCache]: Analyzing trace with hash 326439841, now seen corresponding path program 1 times [2024-11-12 12:40:20,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:20,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453262733] [2024-11-12 12:40:20,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:20,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:20,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:20,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453262733] [2024-11-12 12:40:20,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453262733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:20,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:20,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:20,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546461230] [2024-11-12 12:40:20,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:20,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:20,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:20,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:20,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:20,677 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-11-12 12:40:20,678 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-12 12:40:20,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:20,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-11-12 12:40:20,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:20,719 INFO L124 PetriNetUnfolderBase]: 18/287 cut-off events. [2024-11-12 12:40:20,720 INFO L125 PetriNetUnfolderBase]: For 20/22 co-relation queries the response was YES. [2024-11-12 12:40:20,720 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 1162 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-12 12:40:20,721 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2024-11-12 12:40:20,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 120 transitions, 280 flow [2024-11-12 12:40:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:20,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-11-12 12:40:20,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2024-11-12 12:40:20,722 INFO L175 Difference]: Start difference. First operand has 125 places, 120 transitions, 257 flow. Second operand 3 states and 414 transitions. [2024-11-12 12:40:20,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 120 transitions, 280 flow [2024-11-12 12:40:20,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 120 transitions, 280 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:40:20,724 INFO L231 Difference]: Finished difference. Result has 126 places, 119 transitions, 259 flow [2024-11-12 12:40:20,724 INFO L262 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-12 12:40:20,725 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -7 predicate places. [2024-11-12 12:40:20,725 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 119 transitions, 259 flow [2024-11-12 12:40:20,726 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-12 12:40:20,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:20,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:20,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:40:20,726 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:20,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:20,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1458058907, now seen corresponding path program 1 times [2024-11-12 12:40:20,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:20,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172774338] [2024-11-12 12:40:20,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:20,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:20,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:20,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172774338] [2024-11-12 12:40:20,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172774338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:20,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:20,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:20,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834915447] [2024-11-12 12:40:20,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:20,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:20,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:20,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:20,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:20,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 147 [2024-11-12 12:40:20,777 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-12 12:40:20,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:20,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 147 [2024-11-12 12:40:20,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:20,799 INFO L124 PetriNetUnfolderBase]: 18/284 cut-off events. [2024-11-12 12:40:20,800 INFO L125 PetriNetUnfolderBase]: For 23/25 co-relation queries the response was YES. [2024-11-12 12:40:20,800 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 1153 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-12 12:40:20,801 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 9 selfloop transitions, 2 changer transitions 0/119 dead transitions. [2024-11-12 12:40:20,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 119 transitions, 282 flow [2024-11-12 12:40:20,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:20,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 414 transitions. [2024-11-12 12:40:20,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9387755102040817 [2024-11-12 12:40:20,802 INFO L175 Difference]: Start difference. First operand has 126 places, 119 transitions, 259 flow. Second operand 3 states and 414 transitions. [2024-11-12 12:40:20,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 119 transitions, 282 flow [2024-11-12 12:40:20,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 119 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:20,804 INFO L231 Difference]: Finished difference. Result has 125 places, 118 transitions, 257 flow [2024-11-12 12:40:20,804 INFO L262 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-12 12:40:20,804 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -8 predicate places. [2024-11-12 12:40:20,804 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 118 transitions, 257 flow [2024-11-12 12:40:20,805 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-12 12:40:20,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:20,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:20,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:40:20,807 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:20,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:20,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1313807461, now seen corresponding path program 1 times [2024-11-12 12:40:20,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:20,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072534659] [2024-11-12 12:40:20,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:20,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:20,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:20,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072534659] [2024-11-12 12:40:20,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072534659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:20,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:20,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:20,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303141397] [2024-11-12 12:40:20,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:20,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:20,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:20,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:20,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:20,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2024-11-12 12:40:20,849 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-12 12:40:20,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:20,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2024-11-12 12:40:20,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:20,873 INFO L124 PetriNetUnfolderBase]: 12/326 cut-off events. [2024-11-12 12:40:20,873 INFO L125 PetriNetUnfolderBase]: For 6/22 co-relation queries the response was YES. [2024-11-12 12:40:20,874 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 1335 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-12 12:40:20,874 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 8 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2024-11-12 12:40:20,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 118 transitions, 278 flow [2024-11-12 12:40:20,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-11-12 12:40:20,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-11-12 12:40:20,875 INFO L175 Difference]: Start difference. First operand has 125 places, 118 transitions, 257 flow. Second operand 3 states and 416 transitions. [2024-11-12 12:40:20,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 118 transitions, 278 flow [2024-11-12 12:40:20,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 118 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:20,877 INFO L231 Difference]: Finished difference. Result has 124 places, 117 transitions, 255 flow [2024-11-12 12:40:20,877 INFO L262 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-12 12:40:20,878 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -9 predicate places. [2024-11-12 12:40:20,878 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 117 transitions, 255 flow [2024-11-12 12:40:20,878 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-12 12:40:20,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:20,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:20,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:40:20,879 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:20,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:20,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1163742355, now seen corresponding path program 1 times [2024-11-12 12:40:20,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:20,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587688187] [2024-11-12 12:40:20,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:20,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:20,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:20,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587688187] [2024-11-12 12:40:20,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587688187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:20,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:20,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:20,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116745271] [2024-11-12 12:40:20,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:20,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:20,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:20,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:20,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:20,916 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 147 [2024-11-12 12:40:20,917 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-12 12:40:20,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:20,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 147 [2024-11-12 12:40:20,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:20,937 INFO L124 PetriNetUnfolderBase]: 16/272 cut-off events. [2024-11-12 12:40:20,937 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2024-11-12 12:40:20,937 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 1072 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-12 12:40:20,938 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 8 selfloop transitions, 1 changer transitions 0/117 dead transitions. [2024-11-12 12:40:20,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 117 transitions, 274 flow [2024-11-12 12:40:20,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:20,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:20,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2024-11-12 12:40:20,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9478458049886621 [2024-11-12 12:40:20,939 INFO L175 Difference]: Start difference. First operand has 124 places, 117 transitions, 255 flow. Second operand 3 states and 418 transitions. [2024-11-12 12:40:20,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 117 transitions, 274 flow [2024-11-12 12:40:20,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 117 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:20,940 INFO L231 Difference]: Finished difference. Result has 123 places, 116 transitions, 251 flow [2024-11-12 12:40:20,941 INFO L262 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-12 12:40:20,941 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -10 predicate places. [2024-11-12 12:40:20,942 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 116 transitions, 251 flow [2024-11-12 12:40:20,943 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-12 12:40:20,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:20,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:20,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:40:20,944 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:20,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:20,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1795930344, now seen corresponding path program 1 times [2024-11-12 12:40:20,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:20,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060623061] [2024-11-12 12:40:20,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:20,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:20,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:20,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:20,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:20,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060623061] [2024-11-12 12:40:20,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060623061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:20,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:20,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:20,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531340967] [2024-11-12 12:40:20,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:20,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:20,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:20,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:20,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:20,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 147 [2024-11-12 12:40:20,988 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-12 12:40:20,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:20,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 147 [2024-11-12 12:40:20,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:21,010 INFO L124 PetriNetUnfolderBase]: 20/234 cut-off events. [2024-11-12 12:40:21,010 INFO L125 PetriNetUnfolderBase]: For 22/24 co-relation queries the response was YES. [2024-11-12 12:40:21,010 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 815 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-12 12:40:21,011 INFO L140 encePairwiseOnDemand]: 144/147 looper letters, 8 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2024-11-12 12:40:21,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 116 transitions, 272 flow [2024-11-12 12:40:21,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2024-11-12 12:40:21,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9433106575963719 [2024-11-12 12:40:21,012 INFO L175 Difference]: Start difference. First operand has 123 places, 116 transitions, 251 flow. Second operand 3 states and 416 transitions. [2024-11-12 12:40:21,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 116 transitions, 272 flow [2024-11-12 12:40:21,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 116 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:21,015 INFO L231 Difference]: Finished difference. Result has 123 places, 115 transitions, 252 flow [2024-11-12 12:40:21,015 INFO L262 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-12 12:40:21,016 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -10 predicate places. [2024-11-12 12:40:21,016 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 115 transitions, 252 flow [2024-11-12 12:40:21,016 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-12 12:40:21,016 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:21,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:21,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:40:21,017 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:21,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:21,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1475737072, now seen corresponding path program 1 times [2024-11-12 12:40:21,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:21,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809911618] [2024-11-12 12:40:21,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:21,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:21,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:21,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809911618] [2024-11-12 12:40:21,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809911618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:21,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:21,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:21,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109115170] [2024-11-12 12:40:21,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:21,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:21,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:21,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:21,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:21,063 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 147 [2024-11-12 12:40:21,064 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-12 12:40:21,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:21,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 147 [2024-11-12 12:40:21,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:21,083 INFO L124 PetriNetUnfolderBase]: 6/290 cut-off events. [2024-11-12 12:40:21,083 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2024-11-12 12:40:21,083 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 1071 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-12 12:40:21,084 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 6 selfloop transitions, 1 changer transitions 0/114 dead transitions. [2024-11-12 12:40:21,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 114 transitions, 264 flow [2024-11-12 12:40:21,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:21,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2024-11-12 12:40:21,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9501133786848073 [2024-11-12 12:40:21,085 INFO L175 Difference]: Start difference. First operand has 123 places, 115 transitions, 252 flow. Second operand 3 states and 419 transitions. [2024-11-12 12:40:21,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 114 transitions, 264 flow [2024-11-12 12:40:21,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 114 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:21,087 INFO L231 Difference]: Finished difference. Result has 122 places, 114 transitions, 248 flow [2024-11-12 12:40:21,087 INFO L262 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-12 12:40:21,088 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -11 predicate places. [2024-11-12 12:40:21,088 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 114 transitions, 248 flow [2024-11-12 12:40:21,088 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-12 12:40:21,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:21,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:21,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:40:21,089 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 29 more)] === [2024-11-12 12:40:21,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:21,089 INFO L85 PathProgramCache]: Analyzing trace with hash -864598165, now seen corresponding path program 1 times [2024-11-12 12:40:21,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:21,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187337195] [2024-11-12 12:40:21,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:21,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:21,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:21,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187337195] [2024-11-12 12:40:21,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187337195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:21,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:21,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:21,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049859417] [2024-11-12 12:40:21,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:21,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:21,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:21,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:21,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:21,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 147 [2024-11-12 12:40:21,126 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-12 12:40:21,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:21,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 147 [2024-11-12 12:40:21,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:21,140 INFO L124 PetriNetUnfolderBase]: 8/198 cut-off events. [2024-11-12 12:40:21,140 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2024-11-12 12:40:21,140 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 560 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-12 12:40:21,140 INFO L140 encePairwiseOnDemand]: 145/147 looper letters, 0 selfloop transitions, 0 changer transitions 113/113 dead transitions. [2024-11-12 12:40:21,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 113 transitions, 258 flow [2024-11-12 12:40:21,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2024-11-12 12:40:21,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9478458049886621 [2024-11-12 12:40:21,141 INFO L175 Difference]: Start difference. First operand has 122 places, 114 transitions, 248 flow. Second operand 3 states and 418 transitions. [2024-11-12 12:40:21,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 113 transitions, 258 flow [2024-11-12 12:40:21,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 113 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:21,142 INFO L231 Difference]: Finished difference. Result has 122 places, 0 transitions, 0 flow [2024-11-12 12:40:21,143 INFO L262 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-12 12:40:21,143 INFO L279 CegarLoopForPetriNet]: 133 programPoint places, -11 predicate places. [2024-11-12 12:40:21,143 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 0 transitions, 0 flow [2024-11-12 12:40:21,143 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-12 12:40:21,145 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (32 of 33 remaining) [2024-11-12 12:40:21,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2024-11-12 12:40:21,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2024-11-12 12:40:21,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2024-11-12 12:40:21,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2024-11-12 12:40:21,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2024-11-12 12:40:21,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2024-11-12 12:40:21,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2024-11-12 12:40:21,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2024-11-12 12:40:21,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2024-11-12 12:40:21,146 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2024-11-12 12:40:21,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2024-11-12 12:40:21,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2024-11-12 12:40:21,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2024-11-12 12:40:21,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2024-11-12 12:40:21,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2024-11-12 12:40:21,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2024-11-12 12:40:21,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 33 remaining) [2024-11-12 12:40:21,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 33 remaining) [2024-11-12 12:40:21,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2024-11-12 12:40:21,147 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2024-11-12 12:40:21,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2024-11-12 12:40:21,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2024-11-12 12:40:21,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2024-11-12 12:40:21,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2024-11-12 12:40:21,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2024-11-12 12:40:21,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2024-11-12 12:40:21,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (5 of 33 remaining) [2024-11-12 12:40:21,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2024-11-12 12:40:21,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2024-11-12 12:40:21,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2024-11-12 12:40:21,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2024-11-12 12:40:21,148 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2024-11-12 12:40:21,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 12:40:21,149 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:21,152 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 12:40:21,152 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:40:21,156 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:40:21 BasicIcfg [2024-11-12 12:40:21,156 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:40:21,156 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:40:21,156 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:40:21,156 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:40:21,156 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:19" (3/4) ... [2024-11-12 12:40:21,158 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 12:40:21,160 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-12 12:40:21,160 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-12 12:40:21,163 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-12 12:40:21,163 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 12:40:21,163 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 12:40:21,163 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 12:40:21,219 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:40:21,219 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 12:40:21,219 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:40:21,219 INFO L158 Benchmark]: Toolchain (without parser) took 2772.18ms. Allocated memory was 155.2MB in the beginning and 299.9MB in the end (delta: 144.7MB). Free memory was 83.3MB in the beginning and 120.4MB in the end (delta: -37.0MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. [2024-11-12 12:40:21,220 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 155.2MB. Free memory was 106.3MB in the beginning and 106.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:40:21,220 INFO L158 Benchmark]: CACSL2BoogieTranslator took 300.62ms. Allocated memory is still 155.2MB. Free memory was 83.2MB in the beginning and 124.8MB in the end (delta: -41.7MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2024-11-12 12:40:21,220 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.52ms. Allocated memory was 155.2MB in the beginning and 299.9MB in the end (delta: 144.7MB). Free memory was 124.8MB in the beginning and 272.3MB in the end (delta: -147.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:40:21,220 INFO L158 Benchmark]: Boogie Preprocessor took 23.83ms. Allocated memory is still 299.9MB. Free memory was 272.3MB in the beginning and 271.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:40:21,220 INFO L158 Benchmark]: RCFGBuilder took 314.94ms. Allocated memory is still 299.9MB. Free memory was 271.3MB in the beginning and 255.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 12:40:21,220 INFO L158 Benchmark]: TraceAbstraction took 2017.99ms. Allocated memory is still 299.9MB. Free memory was 254.5MB in the beginning and 125.6MB in the end (delta: 128.9MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. [2024-11-12 12:40:21,220 INFO L158 Benchmark]: Witness Printer took 63.04ms. Allocated memory is still 299.9MB. Free memory was 125.6MB in the beginning and 120.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:40:21,226 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.11ms. Allocated memory is still 155.2MB. Free memory was 106.3MB in the beginning and 106.2MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 300.62ms. Allocated memory is still 155.2MB. Free memory was 83.2MB in the beginning and 124.8MB in the end (delta: -41.7MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.52ms. Allocated memory was 155.2MB in the beginning and 299.9MB in the end (delta: 144.7MB). Free memory was 124.8MB in the beginning and 272.3MB in the end (delta: -147.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.83ms. Allocated memory is still 299.9MB. Free memory was 272.3MB in the beginning and 271.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 314.94ms. Allocated memory is still 299.9MB. Free memory was 271.3MB in the beginning and 255.5MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2017.99ms. Allocated memory is still 299.9MB. Free memory was 254.5MB in the beginning and 125.6MB in the end (delta: 128.9MB). Peak memory consumption was 130.0MB. Max. memory is 16.1GB. * Witness Printer took 63.04ms. Allocated memory is still 299.9MB. Free memory was 125.6MB in the beginning and 120.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, 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-12 12:40:21,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE