./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d 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/chl-word-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:44:22,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:44:22,399 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:44:22,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:44:22,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:44:22,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:44:22,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:44:22,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:44:22,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:44:22,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:44:22,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:44:22,440 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:44:22,440 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:44:22,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:44:22,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:44:22,441 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:44:22,441 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:44:22,441 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:44:22,441 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:44:22,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:44:22,442 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:44:22,442 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:44:22,446 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:44:22,446 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:44:22,447 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:44:22,447 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:44:22,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:44:22,447 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:44:22,447 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:44:22,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:44:22,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:44:22,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:44:22,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:44:22,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:44:22,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:44:22,449 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:44:22,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:44:22,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:44:22,449 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:44:22,449 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:44:22,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:44:22,450 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 -> bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e [2024-11-16 23:44:22,683 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:44:22,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:44:22,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:44:22,710 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:44:22,711 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:44:22,712 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2024-11-16 23:44:24,120 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:44:24,291 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:44:24,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2024-11-16 23:44:24,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143ae0382/63efc892db3143f48a0d877cbbf659d9/FLAGc3daf3371 [2024-11-16 23:44:24,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143ae0382/63efc892db3143f48a0d877cbbf659d9 [2024-11-16 23:44:24,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:44:24,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:44:24,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:44:24,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:44:24,322 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:44:24,325 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:44:24" (1/1) ... [2024-11-16 23:44:24,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e6ce96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:24, skipping insertion in model container [2024-11-16 23:44:24,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:44:24" (1/1) ... [2024-11-16 23:44:24,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:44:24,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:44:24,618 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:44:24,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:44:24,674 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:44:24,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:24 WrapperNode [2024-11-16 23:44:24,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:44:24,676 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:44:24,676 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:44:24,676 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:44:24,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:24" (1/1) ... [2024-11-16 23:44:24,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:24" (1/1) ... [2024-11-16 23:44:24,719 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 189 [2024-11-16 23:44:24,722 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:44:24,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:44:24,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:44:24,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:44:24,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:24" (1/1) ... [2024-11-16 23:44:24,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:24" (1/1) ... [2024-11-16 23:44:24,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:24" (1/1) ... [2024-11-16 23:44:24,734 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:24" (1/1) ... [2024-11-16 23:44:24,748 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:24" (1/1) ... [2024-11-16 23:44:24,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:24" (1/1) ... [2024-11-16 23:44:24,754 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:24" (1/1) ... [2024-11-16 23:44:24,755 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:24" (1/1) ... [2024-11-16 23:44:24,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:44:24,762 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:44:24,762 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:44:24,762 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:44:24,763 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:24" (1/1) ... [2024-11-16 23:44:24,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:44:24,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:44:24,793 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-16 23:44:24,799 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-16 23:44:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:44:24,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-16 23:44:24,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-16 23:44:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-16 23:44:24,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-16 23:44:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:44:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:44:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:44:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:44:24,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:44:24,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:44:24,873 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:44:25,037 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:44:25,039 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:44:25,660 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:44:25,660 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:44:25,683 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:44:25,683 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:44:25,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:44:25 BoogieIcfgContainer [2024-11-16 23:44:25,683 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:44:25,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:44:25,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:44:25,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:44:25,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:44:24" (1/3) ... [2024-11-16 23:44:25,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7703f1d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:44:25, skipping insertion in model container [2024-11-16 23:44:25,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:44:24" (2/3) ... [2024-11-16 23:44:25,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7703f1d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:44:25, skipping insertion in model container [2024-11-16 23:44:25,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:44:25" (3/3) ... [2024-11-16 23:44:25,690 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2024-11-16 23:44:25,702 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:44:25,703 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2024-11-16 23:44:25,703 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:44:25,908 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 23:44:25,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 458 places, 477 transitions, 968 flow [2024-11-16 23:44:26,165 INFO L124 PetriNetUnfolderBase]: 26/475 cut-off events. [2024-11-16 23:44:26,165 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:44:26,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 475 events. 26/475 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1106 event pairs, 0 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 294. Up to 3 conditions per place. [2024-11-16 23:44:26,178 INFO L82 GeneralOperation]: Start removeDead. Operand has 458 places, 477 transitions, 968 flow [2024-11-16 23:44:26,198 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 438 places, 455 transitions, 922 flow [2024-11-16 23:44:26,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:44:26,214 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;@6633e9d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:44:26,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-11-16 23:44:26,219 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:44:26,219 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-16 23:44:26,220 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:44:26,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:26,220 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:26,221 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:26,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:26,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1589423559, now seen corresponding path program 1 times [2024-11-16 23:44:26,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:26,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142242047] [2024-11-16 23:44:26,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:26,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:26,397 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-16 23:44:26,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:26,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142242047] [2024-11-16 23:44:26,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142242047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:26,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:26,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:26,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005848736] [2024-11-16 23:44:26,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:26,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:26,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:26,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:26,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:26,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 477 [2024-11-16 23:44:26,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 455 transitions, 922 flow. Second operand has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 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-16 23:44:26,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:26,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 477 [2024-11-16 23:44:26,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:26,647 INFO L124 PetriNetUnfolderBase]: 37/784 cut-off events. [2024-11-16 23:44:26,647 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-16 23:44:26,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 784 events. 37/784 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3438 event pairs, 8 based on Foata normal form. 15/652 useless extension candidates. Maximal degree in co-relation 591. Up to 28 conditions per place. [2024-11-16 23:44:26,659 INFO L140 encePairwiseOnDemand]: 464/477 looper letters, 11 selfloop transitions, 2 changer transitions 6/444 dead transitions. [2024-11-16 23:44:26,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 444 transitions, 926 flow [2024-11-16 23:44:26,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:26,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1374 transitions. [2024-11-16 23:44:26,676 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.960167714884696 [2024-11-16 23:44:26,677 INFO L175 Difference]: Start difference. First operand has 438 places, 455 transitions, 922 flow. Second operand 3 states and 1374 transitions. [2024-11-16 23:44:26,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 444 transitions, 926 flow [2024-11-16 23:44:26,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 444 transitions, 918 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-16 23:44:26,689 INFO L231 Difference]: Finished difference. Result has 435 places, 438 transitions, 884 flow [2024-11-16 23:44:26,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=435, PETRI_TRANSITIONS=438} [2024-11-16 23:44:26,694 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -3 predicate places. [2024-11-16 23:44:26,694 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 438 transitions, 884 flow [2024-11-16 23:44:26,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 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-16 23:44:26,695 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:26,696 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:26,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:44:26,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:26,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1282636651, now seen corresponding path program 1 times [2024-11-16 23:44:26,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:26,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423385422] [2024-11-16 23:44:26,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:26,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:26,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:26,753 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-16 23:44:26,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:26,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423385422] [2024-11-16 23:44:26,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423385422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:26,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:26,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:26,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014309294] [2024-11-16 23:44:26,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:26,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:26,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:26,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:26,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:26,780 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 477 [2024-11-16 23:44:26,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 438 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 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-16 23:44:26,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:26,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 477 [2024-11-16 23:44:26,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:26,849 INFO L124 PetriNetUnfolderBase]: 37/768 cut-off events. [2024-11-16 23:44:26,849 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:44:26,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 806 conditions, 768 events. 37/768 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3382 event pairs, 8 based on Foata normal form. 0/634 useless extension candidates. Maximal degree in co-relation 774. Up to 28 conditions per place. [2024-11-16 23:44:26,853 INFO L140 encePairwiseOnDemand]: 474/477 looper letters, 11 selfloop transitions, 2 changer transitions 0/437 dead transitions. [2024-11-16 23:44:26,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 437 transitions, 908 flow [2024-11-16 23:44:26,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:26,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1364 transitions. [2024-11-16 23:44:26,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9531795946890287 [2024-11-16 23:44:26,856 INFO L175 Difference]: Start difference. First operand has 435 places, 438 transitions, 884 flow. Second operand 3 states and 1364 transitions. [2024-11-16 23:44:26,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 437 transitions, 908 flow [2024-11-16 23:44:26,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 437 transitions, 904 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:26,862 INFO L231 Difference]: Finished difference. Result has 428 places, 437 transitions, 882 flow [2024-11-16 23:44:26,862 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=882, PETRI_PLACES=428, PETRI_TRANSITIONS=437} [2024-11-16 23:44:26,863 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -10 predicate places. [2024-11-16 23:44:26,863 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 437 transitions, 882 flow [2024-11-16 23:44:26,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 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-16 23:44:26,864 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:26,864 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:26,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:44:26,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:26,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:26,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1338237401, now seen corresponding path program 1 times [2024-11-16 23:44:26,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:26,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724564526] [2024-11-16 23:44:26,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:26,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:26,897 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-16 23:44:26,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:26,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724564526] [2024-11-16 23:44:26,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724564526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:26,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:26,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:26,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469130019] [2024-11-16 23:44:26,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:26,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:26,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:26,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:26,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:26,928 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 477 [2024-11-16 23:44:26,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 437 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-16 23:44:26,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:26,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 477 [2024-11-16 23:44:26,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:26,995 INFO L124 PetriNetUnfolderBase]: 32/676 cut-off events. [2024-11-16 23:44:26,996 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-16 23:44:26,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 676 events. 32/676 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2637 event pairs, 8 based on Foata normal form. 0/562 useless extension candidates. Maximal degree in co-relation 675. Up to 29 conditions per place. [2024-11-16 23:44:27,000 INFO L140 encePairwiseOnDemand]: 474/477 looper letters, 12 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2024-11-16 23:44:27,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 436 transitions, 908 flow [2024-11-16 23:44:27,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:27,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:27,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-11-16 23:44:27,002 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9517819706498952 [2024-11-16 23:44:27,002 INFO L175 Difference]: Start difference. First operand has 428 places, 437 transitions, 882 flow. Second operand 3 states and 1362 transitions. [2024-11-16 23:44:27,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 436 transitions, 908 flow [2024-11-16 23:44:27,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 436 transitions, 904 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:27,007 INFO L231 Difference]: Finished difference. Result has 427 places, 436 transitions, 880 flow [2024-11-16 23:44:27,008 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=427, PETRI_TRANSITIONS=436} [2024-11-16 23:44:27,008 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -11 predicate places. [2024-11-16 23:44:27,008 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 436 transitions, 880 flow [2024-11-16 23:44:27,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-16 23:44:27,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:27,009 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:27,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:44:27,010 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:27,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:27,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1704439116, now seen corresponding path program 1 times [2024-11-16 23:44:27,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:27,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210866816] [2024-11-16 23:44:27,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:27,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:27,047 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-16 23:44:27,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:27,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210866816] [2024-11-16 23:44:27,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210866816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:27,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:27,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:27,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888163268] [2024-11-16 23:44:27,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:27,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:27,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:27,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:27,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:27,077 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 477 [2024-11-16 23:44:27,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 436 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-16 23:44:27,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:27,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 477 [2024-11-16 23:44:27,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:27,142 INFO L124 PetriNetUnfolderBase]: 36/763 cut-off events. [2024-11-16 23:44:27,142 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-16 23:44:27,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 763 events. 36/763 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3182 event pairs, 8 based on Foata normal form. 0/630 useless extension candidates. Maximal degree in co-relation 755. Up to 30 conditions per place. [2024-11-16 23:44:27,146 INFO L140 encePairwiseOnDemand]: 474/477 looper letters, 12 selfloop transitions, 2 changer transitions 0/435 dead transitions. [2024-11-16 23:44:27,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 435 transitions, 906 flow [2024-11-16 23:44:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-11-16 23:44:27,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9517819706498952 [2024-11-16 23:44:27,149 INFO L175 Difference]: Start difference. First operand has 427 places, 436 transitions, 880 flow. Second operand 3 states and 1362 transitions. [2024-11-16 23:44:27,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 435 transitions, 906 flow [2024-11-16 23:44:27,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 435 transitions, 902 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:27,153 INFO L231 Difference]: Finished difference. Result has 426 places, 435 transitions, 878 flow [2024-11-16 23:44:27,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=426, PETRI_TRANSITIONS=435} [2024-11-16 23:44:27,154 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -12 predicate places. [2024-11-16 23:44:27,155 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 435 transitions, 878 flow [2024-11-16 23:44:27,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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-16 23:44:27,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:27,156 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:27,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:44:27,156 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:27,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:27,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1254657018, now seen corresponding path program 1 times [2024-11-16 23:44:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:27,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801287556] [2024-11-16 23:44:27,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:27,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:27,183 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-16 23:44:27,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:27,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801287556] [2024-11-16 23:44:27,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801287556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:27,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:27,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:27,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179627163] [2024-11-16 23:44:27,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:27,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:27,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:27,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:27,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:27,208 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 477 [2024-11-16 23:44:27,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 435 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 446.0) internal successors, (1338), 3 states have internal predecessors, (1338), 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-16 23:44:27,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:27,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 477 [2024-11-16 23:44:27,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:27,343 INFO L124 PetriNetUnfolderBase]: 83/1186 cut-off events. [2024-11-16 23:44:27,344 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-16 23:44:27,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 1186 events. 83/1186 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6782 event pairs, 24 based on Foata normal form. 0/981 useless extension candidates. Maximal degree in co-relation 1223. Up to 81 conditions per place. [2024-11-16 23:44:27,351 INFO L140 encePairwiseOnDemand]: 471/477 looper letters, 14 selfloop transitions, 1 changer transitions 0/430 dead transitions. [2024-11-16 23:44:27,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 430 transitions, 898 flow [2024-11-16 23:44:27,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1355 transitions. [2024-11-16 23:44:27,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468902865129281 [2024-11-16 23:44:27,355 INFO L175 Difference]: Start difference. First operand has 426 places, 435 transitions, 878 flow. Second operand 3 states and 1355 transitions. [2024-11-16 23:44:27,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 430 transitions, 898 flow [2024-11-16 23:44:27,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 430 transitions, 894 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:27,360 INFO L231 Difference]: Finished difference. Result has 421 places, 430 transitions, 866 flow [2024-11-16 23:44:27,361 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=866, PETRI_PLACES=421, PETRI_TRANSITIONS=430} [2024-11-16 23:44:27,362 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -17 predicate places. [2024-11-16 23:44:27,362 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 430 transitions, 866 flow [2024-11-16 23:44:27,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 446.0) internal successors, (1338), 3 states have internal predecessors, (1338), 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-16 23:44:27,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:27,363 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:27,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:44:27,363 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:27,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:27,364 INFO L85 PathProgramCache]: Analyzing trace with hash 705610042, now seen corresponding path program 1 times [2024-11-16 23:44:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:27,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688010419] [2024-11-16 23:44:27,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:27,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:27,408 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-16 23:44:27,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:27,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688010419] [2024-11-16 23:44:27,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688010419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:27,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:27,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:27,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577220759] [2024-11-16 23:44:27,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:27,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:27,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:27,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:27,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 477 [2024-11-16 23:44:27,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 430 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 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-16 23:44:27,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:27,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 477 [2024-11-16 23:44:27,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:27,488 INFO L124 PetriNetUnfolderBase]: 32/665 cut-off events. [2024-11-16 23:44:27,488 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-16 23:44:27,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 702 conditions, 665 events. 32/665 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2501 event pairs, 8 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 646. Up to 28 conditions per place. [2024-11-16 23:44:27,492 INFO L140 encePairwiseOnDemand]: 474/477 looper letters, 11 selfloop transitions, 2 changer transitions 0/429 dead transitions. [2024-11-16 23:44:27,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 422 places, 429 transitions, 890 flow [2024-11-16 23:44:27,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:27,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1364 transitions. [2024-11-16 23:44:27,495 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9531795946890287 [2024-11-16 23:44:27,495 INFO L175 Difference]: Start difference. First operand has 421 places, 430 transitions, 866 flow. Second operand 3 states and 1364 transitions. [2024-11-16 23:44:27,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 422 places, 429 transitions, 890 flow [2024-11-16 23:44:27,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 429 transitions, 889 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:44:27,500 INFO L231 Difference]: Finished difference. Result has 421 places, 429 transitions, 867 flow [2024-11-16 23:44:27,501 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=863, PETRI_DIFFERENCE_MINUEND_PLACES=419, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=867, PETRI_PLACES=421, PETRI_TRANSITIONS=429} [2024-11-16 23:44:27,501 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -17 predicate places. [2024-11-16 23:44:27,501 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 429 transitions, 867 flow [2024-11-16 23:44:27,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 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-16 23:44:27,502 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:27,502 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:27,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:44:27,503 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:27,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1283341624, now seen corresponding path program 1 times [2024-11-16 23:44:27,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:27,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289048242] [2024-11-16 23:44:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:27,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:27,851 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-16 23:44:27,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:27,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289048242] [2024-11-16 23:44:27,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289048242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:27,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:27,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:44:27,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105174086] [2024-11-16 23:44:27,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:27,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:44:27,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:27,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:44:27,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:44:28,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 401 out of 477 [2024-11-16 23:44:28,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 429 transitions, 867 flow. Second operand has 6 states, 6 states have (on average 402.5) internal successors, (2415), 6 states have internal predecessors, (2415), 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-16 23:44:28,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:28,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 401 of 477 [2024-11-16 23:44:28,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:28,398 INFO L124 PetriNetUnfolderBase]: 429/2631 cut-off events. [2024-11-16 23:44:28,398 INFO L125 PetriNetUnfolderBase]: For 46/47 co-relation queries the response was YES. [2024-11-16 23:44:28,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3355 conditions, 2631 events. 429/2631 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 19468 event pairs, 288 based on Foata normal form. 0/2189 useless extension candidates. Maximal degree in co-relation 3300. Up to 691 conditions per place. [2024-11-16 23:44:28,409 INFO L140 encePairwiseOnDemand]: 465/477 looper letters, 52 selfloop transitions, 10 changer transitions 0/427 dead transitions. [2024-11-16 23:44:28,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 427 transitions, 987 flow [2024-11-16 23:44:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:44:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:44:28,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2470 transitions. [2024-11-16 23:44:28,415 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8630328441649197 [2024-11-16 23:44:28,416 INFO L175 Difference]: Start difference. First operand has 421 places, 429 transitions, 867 flow. Second operand 6 states and 2470 transitions. [2024-11-16 23:44:28,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 427 transitions, 987 flow [2024-11-16 23:44:28,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 422 places, 427 transitions, 983 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:28,427 INFO L231 Difference]: Finished difference. Result has 422 places, 427 transitions, 879 flow [2024-11-16 23:44:28,428 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=879, PETRI_PLACES=422, PETRI_TRANSITIONS=427} [2024-11-16 23:44:28,429 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -16 predicate places. [2024-11-16 23:44:28,430 INFO L471 AbstractCegarLoop]: Abstraction has has 422 places, 427 transitions, 879 flow [2024-11-16 23:44:28,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 402.5) internal successors, (2415), 6 states have internal predecessors, (2415), 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-16 23:44:28,436 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:28,437 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:28,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:44:28,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:28,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:28,438 INFO L85 PathProgramCache]: Analyzing trace with hash 385713238, now seen corresponding path program 1 times [2024-11-16 23:44:28,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:28,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546824816] [2024-11-16 23:44:28,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:28,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:28,471 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-16 23:44:28,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:28,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546824816] [2024-11-16 23:44:28,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546824816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:28,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:28,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:28,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621077660] [2024-11-16 23:44:28,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:28,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:28,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:28,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:28,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:28,492 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 477 [2024-11-16 23:44:28,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 427 transitions, 879 flow. Second operand has 3 states, 3 states have (on average 446.0) internal successors, (1338), 3 states have internal predecessors, (1338), 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-16 23:44:28,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:28,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 477 [2024-11-16 23:44:28,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:28,585 INFO L124 PetriNetUnfolderBase]: 80/1052 cut-off events. [2024-11-16 23:44:28,585 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-11-16 23:44:28,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 1052 events. 80/1052 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5758 event pairs, 24 based on Foata normal form. 0/888 useless extension candidates. Maximal degree in co-relation 1122. Up to 82 conditions per place. [2024-11-16 23:44:28,598 INFO L140 encePairwiseOnDemand]: 471/477 looper letters, 14 selfloop transitions, 1 changer transitions 0/422 dead transitions. [2024-11-16 23:44:28,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 422 transitions, 899 flow [2024-11-16 23:44:28,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:28,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1355 transitions. [2024-11-16 23:44:28,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9468902865129281 [2024-11-16 23:44:28,601 INFO L175 Difference]: Start difference. First operand has 422 places, 427 transitions, 879 flow. Second operand 3 states and 1355 transitions. [2024-11-16 23:44:28,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 422 transitions, 899 flow [2024-11-16 23:44:28,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 422 transitions, 879 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:44:28,607 INFO L231 Difference]: Finished difference. Result has 414 places, 422 transitions, 851 flow [2024-11-16 23:44:28,608 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=849, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=851, PETRI_PLACES=414, PETRI_TRANSITIONS=422} [2024-11-16 23:44:28,610 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -24 predicate places. [2024-11-16 23:44:28,610 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 422 transitions, 851 flow [2024-11-16 23:44:28,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 446.0) internal successors, (1338), 3 states have internal predecessors, (1338), 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-16 23:44:28,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:28,612 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:28,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:44:28,612 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:28,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:28,615 INFO L85 PathProgramCache]: Analyzing trace with hash -188680032, now seen corresponding path program 1 times [2024-11-16 23:44:28,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:28,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936114357] [2024-11-16 23:44:28,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:28,668 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-16 23:44:28,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:28,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936114357] [2024-11-16 23:44:28,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936114357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:28,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:28,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:28,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489377350] [2024-11-16 23:44:28,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:28,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:28,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:28,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:28,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:28,698 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 450 out of 477 [2024-11-16 23:44:28,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 422 transitions, 851 flow. Second operand has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 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-16 23:44:28,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:28,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 450 of 477 [2024-11-16 23:44:28,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:28,797 INFO L124 PetriNetUnfolderBase]: 32/653 cut-off events. [2024-11-16 23:44:28,798 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-16 23:44:28,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 691 conditions, 653 events. 32/653 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2314 event pairs, 8 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 635. Up to 28 conditions per place. [2024-11-16 23:44:28,802 INFO L140 encePairwiseOnDemand]: 474/477 looper letters, 11 selfloop transitions, 2 changer transitions 0/421 dead transitions. [2024-11-16 23:44:28,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 421 transitions, 875 flow [2024-11-16 23:44:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:28,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1364 transitions. [2024-11-16 23:44:28,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9531795946890287 [2024-11-16 23:44:28,806 INFO L175 Difference]: Start difference. First operand has 414 places, 422 transitions, 851 flow. Second operand 3 states and 1364 transitions. [2024-11-16 23:44:28,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 421 transitions, 875 flow [2024-11-16 23:44:28,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 421 transitions, 874 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:44:28,812 INFO L231 Difference]: Finished difference. Result has 414 places, 421 transitions, 852 flow [2024-11-16 23:44:28,812 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=852, PETRI_PLACES=414, PETRI_TRANSITIONS=421} [2024-11-16 23:44:28,813 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -24 predicate places. [2024-11-16 23:44:28,813 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 421 transitions, 852 flow [2024-11-16 23:44:28,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.3333333333333) internal successors, (1354), 3 states have internal predecessors, (1354), 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-16 23:44:28,814 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:28,814 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:28,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:44:28,815 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:28,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:28,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1381851370, now seen corresponding path program 1 times [2024-11-16 23:44:28,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:28,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185989045] [2024-11-16 23:44:28,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:28,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:28,865 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-16 23:44:28,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:28,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185989045] [2024-11-16 23:44:28,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185989045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:28,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:28,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:28,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355646957] [2024-11-16 23:44:28,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:28,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:28,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:28,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:28,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:28,889 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 477 [2024-11-16 23:44:28,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 421 transitions, 852 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-16 23:44:28,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:28,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 477 [2024-11-16 23:44:28,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:28,992 INFO L124 PetriNetUnfolderBase]: 73/1157 cut-off events. [2024-11-16 23:44:28,992 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:44:28,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 1157 events. 73/1157 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6644 event pairs, 19 based on Foata normal form. 0/984 useless extension candidates. Maximal degree in co-relation 1175. Up to 58 conditions per place. [2024-11-16 23:44:28,998 INFO L140 encePairwiseOnDemand]: 471/477 looper letters, 14 selfloop transitions, 2 changer transitions 0/420 dead transitions. [2024-11-16 23:44:28,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 420 transitions, 883 flow [2024-11-16 23:44:28,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:29,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1364 transitions. [2024-11-16 23:44:29,001 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9531795946890287 [2024-11-16 23:44:29,001 INFO L175 Difference]: Start difference. First operand has 414 places, 421 transitions, 852 flow. Second operand 3 states and 1364 transitions. [2024-11-16 23:44:29,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 420 transitions, 883 flow [2024-11-16 23:44:29,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 420 transitions, 879 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:29,008 INFO L231 Difference]: Finished difference. Result has 411 places, 419 transitions, 854 flow [2024-11-16 23:44:29,009 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=415, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=411, PETRI_TRANSITIONS=419} [2024-11-16 23:44:29,010 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -27 predicate places. [2024-11-16 23:44:29,010 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 419 transitions, 854 flow [2024-11-16 23:44:29,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-16 23:44:29,011 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:29,011 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:29,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:44:29,012 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:29,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:29,012 INFO L85 PathProgramCache]: Analyzing trace with hash 814301803, now seen corresponding path program 1 times [2024-11-16 23:44:29,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:29,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306490561] [2024-11-16 23:44:29,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:29,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:29,042 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-16 23:44:29,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306490561] [2024-11-16 23:44:29,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306490561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:29,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:29,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:29,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371300899] [2024-11-16 23:44:29,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:29,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:29,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:29,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:29,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:29,058 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 477 [2024-11-16 23:44:29,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 419 transitions, 854 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-16 23:44:29,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:29,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 477 [2024-11-16 23:44:29,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:29,153 INFO L124 PetriNetUnfolderBase]: 77/1175 cut-off events. [2024-11-16 23:44:29,153 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-16 23:44:29,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 1175 events. 77/1175 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6855 event pairs, 16 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1206. Up to 63 conditions per place. [2024-11-16 23:44:29,158 INFO L140 encePairwiseOnDemand]: 471/477 looper letters, 14 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2024-11-16 23:44:29,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 418 transitions, 885 flow [2024-11-16 23:44:29,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:29,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1364 transitions. [2024-11-16 23:44:29,161 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9531795946890287 [2024-11-16 23:44:29,161 INFO L175 Difference]: Start difference. First operand has 411 places, 419 transitions, 854 flow. Second operand 3 states and 1364 transitions. [2024-11-16 23:44:29,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 418 transitions, 885 flow [2024-11-16 23:44:29,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 418 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:44:29,166 INFO L231 Difference]: Finished difference. Result has 410 places, 417 transitions, 860 flow [2024-11-16 23:44:29,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=846, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=860, PETRI_PLACES=410, PETRI_TRANSITIONS=417} [2024-11-16 23:44:29,167 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -28 predicate places. [2024-11-16 23:44:29,167 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 417 transitions, 860 flow [2024-11-16 23:44:29,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-16 23:44:29,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:29,168 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:29,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:44:29,168 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:29,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:29,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1209481676, now seen corresponding path program 1 times [2024-11-16 23:44:29,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:29,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940611262] [2024-11-16 23:44:29,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:29,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:29,198 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-16 23:44:29,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:29,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940611262] [2024-11-16 23:44:29,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940611262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:29,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:29,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:29,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746306904] [2024-11-16 23:44:29,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:29,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:29,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:29,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:29,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:29,220 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 477 [2024-11-16 23:44:29,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 417 transitions, 860 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 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-16 23:44:29,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:29,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 477 [2024-11-16 23:44:29,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:29,293 INFO L124 PetriNetUnfolderBase]: 47/948 cut-off events. [2024-11-16 23:44:29,294 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-16 23:44:29,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1005 conditions, 948 events. 47/948 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4220 event pairs, 3 based on Foata normal form. 0/825 useless extension candidates. Maximal degree in co-relation 949. Up to 20 conditions per place. [2024-11-16 23:44:29,299 INFO L140 encePairwiseOnDemand]: 474/477 looper letters, 12 selfloop transitions, 2 changer transitions 0/417 dead transitions. [2024-11-16 23:44:29,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 417 transitions, 889 flow [2024-11-16 23:44:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-11-16 23:44:29,302 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9559748427672956 [2024-11-16 23:44:29,303 INFO L175 Difference]: Start difference. First operand has 410 places, 417 transitions, 860 flow. Second operand 3 states and 1368 transitions. [2024-11-16 23:44:29,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 417 transitions, 889 flow [2024-11-16 23:44:29,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 417 transitions, 889 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:44:29,307 INFO L231 Difference]: Finished difference. Result has 411 places, 416 transitions, 862 flow [2024-11-16 23:44:29,308 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=862, PETRI_PLACES=411, PETRI_TRANSITIONS=416} [2024-11-16 23:44:29,309 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -27 predicate places. [2024-11-16 23:44:29,309 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 416 transitions, 862 flow [2024-11-16 23:44:29,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 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-16 23:44:29,310 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:29,310 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:29,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:44:29,311 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:29,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:29,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1098748380, now seen corresponding path program 1 times [2024-11-16 23:44:29,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:29,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864124157] [2024-11-16 23:44:29,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:29,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:29,349 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-16 23:44:29,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:29,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864124157] [2024-11-16 23:44:29,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864124157] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:29,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:29,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:44:29,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501969856] [2024-11-16 23:44:29,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:29,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:29,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:29,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:29,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 477 [2024-11-16 23:44:29,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 416 transitions, 862 flow. Second operand has 3 states, 3 states have (on average 454.6666666666667) internal successors, (1364), 3 states have internal predecessors, (1364), 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-16 23:44:29,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:29,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 477 [2024-11-16 23:44:29,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:29,425 INFO L124 PetriNetUnfolderBase]: 43/818 cut-off events. [2024-11-16 23:44:29,425 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2024-11-16 23:44:29,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 818 events. 43/818 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3808 event pairs, 6 based on Foata normal form. 1/716 useless extension candidates. Maximal degree in co-relation 873. Up to 24 conditions per place. [2024-11-16 23:44:29,431 INFO L140 encePairwiseOnDemand]: 473/477 looper letters, 11 selfloop transitions, 3 changer transitions 0/418 dead transitions. [2024-11-16 23:44:29,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 418 transitions, 895 flow [2024-11-16 23:44:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:29,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1374 transitions. [2024-11-16 23:44:29,433 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.960167714884696 [2024-11-16 23:44:29,433 INFO L175 Difference]: Start difference. First operand has 411 places, 416 transitions, 862 flow. Second operand 3 states and 1374 transitions. [2024-11-16 23:44:29,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 418 transitions, 895 flow [2024-11-16 23:44:29,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 418 transitions, 891 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:29,457 INFO L231 Difference]: Finished difference. Result has 413 places, 417 transitions, 876 flow [2024-11-16 23:44:29,458 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=413, PETRI_TRANSITIONS=417} [2024-11-16 23:44:29,458 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -25 predicate places. [2024-11-16 23:44:29,459 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 417 transitions, 876 flow [2024-11-16 23:44:29,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 454.6666666666667) internal successors, (1364), 3 states have internal predecessors, (1364), 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-16 23:44:29,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:29,460 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:29,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:44:29,460 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:29,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:29,460 INFO L85 PathProgramCache]: Analyzing trace with hash -176437194, now seen corresponding path program 1 times [2024-11-16 23:44:29,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:29,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087858047] [2024-11-16 23:44:29,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:29,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:29,491 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-16 23:44:29,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:29,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087858047] [2024-11-16 23:44:29,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087858047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:29,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:29,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:29,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054759396] [2024-11-16 23:44:29,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:29,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:29,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:29,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:29,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:29,505 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 477 [2024-11-16 23:44:29,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 417 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-16 23:44:29,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:29,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 477 [2024-11-16 23:44:29,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:29,628 INFO L124 PetriNetUnfolderBase]: 100/1451 cut-off events. [2024-11-16 23:44:29,629 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2024-11-16 23:44:29,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1604 conditions, 1451 events. 100/1451 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8548 event pairs, 12 based on Foata normal form. 1/1266 useless extension candidates. Maximal degree in co-relation 1546. Up to 89 conditions per place. [2024-11-16 23:44:29,639 INFO L140 encePairwiseOnDemand]: 471/477 looper letters, 16 selfloop transitions, 2 changer transitions 0/418 dead transitions. [2024-11-16 23:44:29,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 418 transitions, 917 flow [2024-11-16 23:44:29,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1366 transitions. [2024-11-16 23:44:29,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9545772187281621 [2024-11-16 23:44:29,642 INFO L175 Difference]: Start difference. First operand has 413 places, 417 transitions, 876 flow. Second operand 3 states and 1366 transitions. [2024-11-16 23:44:29,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 418 transitions, 917 flow [2024-11-16 23:44:29,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 418 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:29,647 INFO L231 Difference]: Finished difference. Result has 410 places, 415 transitions, 876 flow [2024-11-16 23:44:29,648 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=862, PETRI_DIFFERENCE_MINUEND_PLACES=407, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=876, PETRI_PLACES=410, PETRI_TRANSITIONS=415} [2024-11-16 23:44:29,649 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -28 predicate places. [2024-11-16 23:44:29,649 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 415 transitions, 876 flow [2024-11-16 23:44:29,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-16 23:44:29,650 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:29,650 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:29,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:44:29,650 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:29,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:29,651 INFO L85 PathProgramCache]: Analyzing trace with hash 478326405, now seen corresponding path program 1 times [2024-11-16 23:44:29,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:29,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132395252] [2024-11-16 23:44:29,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:29,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:29,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:44:29,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:29,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132395252] [2024-11-16 23:44:29,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132395252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:29,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:29,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:29,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149972122] [2024-11-16 23:44:29,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:29,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:29,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:29,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:29,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:29,705 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 477 [2024-11-16 23:44:29,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 415 transitions, 876 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 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-16 23:44:29,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:29,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 477 [2024-11-16 23:44:29,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:29,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1183] thread2EXIT-->L102-10: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][281], [497#(= |#race~count2~0| 0), 493#(= |#race~count1~0| 0), Black: 495#true, 227#L102-10true, 511#true, 487#(= |#race~n2~0| 0), 475#(= |#race~n1~0| 0), 509#(= |#race~get1~0| 0), Black: 504#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 507#true, Black: 491#true]) [2024-11-16 23:44:29,805 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is cut-off event [2024-11-16 23:44:29,805 INFO L297 olderBase$Statistics]: existing Event has 229 ancestors and is cut-off event [2024-11-16 23:44:29,805 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2024-11-16 23:44:29,805 INFO L297 olderBase$Statistics]: existing Event has 198 ancestors and is cut-off event [2024-11-16 23:44:29,808 INFO L124 PetriNetUnfolderBase]: 61/912 cut-off events. [2024-11-16 23:44:29,809 INFO L125 PetriNetUnfolderBase]: For 19/24 co-relation queries the response was YES. [2024-11-16 23:44:29,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1026 conditions, 912 events. 61/912 cut-off events. For 19/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4478 event pairs, 6 based on Foata normal form. 0/803 useless extension candidates. Maximal degree in co-relation 968. Up to 52 conditions per place. [2024-11-16 23:44:29,813 INFO L140 encePairwiseOnDemand]: 474/477 looper letters, 12 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2024-11-16 23:44:29,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 415 transitions, 905 flow [2024-11-16 23:44:29,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:29,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-11-16 23:44:29,816 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9559748427672956 [2024-11-16 23:44:29,816 INFO L175 Difference]: Start difference. First operand has 410 places, 415 transitions, 876 flow. Second operand 3 states and 1368 transitions. [2024-11-16 23:44:29,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 411 places, 415 transitions, 905 flow [2024-11-16 23:44:29,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 415 transitions, 905 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:44:29,821 INFO L231 Difference]: Finished difference. Result has 411 places, 414 transitions, 878 flow [2024-11-16 23:44:29,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=878, PETRI_PLACES=411, PETRI_TRANSITIONS=414} [2024-11-16 23:44:29,822 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -27 predicate places. [2024-11-16 23:44:29,822 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 414 transitions, 878 flow [2024-11-16 23:44:29,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 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-16 23:44:29,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:29,823 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:29,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:44:29,823 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:29,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:29,824 INFO L85 PathProgramCache]: Analyzing trace with hash 2005242108, now seen corresponding path program 1 times [2024-11-16 23:44:29,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:29,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70075627] [2024-11-16 23:44:29,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:29,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:29,858 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-16 23:44:29,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:29,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70075627] [2024-11-16 23:44:29,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70075627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:29,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:29,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:44:29,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7380310] [2024-11-16 23:44:29,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:29,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:29,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:29,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:29,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:29,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 453 out of 477 [2024-11-16 23:44:29,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 414 transitions, 878 flow. Second operand has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 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-16 23:44:29,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:29,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 453 of 477 [2024-11-16 23:44:29,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:29,953 INFO L124 PetriNetUnfolderBase]: 83/1041 cut-off events. [2024-11-16 23:44:29,954 INFO L125 PetriNetUnfolderBase]: For 37/40 co-relation queries the response was YES. [2024-11-16 23:44:29,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 1041 events. 83/1041 cut-off events. For 37/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5467 event pairs, 12 based on Foata normal form. 0/916 useless extension candidates. Maximal degree in co-relation 1163. Up to 88 conditions per place. [2024-11-16 23:44:29,961 INFO L140 encePairwiseOnDemand]: 473/477 looper letters, 11 selfloop transitions, 3 changer transitions 0/416 dead transitions. [2024-11-16 23:44:29,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 416 transitions, 911 flow [2024-11-16 23:44:29,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:29,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1374 transitions. [2024-11-16 23:44:29,963 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.960167714884696 [2024-11-16 23:44:29,964 INFO L175 Difference]: Start difference. First operand has 411 places, 414 transitions, 878 flow. Second operand 3 states and 1374 transitions. [2024-11-16 23:44:29,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 416 transitions, 911 flow [2024-11-16 23:44:29,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 416 transitions, 907 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:29,969 INFO L231 Difference]: Finished difference. Result has 413 places, 415 transitions, 892 flow [2024-11-16 23:44:29,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=892, PETRI_PLACES=413, PETRI_TRANSITIONS=415} [2024-11-16 23:44:29,969 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -25 predicate places. [2024-11-16 23:44:29,970 INFO L471 AbstractCegarLoop]: Abstraction has has 413 places, 415 transitions, 892 flow [2024-11-16 23:44:29,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.0) internal successors, (1365), 3 states have internal predecessors, (1365), 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-16 23:44:29,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:29,971 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:29,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:44:29,971 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:29,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:29,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1740636401, now seen corresponding path program 1 times [2024-11-16 23:44:29,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:29,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049440336] [2024-11-16 23:44:29,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:29,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:44:30,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:30,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049440336] [2024-11-16 23:44:30,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049440336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:30,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:30,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:30,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283737936] [2024-11-16 23:44:30,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:30,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:30,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:30,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:30,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:30,029 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 477 [2024-11-16 23:44:30,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 415 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 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-16 23:44:30,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:30,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 477 [2024-11-16 23:44:30,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:30,166 INFO L124 PetriNetUnfolderBase]: 75/1319 cut-off events. [2024-11-16 23:44:30,166 INFO L125 PetriNetUnfolderBase]: For 31/36 co-relation queries the response was YES. [2024-11-16 23:44:30,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1533 conditions, 1319 events. 75/1319 cut-off events. For 31/36 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7245 event pairs, 4 based on Foata normal form. 0/1189 useless extension candidates. Maximal degree in co-relation 1473. Up to 36 conditions per place. [2024-11-16 23:44:30,174 INFO L140 encePairwiseOnDemand]: 474/477 looper letters, 12 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2024-11-16 23:44:30,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 415 transitions, 921 flow [2024-11-16 23:44:30,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:30,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:30,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-11-16 23:44:30,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9559748427672956 [2024-11-16 23:44:30,177 INFO L175 Difference]: Start difference. First operand has 413 places, 415 transitions, 892 flow. Second operand 3 states and 1368 transitions. [2024-11-16 23:44:30,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 415 transitions, 921 flow [2024-11-16 23:44:30,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 415 transitions, 915 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:30,184 INFO L231 Difference]: Finished difference. Result has 412 places, 414 transitions, 888 flow [2024-11-16 23:44:30,184 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=412, PETRI_TRANSITIONS=414} [2024-11-16 23:44:30,185 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -26 predicate places. [2024-11-16 23:44:30,185 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 414 transitions, 888 flow [2024-11-16 23:44:30,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 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-16 23:44:30,186 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:30,186 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:30,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:44:30,186 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:30,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash 158420143, now seen corresponding path program 1 times [2024-11-16 23:44:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:30,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254611027] [2024-11-16 23:44:30,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:30,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:30,269 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-16 23:44:30,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:30,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254611027] [2024-11-16 23:44:30,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254611027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:30,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:30,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:30,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548020220] [2024-11-16 23:44:30,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:30,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:30,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:30,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:30,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:30,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 477 [2024-11-16 23:44:30,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 414 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 449.6666666666667) internal successors, (1349), 3 states have internal predecessors, (1349), 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-16 23:44:30,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:30,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 477 [2024-11-16 23:44:30,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:30,606 INFO L124 PetriNetUnfolderBase]: 108/1506 cut-off events. [2024-11-16 23:44:30,606 INFO L125 PetriNetUnfolderBase]: For 16/22 co-relation queries the response was YES. [2024-11-16 23:44:30,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 1506 events. 108/1506 cut-off events. For 16/22 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9076 event pairs, 13 based on Foata normal form. 0/1356 useless extension candidates. Maximal degree in co-relation 1706. Up to 97 conditions per place. [2024-11-16 23:44:30,616 INFO L140 encePairwiseOnDemand]: 471/477 looper letters, 16 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2024-11-16 23:44:30,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 415 transitions, 929 flow [2024-11-16 23:44:30,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1366 transitions. [2024-11-16 23:44:30,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9545772187281621 [2024-11-16 23:44:30,621 INFO L175 Difference]: Start difference. First operand has 412 places, 414 transitions, 888 flow. Second operand 3 states and 1366 transitions. [2024-11-16 23:44:30,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 415 transitions, 929 flow [2024-11-16 23:44:30,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 415 transitions, 925 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:30,627 INFO L231 Difference]: Finished difference. Result has 409 places, 412 transitions, 890 flow [2024-11-16 23:44:30,628 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=876, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=890, PETRI_PLACES=409, PETRI_TRANSITIONS=412} [2024-11-16 23:44:30,628 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -29 predicate places. [2024-11-16 23:44:30,628 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 412 transitions, 890 flow [2024-11-16 23:44:30,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.6666666666667) internal successors, (1349), 3 states have internal predecessors, (1349), 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-16 23:44:30,629 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:30,629 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:30,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 23:44:30,629 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:30,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:30,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1832014236, now seen corresponding path program 1 times [2024-11-16 23:44:30,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:30,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719954178] [2024-11-16 23:44:30,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:30,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:30,762 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-16 23:44:30,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:30,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719954178] [2024-11-16 23:44:30,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719954178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:30,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:30,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 23:44:30,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937240093] [2024-11-16 23:44:30,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:30,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:44:30,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:30,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:44:30,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:44:31,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 477 [2024-11-16 23:44:31,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 412 transitions, 890 flow. Second operand has 8 states, 8 states have (on average 433.125) internal successors, (3465), 8 states have internal predecessors, (3465), 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-16 23:44:31,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:31,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 477 [2024-11-16 23:44:31,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:31,441 INFO L124 PetriNetUnfolderBase]: 131/2127 cut-off events. [2024-11-16 23:44:31,442 INFO L125 PetriNetUnfolderBase]: For 10/30 co-relation queries the response was YES. [2024-11-16 23:44:31,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2538 conditions, 2127 events. 131/2127 cut-off events. For 10/30 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 14581 event pairs, 17 based on Foata normal form. 4/1936 useless extension candidates. Maximal degree in co-relation 2476. Up to 80 conditions per place. [2024-11-16 23:44:31,453 INFO L140 encePairwiseOnDemand]: 460/477 looper letters, 44 selfloop transitions, 19 changer transitions 0/439 dead transitions. [2024-11-16 23:44:31,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 439 transitions, 1083 flow [2024-11-16 23:44:31,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 23:44:31,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-16 23:44:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5224 transitions. [2024-11-16 23:44:31,460 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9126484975541579 [2024-11-16 23:44:31,460 INFO L175 Difference]: Start difference. First operand has 409 places, 412 transitions, 890 flow. Second operand 12 states and 5224 transitions. [2024-11-16 23:44:31,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 439 transitions, 1083 flow [2024-11-16 23:44:31,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 439 transitions, 1083 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:44:31,466 INFO L231 Difference]: Finished difference. Result has 426 places, 422 transitions, 991 flow [2024-11-16 23:44:31,466 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=991, PETRI_PLACES=426, PETRI_TRANSITIONS=422} [2024-11-16 23:44:31,466 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -12 predicate places. [2024-11-16 23:44:31,467 INFO L471 AbstractCegarLoop]: Abstraction has has 426 places, 422 transitions, 991 flow [2024-11-16 23:44:31,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 433.125) internal successors, (3465), 8 states have internal predecessors, (3465), 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-16 23:44:31,468 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:31,468 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:31,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 23:44:31,468 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:31,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:31,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1719348151, now seen corresponding path program 1 times [2024-11-16 23:44:31,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:31,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406652218] [2024-11-16 23:44:31,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:31,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:31,497 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-16 23:44:31,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:31,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406652218] [2024-11-16 23:44:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406652218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:31,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:31,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:31,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289023618] [2024-11-16 23:44:31,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:31,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:31,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:31,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:31,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:31,520 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 477 [2024-11-16 23:44:31,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 422 transitions, 991 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 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-16 23:44:31,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:31,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 477 [2024-11-16 23:44:31,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:31,658 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1183] thread2EXIT-->L102-10: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][266], [493#(= |#race~count1~0| 0), Black: 537#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 545#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 539#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 516#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 532#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 531#(<= ~n1~0 0), Black: 522#true, Black: 491#true, 497#(= |#race~count2~0| 0), 526#true, Black: 495#true, 227#L102-10true, 487#(= |#race~n2~0| 0), 475#(= |#race~n1~0| 0), 552#true, 509#(= |#race~get1~0| 0), Black: 504#(not |thread1Thread1of1ForFork1_#t~short1|), 524#(= |#race~get2~0| 0), Black: 507#true]) [2024-11-16 23:44:31,658 INFO L294 olderBase$Statistics]: this new event has 248 ancestors and is cut-off event [2024-11-16 23:44:31,659 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-11-16 23:44:31,659 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-11-16 23:44:31,659 INFO L297 olderBase$Statistics]: existing Event has 217 ancestors and is cut-off event [2024-11-16 23:44:31,663 INFO L124 PetriNetUnfolderBase]: 114/1640 cut-off events. [2024-11-16 23:44:31,663 INFO L125 PetriNetUnfolderBase]: For 57/64 co-relation queries the response was YES. [2024-11-16 23:44:31,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2026 conditions, 1640 events. 114/1640 cut-off events. For 57/64 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10077 event pairs, 9 based on Foata normal form. 0/1498 useless extension candidates. Maximal degree in co-relation 1956. Up to 96 conditions per place. [2024-11-16 23:44:31,674 INFO L140 encePairwiseOnDemand]: 474/477 looper letters, 12 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2024-11-16 23:44:31,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 422 transitions, 1020 flow [2024-11-16 23:44:31,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:31,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:31,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-11-16 23:44:31,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9559748427672956 [2024-11-16 23:44:31,677 INFO L175 Difference]: Start difference. First operand has 426 places, 422 transitions, 991 flow. Second operand 3 states and 1368 transitions. [2024-11-16 23:44:31,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 422 transitions, 1020 flow [2024-11-16 23:44:31,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 422 transitions, 1020 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:44:31,682 INFO L231 Difference]: Finished difference. Result has 427 places, 421 transitions, 993 flow [2024-11-16 23:44:31,683 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=993, PETRI_PLACES=427, PETRI_TRANSITIONS=421} [2024-11-16 23:44:31,683 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -11 predicate places. [2024-11-16 23:44:31,683 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 421 transitions, 993 flow [2024-11-16 23:44:31,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 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-16 23:44:31,684 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:31,684 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:31,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 23:44:31,684 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:31,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:31,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1946675637, now seen corresponding path program 1 times [2024-11-16 23:44:31,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:31,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987133724] [2024-11-16 23:44:31,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:31,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:31,807 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-16 23:44:31,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:31,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987133724] [2024-11-16 23:44:31,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987133724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:31,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:31,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 23:44:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326479381] [2024-11-16 23:44:31,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:31,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:44:31,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:31,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:44:31,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:44:32,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 477 [2024-11-16 23:44:32,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 421 transitions, 993 flow. Second operand has 8 states, 8 states have (on average 433.25) internal successors, (3466), 8 states have internal predecessors, (3466), 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-16 23:44:32,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:32,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 477 [2024-11-16 23:44:32,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:32,334 INFO L124 PetriNetUnfolderBase]: 123/1430 cut-off events. [2024-11-16 23:44:32,335 INFO L125 PetriNetUnfolderBase]: For 86/89 co-relation queries the response was YES. [2024-11-16 23:44:32,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1907 conditions, 1430 events. 123/1430 cut-off events. For 86/89 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 8308 event pairs, 22 based on Foata normal form. 0/1308 useless extension candidates. Maximal degree in co-relation 1834. Up to 160 conditions per place. [2024-11-16 23:44:32,345 INFO L140 encePairwiseOnDemand]: 461/477 looper letters, 48 selfloop transitions, 17 changer transitions 0/445 dead transitions. [2024-11-16 23:44:32,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 445 transitions, 1185 flow [2024-11-16 23:44:32,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 23:44:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-16 23:44:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4794 transitions. [2024-11-16 23:44:32,351 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9136649514008005 [2024-11-16 23:44:32,352 INFO L175 Difference]: Start difference. First operand has 427 places, 421 transitions, 993 flow. Second operand 11 states and 4794 transitions. [2024-11-16 23:44:32,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 445 transitions, 1185 flow [2024-11-16 23:44:32,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 445 transitions, 1181 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:32,358 INFO L231 Difference]: Finished difference. Result has 438 places, 426 transitions, 1062 flow [2024-11-16 23:44:32,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=989, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1062, PETRI_PLACES=438, PETRI_TRANSITIONS=426} [2024-11-16 23:44:32,358 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, 0 predicate places. [2024-11-16 23:44:32,359 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 426 transitions, 1062 flow [2024-11-16 23:44:32,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 433.25) internal successors, (3466), 8 states have internal predecessors, (3466), 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-16 23:44:32,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:32,360 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:32,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 23:44:32,361 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:32,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:32,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1352415451, now seen corresponding path program 1 times [2024-11-16 23:44:32,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:32,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086057418] [2024-11-16 23:44:32,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:32,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:44:32,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:32,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086057418] [2024-11-16 23:44:32,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086057418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:32,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:32,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 23:44:32,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549970612] [2024-11-16 23:44:32,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:32,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:44:32,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:32,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:44:32,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:44:32,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 477 [2024-11-16 23:44:32,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 426 transitions, 1062 flow. Second operand has 8 states, 8 states have (on average 433.25) internal successors, (3466), 8 states have internal predecessors, (3466), 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-16 23:44:32,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:32,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 477 [2024-11-16 23:44:32,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:33,175 INFO L124 PetriNetUnfolderBase]: 187/2785 cut-off events. [2024-11-16 23:44:33,176 INFO L125 PetriNetUnfolderBase]: For 210/236 co-relation queries the response was YES. [2024-11-16 23:44:33,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 2785 events. 187/2785 cut-off events. For 210/236 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 20325 event pairs, 28 based on Foata normal form. 2/2594 useless extension candidates. Maximal degree in co-relation 3609. Up to 127 conditions per place. [2024-11-16 23:44:33,194 INFO L140 encePairwiseOnDemand]: 461/477 looper letters, 50 selfloop transitions, 21 changer transitions 0/451 dead transitions. [2024-11-16 23:44:33,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 451 transitions, 1307 flow [2024-11-16 23:44:33,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 23:44:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-16 23:44:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4785 transitions. [2024-11-16 23:44:33,200 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9119496855345912 [2024-11-16 23:44:33,200 INFO L175 Difference]: Start difference. First operand has 438 places, 426 transitions, 1062 flow. Second operand 11 states and 4785 transitions. [2024-11-16 23:44:33,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 451 transitions, 1307 flow [2024-11-16 23:44:33,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 451 transitions, 1286 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-16 23:44:33,207 INFO L231 Difference]: Finished difference. Result has 446 places, 440 transitions, 1195 flow [2024-11-16 23:44:33,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=1041, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1195, PETRI_PLACES=446, PETRI_TRANSITIONS=440} [2024-11-16 23:44:33,208 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, 8 predicate places. [2024-11-16 23:44:33,208 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 440 transitions, 1195 flow [2024-11-16 23:44:33,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 433.25) internal successors, (3466), 8 states have internal predecessors, (3466), 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-16 23:44:33,209 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:33,209 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:33,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 23:44:33,209 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:33,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:33,210 INFO L85 PathProgramCache]: Analyzing trace with hash 365122686, now seen corresponding path program 1 times [2024-11-16 23:44:33,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:33,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638850603] [2024-11-16 23:44:33,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:33,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:44:33,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:33,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638850603] [2024-11-16 23:44:33,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638850603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:33,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:33,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 23:44:33,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829833636] [2024-11-16 23:44:33,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:33,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:44:33,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:33,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:44:33,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:44:33,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 477 [2024-11-16 23:44:33,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 440 transitions, 1195 flow. Second operand has 8 states, 8 states have (on average 433.375) internal successors, (3467), 8 states have internal predecessors, (3467), 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-16 23:44:33,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:33,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 477 [2024-11-16 23:44:33,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:33,871 INFO L124 PetriNetUnfolderBase]: 162/1949 cut-off events. [2024-11-16 23:44:33,872 INFO L125 PetriNetUnfolderBase]: For 303/308 co-relation queries the response was YES. [2024-11-16 23:44:33,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 1949 events. 162/1949 cut-off events. For 303/308 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 12614 event pairs, 25 based on Foata normal form. 8/1814 useless extension candidates. Maximal degree in co-relation 2693. Up to 165 conditions per place. [2024-11-16 23:44:33,886 INFO L140 encePairwiseOnDemand]: 460/477 looper letters, 44 selfloop transitions, 24 changer transitions 0/457 dead transitions. [2024-11-16 23:44:33,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 457 places, 457 transitions, 1406 flow [2024-11-16 23:44:33,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 23:44:33,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-16 23:44:33,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 5215 transitions. [2024-11-16 23:44:33,894 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9110761705101328 [2024-11-16 23:44:33,894 INFO L175 Difference]: Start difference. First operand has 446 places, 440 transitions, 1195 flow. Second operand 12 states and 5215 transitions. [2024-11-16 23:44:33,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 457 places, 457 transitions, 1406 flow [2024-11-16 23:44:33,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 457 transitions, 1402 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:44:33,903 INFO L231 Difference]: Finished difference. Result has 460 places, 449 transitions, 1331 flow [2024-11-16 23:44:33,903 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1331, PETRI_PLACES=460, PETRI_TRANSITIONS=449} [2024-11-16 23:44:33,904 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, 22 predicate places. [2024-11-16 23:44:33,904 INFO L471 AbstractCegarLoop]: Abstraction has has 460 places, 449 transitions, 1331 flow [2024-11-16 23:44:33,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 433.375) internal successors, (3467), 8 states have internal predecessors, (3467), 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-16 23:44:33,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:33,905 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:33,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 23:44:33,905 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:33,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:33,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1650629679, now seen corresponding path program 1 times [2024-11-16 23:44:33,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:33,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464492261] [2024-11-16 23:44:33,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:33,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:33,944 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-16 23:44:33,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:33,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464492261] [2024-11-16 23:44:33,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464492261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:33,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:33,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:33,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262497968] [2024-11-16 23:44:33,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:33,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:33,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:33,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:33,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:33,964 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 477 [2024-11-16 23:44:33,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 449 transitions, 1331 flow. Second operand has 3 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 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-16 23:44:33,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:33,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 477 [2024-11-16 23:44:33,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:34,181 INFO L124 PetriNetUnfolderBase]: 136/2301 cut-off events. [2024-11-16 23:44:34,181 INFO L125 PetriNetUnfolderBase]: For 485/495 co-relation queries the response was YES. [2024-11-16 23:44:34,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3271 conditions, 2301 events. 136/2301 cut-off events. For 485/495 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 15415 event pairs, 10 based on Foata normal form. 0/2158 useless extension candidates. Maximal degree in co-relation 3181. Up to 76 conditions per place. [2024-11-16 23:44:34,197 INFO L140 encePairwiseOnDemand]: 473/477 looper letters, 12 selfloop transitions, 1 changer transitions 0/446 dead transitions. [2024-11-16 23:44:34,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 446 transitions, 1351 flow [2024-11-16 23:44:34,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:34,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1363 transitions. [2024-11-16 23:44:34,199 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9524807826694619 [2024-11-16 23:44:34,199 INFO L175 Difference]: Start difference. First operand has 460 places, 449 transitions, 1331 flow. Second operand 3 states and 1363 transitions. [2024-11-16 23:44:34,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 446 transitions, 1351 flow [2024-11-16 23:44:34,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 446 transitions, 1334 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-16 23:44:34,222 INFO L231 Difference]: Finished difference. Result has 453 places, 446 transitions, 1310 flow [2024-11-16 23:44:34,222 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=453, PETRI_TRANSITIONS=446} [2024-11-16 23:44:34,223 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, 15 predicate places. [2024-11-16 23:44:34,223 INFO L471 AbstractCegarLoop]: Abstraction has has 453 places, 446 transitions, 1310 flow [2024-11-16 23:44:34,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 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-16 23:44:34,224 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:34,224 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:34,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 23:44:34,224 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:34,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:34,224 INFO L85 PathProgramCache]: Analyzing trace with hash 747627812, now seen corresponding path program 1 times [2024-11-16 23:44:34,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:34,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591756042] [2024-11-16 23:44:34,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:34,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:34,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:44:34,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591756042] [2024-11-16 23:44:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591756042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:34,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:34,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:34,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4291103] [2024-11-16 23:44:34,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:34,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:34,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:34,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:34,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:34,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 477 [2024-11-16 23:44:34,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 446 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 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-16 23:44:34,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:34,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 477 [2024-11-16 23:44:34,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:34,454 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1183] thread2EXIT-->L102-10: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][263], [Black: 574#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 561#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 493#(= |#race~count1~0| 0), 630#true, Black: 516#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 522#true, 627#true, 603#true, Black: 583#(<= ~n2~0 0), Black: 584#(and (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 597#(and (not |thread1Thread1of1ForFork1_#t~short1|) (<= ~n2~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 589#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 591#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 524#(= |#race~get2~0| 0), Black: 537#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 545#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short1|) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 539#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 532#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 531#(<= ~n1~0 0), Black: 491#true, Black: 608#(<= ~n2~0 0), 497#(= |#race~count2~0| 0), Black: 609#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 526#true, Black: 622#(and (<= ~n2~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), Black: 495#true, 227#L102-10true, 487#(= |#race~n2~0| 0), 475#(= |#race~n1~0| 0), 509#(= |#race~get1~0| 0), Black: 504#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 507#true, Black: 560#(<= ~n1~0 0)]) [2024-11-16 23:44:34,454 INFO L294 olderBase$Statistics]: this new event has 233 ancestors and is not cut-off event [2024-11-16 23:44:34,454 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is not cut-off event [2024-11-16 23:44:34,454 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is not cut-off event [2024-11-16 23:44:34,454 INFO L297 olderBase$Statistics]: existing Event has 233 ancestors and is not cut-off event [2024-11-16 23:44:34,464 INFO L124 PetriNetUnfolderBase]: 116/1841 cut-off events. [2024-11-16 23:44:34,464 INFO L125 PetriNetUnfolderBase]: For 337/347 co-relation queries the response was YES. [2024-11-16 23:44:34,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2577 conditions, 1841 events. 116/1841 cut-off events. For 337/347 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11206 event pairs, 11 based on Foata normal form. 5/1742 useless extension candidates. Maximal degree in co-relation 2486. Up to 83 conditions per place. [2024-11-16 23:44:34,475 INFO L140 encePairwiseOnDemand]: 471/477 looper letters, 6 selfloop transitions, 0 changer transitions 74/445 dead transitions. [2024-11-16 23:44:34,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 445 transitions, 1336 flow [2024-11-16 23:44:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:34,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1364 transitions. [2024-11-16 23:44:34,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9531795946890287 [2024-11-16 23:44:34,477 INFO L175 Difference]: Start difference. First operand has 453 places, 446 transitions, 1310 flow. Second operand 3 states and 1364 transitions. [2024-11-16 23:44:34,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 445 transitions, 1336 flow [2024-11-16 23:44:34,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 445 transitions, 1335 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:44:34,484 INFO L231 Difference]: Finished difference. Result has 451 places, 371 transitions, 933 flow [2024-11-16 23:44:34,484 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=443, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=933, PETRI_PLACES=451, PETRI_TRANSITIONS=371} [2024-11-16 23:44:34,485 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, 13 predicate places. [2024-11-16 23:44:34,485 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 371 transitions, 933 flow [2024-11-16 23:44:34,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 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-16 23:44:34,485 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:34,486 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:34,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 23:44:34,486 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:34,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:34,486 INFO L85 PathProgramCache]: Analyzing trace with hash -107974903, now seen corresponding path program 1 times [2024-11-16 23:44:34,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:34,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563447679] [2024-11-16 23:44:34,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:34,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:44:34,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:34,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563447679] [2024-11-16 23:44:34,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563447679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:34,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:34,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:44:34,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963618953] [2024-11-16 23:44:34,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:34,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:44:34,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:34,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:44:34,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:44:35,229 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 436 out of 477 [2024-11-16 23:44:35,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 371 transitions, 933 flow. Second operand has 6 states, 6 states have (on average 438.8333333333333) internal successors, (2633), 6 states have internal predecessors, (2633), 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-16 23:44:35,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:35,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 436 of 477 [2024-11-16 23:44:35,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:35,386 INFO L124 PetriNetUnfolderBase]: 86/1295 cut-off events. [2024-11-16 23:44:35,387 INFO L125 PetriNetUnfolderBase]: For 186/186 co-relation queries the response was YES. [2024-11-16 23:44:35,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1841 conditions, 1295 events. 86/1295 cut-off events. For 186/186 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7586 event pairs, 4 based on Foata normal form. 0/1215 useless extension candidates. Maximal degree in co-relation 1814. Up to 41 conditions per place. [2024-11-16 23:44:35,400 INFO L140 encePairwiseOnDemand]: 469/477 looper letters, 25 selfloop transitions, 6 changer transitions 0/374 dead transitions. [2024-11-16 23:44:35,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 404 places, 374 transitions, 1009 flow [2024-11-16 23:44:35,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:44:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:44:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2649 transitions. [2024-11-16 23:44:35,405 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9255765199161425 [2024-11-16 23:44:35,406 INFO L175 Difference]: Start difference. First operand has 451 places, 371 transitions, 933 flow. Second operand 6 states and 2649 transitions. [2024-11-16 23:44:35,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 404 places, 374 transitions, 1009 flow [2024-11-16 23:44:35,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 374 transitions, 909 flow, removed 24 selfloop flow, removed 26 redundant places. [2024-11-16 23:44:35,417 INFO L231 Difference]: Finished difference. Result has 379 places, 370 transitions, 852 flow [2024-11-16 23:44:35,418 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=852, PETRI_PLACES=379, PETRI_TRANSITIONS=370} [2024-11-16 23:44:35,418 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -59 predicate places. [2024-11-16 23:44:35,418 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 370 transitions, 852 flow [2024-11-16 23:44:35,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 438.8333333333333) internal successors, (2633), 6 states have internal predecessors, (2633), 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-16 23:44:35,419 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:35,419 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:35,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 23:44:35,420 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:35,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:35,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1554219362, now seen corresponding path program 1 times [2024-11-16 23:44:35,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:35,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563385856] [2024-11-16 23:44:35,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:35,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:35,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:44:35,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:35,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563385856] [2024-11-16 23:44:35,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563385856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:35,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:35,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:44:35,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463569398] [2024-11-16 23:44:35,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:35,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:44:35,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:35,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:44:35,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:44:36,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 436 out of 477 [2024-11-16 23:44:36,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 370 transitions, 852 flow. Second operand has 6 states, 6 states have (on average 439.0) internal successors, (2634), 6 states have internal predecessors, (2634), 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-16 23:44:36,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:36,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 436 of 477 [2024-11-16 23:44:36,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:36,320 INFO L124 PetriNetUnfolderBase]: 86/1035 cut-off events. [2024-11-16 23:44:36,321 INFO L125 PetriNetUnfolderBase]: For 60/62 co-relation queries the response was YES. [2024-11-16 23:44:36,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1359 conditions, 1035 events. 86/1035 cut-off events. For 60/62 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5531 event pairs, 5 based on Foata normal form. 0/979 useless extension candidates. Maximal degree in co-relation 1344. Up to 57 conditions per place. [2024-11-16 23:44:36,327 INFO L140 encePairwiseOnDemand]: 469/477 looper letters, 25 selfloop transitions, 6 changer transitions 0/373 dead transitions. [2024-11-16 23:44:36,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 373 transitions, 924 flow [2024-11-16 23:44:36,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:44:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:44:36,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2649 transitions. [2024-11-16 23:44:36,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9255765199161425 [2024-11-16 23:44:36,330 INFO L175 Difference]: Start difference. First operand has 379 places, 370 transitions, 852 flow. Second operand 6 states and 2649 transitions. [2024-11-16 23:44:36,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 373 transitions, 924 flow [2024-11-16 23:44:36,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 373 transitions, 915 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-16 23:44:36,335 INFO L231 Difference]: Finished difference. Result has 379 places, 369 transitions, 858 flow [2024-11-16 23:44:36,335 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=858, PETRI_PLACES=379, PETRI_TRANSITIONS=369} [2024-11-16 23:44:36,336 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -59 predicate places. [2024-11-16 23:44:36,336 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 369 transitions, 858 flow [2024-11-16 23:44:36,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 439.0) internal successors, (2634), 6 states have internal predecessors, (2634), 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-16 23:44:36,336 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:36,337 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:36,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-16 23:44:36,337 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:36,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1712686189, now seen corresponding path program 1 times [2024-11-16 23:44:36,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:36,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011282660] [2024-11-16 23:44:36,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:36,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:36,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:44:36,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:36,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011282660] [2024-11-16 23:44:36,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011282660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:36,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:36,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:44:36,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324408663] [2024-11-16 23:44:36,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:36,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:44:36,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:36,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:44:36,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:44:37,035 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 436 out of 477 [2024-11-16 23:44:37,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 369 transitions, 858 flow. Second operand has 6 states, 6 states have (on average 438.8333333333333) internal successors, (2633), 6 states have internal predecessors, (2633), 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-16 23:44:37,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:37,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 436 of 477 [2024-11-16 23:44:37,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:37,254 INFO L124 PetriNetUnfolderBase]: 80/1262 cut-off events. [2024-11-16 23:44:37,254 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-11-16 23:44:37,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1626 conditions, 1262 events. 80/1262 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 7203 event pairs, 4 based on Foata normal form. 0/1203 useless extension candidates. Maximal degree in co-relation 1610. Up to 41 conditions per place. [2024-11-16 23:44:37,263 INFO L140 encePairwiseOnDemand]: 469/477 looper letters, 25 selfloop transitions, 6 changer transitions 0/371 dead transitions. [2024-11-16 23:44:37,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 371 transitions, 928 flow [2024-11-16 23:44:37,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:44:37,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:44:37,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2649 transitions. [2024-11-16 23:44:37,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9255765199161425 [2024-11-16 23:44:37,267 INFO L175 Difference]: Start difference. First operand has 379 places, 369 transitions, 858 flow. Second operand 6 states and 2649 transitions. [2024-11-16 23:44:37,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 371 transitions, 928 flow [2024-11-16 23:44:37,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 371 transitions, 919 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-16 23:44:37,281 INFO L231 Difference]: Finished difference. Result has 378 places, 367 transitions, 857 flow [2024-11-16 23:44:37,281 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=857, PETRI_PLACES=378, PETRI_TRANSITIONS=367} [2024-11-16 23:44:37,282 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -60 predicate places. [2024-11-16 23:44:37,282 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 367 transitions, 857 flow [2024-11-16 23:44:37,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 438.8333333333333) internal successors, (2633), 6 states have internal predecessors, (2633), 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-16 23:44:37,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:37,283 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:37,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-16 23:44:37,283 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:37,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:37,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1560753734, now seen corresponding path program 1 times [2024-11-16 23:44:37,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:37,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275318171] [2024-11-16 23:44:37,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:37,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:44:37,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:37,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275318171] [2024-11-16 23:44:37,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275318171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:37,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:37,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:44:37,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598567489] [2024-11-16 23:44:37,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:37,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:44:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:37,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:44:37,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:44:37,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 436 out of 477 [2024-11-16 23:44:37,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 367 transitions, 857 flow. Second operand has 6 states, 6 states have (on average 439.0) internal successors, (2634), 6 states have internal predecessors, (2634), 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-16 23:44:37,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:37,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 436 of 477 [2024-11-16 23:44:37,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:38,114 INFO L124 PetriNetUnfolderBase]: 81/1011 cut-off events. [2024-11-16 23:44:38,115 INFO L125 PetriNetUnfolderBase]: For 78/80 co-relation queries the response was YES. [2024-11-16 23:44:38,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1341 conditions, 1011 events. 81/1011 cut-off events. For 78/80 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5223 event pairs, 5 based on Foata normal form. 0/973 useless extension candidates. Maximal degree in co-relation 1325. Up to 56 conditions per place. [2024-11-16 23:44:38,120 INFO L140 encePairwiseOnDemand]: 469/477 looper letters, 25 selfloop transitions, 6 changer transitions 0/369 dead transitions. [2024-11-16 23:44:38,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 369 transitions, 927 flow [2024-11-16 23:44:38,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:44:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:44:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2649 transitions. [2024-11-16 23:44:38,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9255765199161425 [2024-11-16 23:44:38,122 INFO L175 Difference]: Start difference. First operand has 378 places, 367 transitions, 857 flow. Second operand 6 states and 2649 transitions. [2024-11-16 23:44:38,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 369 transitions, 927 flow [2024-11-16 23:44:38,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 369 transitions, 915 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:44:38,126 INFO L231 Difference]: Finished difference. Result has 376 places, 365 transitions, 853 flow [2024-11-16 23:44:38,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=853, PETRI_PLACES=376, PETRI_TRANSITIONS=365} [2024-11-16 23:44:38,127 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -62 predicate places. [2024-11-16 23:44:38,128 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 365 transitions, 853 flow [2024-11-16 23:44:38,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 439.0) internal successors, (2634), 6 states have internal predecessors, (2634), 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-16 23:44:38,128 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:38,128 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:38,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-16 23:44:38,129 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:38,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:38,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1319559897, now seen corresponding path program 1 times [2024-11-16 23:44:38,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:38,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069924676] [2024-11-16 23:44:38,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:38,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:44:38,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:38,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069924676] [2024-11-16 23:44:38,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069924676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:38,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:38,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:38,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53048123] [2024-11-16 23:44:38,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:38,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:38,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:38,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:38,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:38,192 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 477 [2024-11-16 23:44:38,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 365 transitions, 853 flow. Second operand has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 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-16 23:44:38,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:38,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 477 [2024-11-16 23:44:38,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:38,296 INFO L124 PetriNetUnfolderBase]: 74/1230 cut-off events. [2024-11-16 23:44:38,296 INFO L125 PetriNetUnfolderBase]: For 46/48 co-relation queries the response was YES. [2024-11-16 23:44:38,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1538 conditions, 1230 events. 74/1230 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6708 event pairs, 5 based on Foata normal form. 0/1186 useless extension candidates. Maximal degree in co-relation 1522. Up to 36 conditions per place. [2024-11-16 23:44:38,304 INFO L140 encePairwiseOnDemand]: 474/477 looper letters, 8 selfloop transitions, 2 changer transitions 0/365 dead transitions. [2024-11-16 23:44:38,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 365 transitions, 874 flow [2024-11-16 23:44:38,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:38,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1364 transitions. [2024-11-16 23:44:38,306 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9531795946890287 [2024-11-16 23:44:38,306 INFO L175 Difference]: Start difference. First operand has 376 places, 365 transitions, 853 flow. Second operand 3 states and 1364 transitions. [2024-11-16 23:44:38,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 365 transitions, 874 flow [2024-11-16 23:44:38,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 365 transitions, 862 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:44:38,311 INFO L231 Difference]: Finished difference. Result has 372 places, 364 transitions, 843 flow [2024-11-16 23:44:38,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=843, PETRI_PLACES=372, PETRI_TRANSITIONS=364} [2024-11-16 23:44:38,312 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -66 predicate places. [2024-11-16 23:44:38,312 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 364 transitions, 843 flow [2024-11-16 23:44:38,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.3333333333333) internal successors, (1357), 3 states have internal predecessors, (1357), 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-16 23:44:38,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:44:38,312 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:44:38,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-16 23:44:38,313 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-16 23:44:38,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:44:38,313 INFO L85 PathProgramCache]: Analyzing trace with hash -653070273, now seen corresponding path program 1 times [2024-11-16 23:44:38,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:44:38,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092015608] [2024-11-16 23:44:38,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:44:38,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:44:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:44:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 23:44:38,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:44:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092015608] [2024-11-16 23:44:38,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092015608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:44:38,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:44:38,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:44:38,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187428996] [2024-11-16 23:44:38,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:44:38,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:44:38,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:44:38,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:44:38,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:44:38,375 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 451 out of 477 [2024-11-16 23:44:38,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 364 transitions, 843 flow. Second operand has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 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-16 23:44:38,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:44:38,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 451 of 477 [2024-11-16 23:44:38,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:44:38,449 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1122] L77-2-->L77-1: Formula: (= |v_thread2Thread1of1ForFork0_#t~nondet17_3| |v_#race~res2~0_3|) InVars {thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|} OutVars{thread2Thread1of1ForFork0_#t~nondet17=|v_thread2Thread1of1ForFork0_#t~nondet17_3|, #race~res2~0=|v_#race~res2~0_3|} AuxVars[] AssignedVars[#race~res2~0][273], [493#(= |#race~count1~0| 0), Black: 537#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 630#true, 662#true, Black: 516#(not |thread2Thread1of1ForFork0_#t~short10|), Black: 645#(and (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread2Thread1of1ForFork0_~i~1 4) 3 ~get2~0.offset)) 0)), Black: 522#true, Black: 491#true, 158#L100true, 497#(= |#race~count2~0| 0), 526#true, Black: 495#true, 487#(= |#race~n2~0| 0), 603#true, 475#(= |#race~n1~0| 0), 659#true, 509#(= |#race~get1~0| 0), 160#L77-1true, Black: 504#(not |thread1Thread1of1ForFork1_#t~short1|), Black: 589#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 524#(= |#race~get2~0| 0), Black: 507#true, Black: 638#(and (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4) 1))) (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) 0))]) [2024-11-16 23:44:38,450 INFO L294 olderBase$Statistics]: this new event has 252 ancestors and is cut-off event [2024-11-16 23:44:38,450 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-11-16 23:44:38,450 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2024-11-16 23:44:38,450 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2024-11-16 23:44:38,450 INFO L124 PetriNetUnfolderBase]: 65/912 cut-off events. [2024-11-16 23:44:38,450 INFO L125 PetriNetUnfolderBase]: For 37/39 co-relation queries the response was YES. [2024-11-16 23:44:38,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 912 events. 65/912 cut-off events. For 37/39 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4143 event pairs, 6 based on Foata normal form. 0/882 useless extension candidates. Maximal degree in co-relation 1125. Up to 44 conditions per place. [2024-11-16 23:44:38,455 INFO L140 encePairwiseOnDemand]: 474/477 looper letters, 0 selfloop transitions, 0 changer transitions 364/364 dead transitions. [2024-11-16 23:44:38,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 364 transitions, 864 flow [2024-11-16 23:44:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:44:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:44:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1364 transitions. [2024-11-16 23:44:38,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9531795946890287 [2024-11-16 23:44:38,457 INFO L175 Difference]: Start difference. First operand has 372 places, 364 transitions, 843 flow. Second operand 3 states and 1364 transitions. [2024-11-16 23:44:38,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 364 transitions, 864 flow [2024-11-16 23:44:38,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 364 transitions, 860 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:44:38,460 INFO L231 Difference]: Finished difference. Result has 371 places, 0 transitions, 0 flow [2024-11-16 23:44:38,460 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=477, PETRI_DIFFERENCE_MINUEND_FLOW=837, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=371, PETRI_TRANSITIONS=0} [2024-11-16 23:44:38,461 INFO L277 CegarLoopForPetriNet]: 438 programPoint places, -67 predicate places. [2024-11-16 23:44:38,461 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 0 transitions, 0 flow [2024-11-16 23:44:38,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 452.6666666666667) internal successors, (1358), 3 states have internal predecessors, (1358), 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-16 23:44:38,463 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2024-11-16 23:44:38,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2024-11-16 23:44:38,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2024-11-16 23:44:38,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2024-11-16 23:44:38,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2024-11-16 23:44:38,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2024-11-16 23:44:38,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2024-11-16 23:44:38,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2024-11-16 23:44:38,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2024-11-16 23:44:38,464 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2024-11-16 23:44:38,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2024-11-16 23:44:38,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2024-11-16 23:44:38,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2024-11-16 23:44:38,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2024-11-16 23:44:38,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2024-11-16 23:44:38,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2024-11-16 23:44:38,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2024-11-16 23:44:38,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2024-11-16 23:44:38,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2024-11-16 23:44:38,465 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2024-11-16 23:44:38,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2024-11-16 23:44:38,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2024-11-16 23:44:38,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2024-11-16 23:44:38,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2024-11-16 23:44:38,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2024-11-16 23:44:38,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2024-11-16 23:44:38,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2024-11-16 23:44:38,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2024-11-16 23:44:38,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2024-11-16 23:44:38,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2024-11-16 23:44:38,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2024-11-16 23:44:38,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2024-11-16 23:44:38,466 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2024-11-16 23:44:38,467 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2024-11-16 23:44:38,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2024-11-16 23:44:38,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2024-11-16 23:44:38,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2024-11-16 23:44:38,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (40 of 94 remaining) [2024-11-16 23:44:38,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2024-11-16 23:44:38,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 94 remaining) [2024-11-16 23:44:38,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2024-11-16 23:44:38,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2024-11-16 23:44:38,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2024-11-16 23:44:38,468 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2024-11-16 23:44:38,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2024-11-16 23:44:38,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2024-11-16 23:44:38,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2024-11-16 23:44:38,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2024-11-16 23:44:38,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2024-11-16 23:44:38,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2024-11-16 23:44:38,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2024-11-16 23:44:38,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2024-11-16 23:44:38,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2024-11-16 23:44:38,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2024-11-16 23:44:38,469 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2024-11-16 23:44:38,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2024-11-16 23:44:38,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2024-11-16 23:44:38,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2024-11-16 23:44:38,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2024-11-16 23:44:38,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2024-11-16 23:44:38,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2024-11-16 23:44:38,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2024-11-16 23:44:38,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2024-11-16 23:44:38,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2024-11-16 23:44:38,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2024-11-16 23:44:38,470 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2024-11-16 23:44:38,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2024-11-16 23:44:38,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2024-11-16 23:44:38,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2024-11-16 23:44:38,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2024-11-16 23:44:38,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2024-11-16 23:44:38,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2024-11-16 23:44:38,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2024-11-16 23:44:38,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2024-11-16 23:44:38,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2024-11-16 23:44:38,471 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2024-11-16 23:44:38,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2024-11-16 23:44:38,472 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2024-11-16 23:44:38,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-16 23:44:38,472 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:44:38,477 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 23:44:38,477 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 23:44:38,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:44:38 BasicIcfg [2024-11-16 23:44:38,482 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 23:44:38,482 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 23:44:38,482 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 23:44:38,482 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 23:44:38,482 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:44:25" (3/4) ... [2024-11-16 23:44:38,484 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 23:44:38,486 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-16 23:44:38,486 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-16 23:44:38,492 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2024-11-16 23:44:38,493 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 23:44:38,494 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 23:44:38,494 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 23:44:38,582 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 23:44:38,583 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 23:44:38,583 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 23:44:38,583 INFO L158 Benchmark]: Toolchain (without parser) took 14269.78ms. Allocated memory was 151.0MB in the beginning and 761.3MB in the end (delta: 610.3MB). Free memory was 97.9MB in the beginning and 407.9MB in the end (delta: -310.0MB). Peak memory consumption was 299.8MB. Max. memory is 16.1GB. [2024-11-16 23:44:38,583 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:44:38,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.05ms. Allocated memory is still 151.0MB. Free memory was 97.4MB in the beginning and 115.3MB in the end (delta: -17.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 23:44:38,583 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.16ms. Allocated memory is still 151.0MB. Free memory was 115.3MB in the beginning and 112.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:44:38,584 INFO L158 Benchmark]: Boogie Preprocessor took 39.04ms. Allocated memory is still 151.0MB. Free memory was 112.7MB in the beginning and 110.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:44:38,584 INFO L158 Benchmark]: IcfgBuilder took 921.70ms. Allocated memory is still 151.0MB. Free memory was 110.6MB in the beginning and 74.0MB in the end (delta: 36.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-16 23:44:38,584 INFO L158 Benchmark]: TraceAbstraction took 12796.37ms. Allocated memory was 151.0MB in the beginning and 761.3MB in the end (delta: 610.3MB). Free memory was 73.4MB in the beginning and 414.2MB in the end (delta: -340.7MB). Peak memory consumption was 271.8MB. Max. memory is 16.1GB. [2024-11-16 23:44:38,584 INFO L158 Benchmark]: Witness Printer took 100.73ms. Allocated memory is still 761.3MB. Free memory was 414.2MB in the beginning and 407.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 23:44:38,585 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.17ms. Allocated memory is still 151.0MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.05ms. Allocated memory is still 151.0MB. Free memory was 97.4MB in the beginning and 115.3MB in the end (delta: -17.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.16ms. Allocated memory is still 151.0MB. Free memory was 115.3MB in the beginning and 112.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.04ms. Allocated memory is still 151.0MB. Free memory was 112.7MB in the beginning and 110.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 921.70ms. Allocated memory is still 151.0MB. Free memory was 110.6MB in the beginning and 74.0MB in the end (delta: 36.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12796.37ms. Allocated memory was 151.0MB in the beginning and 761.3MB in the end (delta: 610.3MB). Free memory was 73.4MB in the beginning and 414.2MB in the end (delta: -340.7MB). Peak memory consumption was 271.8MB. Max. memory is 16.1GB. * Witness Printer took 100.73ms. Allocated memory is still 761.3MB. Free memory was 414.2MB in the beginning and 407.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: 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: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: 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: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: 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: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: 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, 670 locations, 94 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: 12.5s, OverallIterations: 31, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3915 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2387 mSDsluCounter, 4312 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3793 mSDsCounter, 634 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5793 IncrementalHoareTripleChecker+Invalid, 6427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 634 mSolverCounterUnsat, 519 mSDtfsCounter, 5793 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1331occurred in iteration=23, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 4159 NumberOfCodeBlocks, 4159 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 4128 ConstructedInterpolants, 0 QuantifiedInterpolants, 5425 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 28/28 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 54 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-16 23:44:38,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE