./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/array-eq-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/array-eq-trans.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 e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:35:36,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:35:36,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:35:36,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:35:36,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:35:36,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:35:36,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:35:36,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:35:36,316 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:35:36,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:35:36,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:35:36,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:35:36,319 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:35:36,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:35:36,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:35:36,322 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:35:36,322 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:35:36,322 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:35:36,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:35:36,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:35:36,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:35:36,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:35:36,327 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:35:36,327 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:35:36,327 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:35:36,327 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:35:36,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:35:36,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:35:36,328 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:35:36,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:35:36,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:35:36,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:35:36,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:35:36,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:35:36,330 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:35:36,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:35:36,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:35:36,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:35:36,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:35:36,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:35:36,334 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:35:36,334 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 -> e7f1528a4c77969c5bff279724a3ed43475460be047e2e4b141f1353c3ea9cfe [2024-11-10 14:35:36,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:35:36,637 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:35:36,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:35:36,641 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:35:36,642 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:35:36,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2024-11-10 14:35:38,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:35:38,332 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:35:38,333 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2024-11-10 14:35:38,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b54ca24d/28261432c9ce4c319460f3baeb055b33/FLAGac9dabae6 [2024-11-10 14:35:38,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b54ca24d/28261432c9ce4c319460f3baeb055b33 [2024-11-10 14:35:38,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:35:38,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:35:38,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:35:38,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:35:38,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:35:38,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:35:38" (1/1) ... [2024-11-10 14:35:38,377 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2089bdaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:38, skipping insertion in model container [2024-11-10 14:35:38,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:35:38" (1/1) ... [2024-11-10 14:35:38,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:35:38,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:35:38,679 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:35:38,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:35:38,741 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:35:38,741 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:38 WrapperNode [2024-11-10 14:35:38,741 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:35:38,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:35:38,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:35:38,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:35:38,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:38" (1/1) ... [2024-11-10 14:35:38,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:38" (1/1) ... [2024-11-10 14:35:38,801 INFO L138 Inliner]: procedures = 23, calls = 32, calls flagged for inlining = 11, calls inlined = 15, statements flattened = 322 [2024-11-10 14:35:38,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:35:38,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:35:38,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:35:38,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:35:38,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:38" (1/1) ... [2024-11-10 14:35:38,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:38" (1/1) ... [2024-11-10 14:35:38,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:38" (1/1) ... [2024-11-10 14:35:38,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:38" (1/1) ... [2024-11-10 14:35:38,854 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:38" (1/1) ... [2024-11-10 14:35:38,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:38" (1/1) ... [2024-11-10 14:35:38,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:38" (1/1) ... [2024-11-10 14:35:38,863 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:38" (1/1) ... [2024-11-10 14:35:38,874 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:35:38,875 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:35:38,876 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:35:38,876 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:35:38,877 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:38" (1/1) ... [2024-11-10 14:35:38,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:35:38,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:35:38,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:35:38,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:35:38,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:35:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:35:38,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:35:38,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:35:38,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:35:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 14:35:38,960 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 14:35:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:35:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:35:38,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:35:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:35:38,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:35:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:35:38,963 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:35:39,108 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:35:39,110 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:35:39,960 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:35:39,960 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:35:39,996 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:35:39,998 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:35:39,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:35:39 BoogieIcfgContainer [2024-11-10 14:35:39,999 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:35:40,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:35:40,001 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:35:40,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:35:40,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:35:38" (1/3) ... [2024-11-10 14:35:40,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f473f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:35:40, skipping insertion in model container [2024-11-10 14:35:40,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:35:38" (2/3) ... [2024-11-10 14:35:40,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f473f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:35:40, skipping insertion in model container [2024-11-10 14:35:40,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:35:39" (3/3) ... [2024-11-10 14:35:40,010 INFO L112 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2024-11-10 14:35:40,031 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:35:40,031 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 78 error locations. [2024-11-10 14:35:40,031 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:35:40,164 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:35:40,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 605 places, 628 transitions, 1277 flow [2024-11-10 14:35:40,461 INFO L124 PetriNetUnfolderBase]: 33/625 cut-off events. [2024-11-10 14:35:40,462 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:35:40,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 625 events. 33/625 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1490 event pairs, 0 based on Foata normal form. 0/514 useless extension candidates. Maximal degree in co-relation 374. Up to 3 conditions per place. [2024-11-10 14:35:40,474 INFO L82 GeneralOperation]: Start removeDead. Operand has 605 places, 628 transitions, 1277 flow [2024-11-10 14:35:40,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 580 places, 600 transitions, 1218 flow [2024-11-10 14:35:40,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:35:40,506 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;@222b6459, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:35:40,506 INFO L334 AbstractCegarLoop]: Starting to check reachability of 117 error locations. [2024-11-10 14:35:40,512 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:35:40,512 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-10 14:35:40,513 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:35:40,513 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:40,514 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] [2024-11-10 14:35:40,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:40,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:40,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1477156152, now seen corresponding path program 1 times [2024-11-10 14:35:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:40,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377743672] [2024-11-10 14:35:40,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:40,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:40,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:40,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:40,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377743672] [2024-11-10 14:35:40,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377743672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:40,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:40,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:40,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768986963] [2024-11-10 14:35:40,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:40,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:40,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:40,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:40,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:40,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 628 [2024-11-10 14:35:40,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 600 transitions, 1218 flow. Second operand has 3 states, 3 states have (on average 595.3333333333334) internal successors, (1786), 3 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:40,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:40,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 628 [2024-11-10 14:35:40,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:41,040 INFO L124 PetriNetUnfolderBase]: 30/790 cut-off events. [2024-11-10 14:35:41,040 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-10 14:35:41,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 790 events. 30/790 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2617 event pairs, 5 based on Foata normal form. 30/673 useless extension candidates. Maximal degree in co-relation 443. Up to 28 conditions per place. [2024-11-10 14:35:41,056 INFO L140 encePairwiseOnDemand]: 611/628 looper letters, 14 selfloop transitions, 2 changer transitions 8/585 dead transitions. [2024-11-10 14:35:41,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 585 transitions, 1220 flow [2024-11-10 14:35:41,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:41,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1813 transitions. [2024-11-10 14:35:41,082 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9623142250530785 [2024-11-10 14:35:41,084 INFO L175 Difference]: Start difference. First operand has 580 places, 600 transitions, 1218 flow. Second operand 3 states and 1813 transitions. [2024-11-10 14:35:41,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 585 transitions, 1220 flow [2024-11-10 14:35:41,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 585 transitions, 1208 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:35:41,109 INFO L231 Difference]: Finished difference. Result has 575 places, 577 transitions, 1164 flow [2024-11-10 14:35:41,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1176, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1164, PETRI_PLACES=575, PETRI_TRANSITIONS=577} [2024-11-10 14:35:41,118 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -5 predicate places. [2024-11-10 14:35:41,119 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 577 transitions, 1164 flow [2024-11-10 14:35:41,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 595.3333333333334) internal successors, (1786), 3 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:41,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:41,121 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] [2024-11-10 14:35:41,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:35:41,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:41,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:41,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1670594980, now seen corresponding path program 1 times [2024-11-10 14:35:41,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:41,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174000282] [2024-11-10 14:35:41,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:41,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:41,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:41,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174000282] [2024-11-10 14:35:41,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174000282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:41,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:41,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:41,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32781991] [2024-11-10 14:35:41,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:41,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:41,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:41,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:41,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:41,259 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 628 [2024-11-10 14:35:41,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 577 transitions, 1164 flow. Second operand has 3 states, 3 states have (on average 595.3333333333334) internal successors, (1786), 3 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:41,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:41,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 628 [2024-11-10 14:35:41,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:41,473 INFO L124 PetriNetUnfolderBase]: 38/922 cut-off events. [2024-11-10 14:35:41,473 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:35:41,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 922 events. 38/922 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3685 event pairs, 7 based on Foata normal form. 0/753 useless extension candidates. Maximal degree in co-relation 932. Up to 31 conditions per place. [2024-11-10 14:35:41,486 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 14 selfloop transitions, 2 changer transitions 0/576 dead transitions. [2024-11-10 14:35:41,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 576 transitions, 1194 flow [2024-11-10 14:35:41,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1799 transitions. [2024-11-10 14:35:41,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9548832271762208 [2024-11-10 14:35:41,492 INFO L175 Difference]: Start difference. First operand has 575 places, 577 transitions, 1164 flow. Second operand 3 states and 1799 transitions. [2024-11-10 14:35:41,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 576 transitions, 1194 flow [2024-11-10 14:35:41,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 576 transitions, 1190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:41,502 INFO L231 Difference]: Finished difference. Result has 566 places, 576 transitions, 1162 flow [2024-11-10 14:35:41,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1162, PETRI_PLACES=566, PETRI_TRANSITIONS=576} [2024-11-10 14:35:41,504 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -14 predicate places. [2024-11-10 14:35:41,504 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 576 transitions, 1162 flow [2024-11-10 14:35:41,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 595.3333333333334) internal successors, (1786), 3 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:41,505 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:41,506 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:41,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:35:41,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:41,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:41,506 INFO L85 PathProgramCache]: Analyzing trace with hash -113024282, now seen corresponding path program 1 times [2024-11-10 14:35:41,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:41,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43544951] [2024-11-10 14:35:41,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:41,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:41,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:41,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43544951] [2024-11-10 14:35:41,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43544951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:41,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:41,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:41,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752952396] [2024-11-10 14:35:41,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:41,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:41,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:41,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:41,626 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 628 [2024-11-10 14:35:41,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 576 transitions, 1162 flow. Second operand has 3 states, 3 states have (on average 595.3333333333334) internal successors, (1786), 3 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:41,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:41,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 628 [2024-11-10 14:35:41,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:41,722 INFO L124 PetriNetUnfolderBase]: 26/655 cut-off events. [2024-11-10 14:35:41,723 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:35:41,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 655 events. 26/655 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1780 event pairs, 7 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 651. Up to 28 conditions per place. [2024-11-10 14:35:41,731 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 14 selfloop transitions, 2 changer transitions 0/575 dead transitions. [2024-11-10 14:35:41,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 575 transitions, 1192 flow [2024-11-10 14:35:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1799 transitions. [2024-11-10 14:35:41,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9548832271762208 [2024-11-10 14:35:41,736 INFO L175 Difference]: Start difference. First operand has 566 places, 576 transitions, 1162 flow. Second operand 3 states and 1799 transitions. [2024-11-10 14:35:41,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 575 transitions, 1192 flow [2024-11-10 14:35:41,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 575 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:41,745 INFO L231 Difference]: Finished difference. Result has 565 places, 575 transitions, 1160 flow [2024-11-10 14:35:41,746 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1156, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1160, PETRI_PLACES=565, PETRI_TRANSITIONS=575} [2024-11-10 14:35:41,747 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -15 predicate places. [2024-11-10 14:35:41,747 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 575 transitions, 1160 flow [2024-11-10 14:35:41,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 595.3333333333334) internal successors, (1786), 3 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:41,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:41,749 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:41,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:35:41,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:41,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:41,750 INFO L85 PathProgramCache]: Analyzing trace with hash 322305242, now seen corresponding path program 1 times [2024-11-10 14:35:41,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:41,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471697947] [2024-11-10 14:35:41,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:41,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:41,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471697947] [2024-11-10 14:35:41,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471697947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:41,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:41,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:41,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902814105] [2024-11-10 14:35:41,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:41,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:41,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:41,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:41,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:41,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 628 [2024-11-10 14:35:41,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 575 transitions, 1160 flow. Second operand has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:41,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:41,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 628 [2024-11-10 14:35:41,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:41,992 INFO L124 PetriNetUnfolderBase]: 48/974 cut-off events. [2024-11-10 14:35:41,993 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:35:42,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 974 events. 48/974 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4148 event pairs, 12 based on Foata normal form. 0/799 useless extension candidates. Maximal degree in co-relation 985. Up to 48 conditions per place. [2024-11-10 14:35:42,007 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 16 selfloop transitions, 1 changer transitions 0/570 dead transitions. [2024-11-10 14:35:42,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 570 transitions, 1184 flow [2024-11-10 14:35:42,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:42,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2024-11-10 14:35:42,011 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9511677282377919 [2024-11-10 14:35:42,011 INFO L175 Difference]: Start difference. First operand has 565 places, 575 transitions, 1160 flow. Second operand 3 states and 1792 transitions. [2024-11-10 14:35:42,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 570 transitions, 1184 flow [2024-11-10 14:35:42,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 570 transitions, 1180 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:42,020 INFO L231 Difference]: Finished difference. Result has 560 places, 570 transitions, 1148 flow [2024-11-10 14:35:42,021 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1148, PETRI_PLACES=560, PETRI_TRANSITIONS=570} [2024-11-10 14:35:42,022 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -20 predicate places. [2024-11-10 14:35:42,022 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 570 transitions, 1148 flow [2024-11-10 14:35:42,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:42,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:42,024 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] [2024-11-10 14:35:42,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:35:42,024 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:42,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:42,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2078087571, now seen corresponding path program 1 times [2024-11-10 14:35:42,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:42,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593036470] [2024-11-10 14:35:42,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:42,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:42,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:42,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593036470] [2024-11-10 14:35:42,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593036470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:42,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:42,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:42,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455603236] [2024-11-10 14:35:42,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:42,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:42,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:42,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:42,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:42,148 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 628 [2024-11-10 14:35:42,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 570 transitions, 1148 flow. Second operand has 3 states, 3 states have (on average 596.3333333333334) internal successors, (1789), 3 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:42,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:42,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 628 [2024-11-10 14:35:42,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:42,248 INFO L124 PetriNetUnfolderBase]: 27/716 cut-off events. [2024-11-10 14:35:42,248 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:35:42,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 716 events. 27/716 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2197 event pairs, 5 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 700. Up to 24 conditions per place. [2024-11-10 14:35:42,261 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/569 dead transitions. [2024-11-10 14:35:42,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 569 transitions, 1176 flow [2024-11-10 14:35:42,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:42,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2024-11-10 14:35:42,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9559447983014862 [2024-11-10 14:35:42,266 INFO L175 Difference]: Start difference. First operand has 560 places, 570 transitions, 1148 flow. Second operand 3 states and 1801 transitions. [2024-11-10 14:35:42,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 569 transitions, 1176 flow [2024-11-10 14:35:42,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 569 transitions, 1175 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:35:42,276 INFO L231 Difference]: Finished difference. Result has 560 places, 569 transitions, 1149 flow [2024-11-10 14:35:42,276 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1145, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1149, PETRI_PLACES=560, PETRI_TRANSITIONS=569} [2024-11-10 14:35:42,277 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -20 predicate places. [2024-11-10 14:35:42,278 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 569 transitions, 1149 flow [2024-11-10 14:35:42,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 596.3333333333334) internal successors, (1789), 3 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:42,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:42,279 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] [2024-11-10 14:35:42,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:35:42,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:42,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:42,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1311556442, now seen corresponding path program 1 times [2024-11-10 14:35:42,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:42,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453341798] [2024-11-10 14:35:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:42,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:42,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453341798] [2024-11-10 14:35:42,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453341798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:42,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:42,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:35:42,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278287645] [2024-11-10 14:35:42,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:42,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:35:42,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:42,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:35:42,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:35:43,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 516 out of 628 [2024-11-10 14:35:43,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 569 transitions, 1149 flow. Second operand has 6 states, 6 states have (on average 517.5) internal successors, (3105), 6 states have internal predecessors, (3105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:43,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:43,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 516 of 628 [2024-11-10 14:35:43,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:45,738 INFO L124 PetriNetUnfolderBase]: 2269/12733 cut-off events. [2024-11-10 14:35:45,739 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2024-11-10 14:35:45,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15688 conditions, 12733 events. 2269/12733 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 149208 event pairs, 1520 based on Foata normal form. 0/10041 useless extension candidates. Maximal degree in co-relation 15639. Up to 2844 conditions per place. [2024-11-10 14:35:45,860 INFO L140 encePairwiseOnDemand]: 610/628 looper letters, 78 selfloop transitions, 15 changer transitions 0/566 dead transitions. [2024-11-10 14:35:45,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 566 transitions, 1329 flow [2024-11-10 14:35:45,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:35:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:35:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3192 transitions. [2024-11-10 14:35:45,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8471337579617835 [2024-11-10 14:35:45,868 INFO L175 Difference]: Start difference. First operand has 560 places, 569 transitions, 1149 flow. Second operand 6 states and 3192 transitions. [2024-11-10 14:35:45,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 566 transitions, 1329 flow [2024-11-10 14:35:45,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 566 transitions, 1325 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:45,879 INFO L231 Difference]: Finished difference. Result has 560 places, 566 transitions, 1169 flow [2024-11-10 14:35:45,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1139, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1169, PETRI_PLACES=560, PETRI_TRANSITIONS=566} [2024-11-10 14:35:45,883 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -20 predicate places. [2024-11-10 14:35:45,883 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 566 transitions, 1169 flow [2024-11-10 14:35:45,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 517.5) internal successors, (3105), 6 states have internal predecessors, (3105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:45,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:45,886 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:45,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:35:45,886 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:45,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:45,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1347276806, now seen corresponding path program 1 times [2024-11-10 14:35:45,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:45,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646829261] [2024-11-10 14:35:45,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:45,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:45,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:45,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646829261] [2024-11-10 14:35:45,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646829261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:45,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:45,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:45,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843460611] [2024-11-10 14:35:45,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:45,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:45,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:45,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:45,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:45,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 628 [2024-11-10 14:35:45,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 566 transitions, 1169 flow. Second operand has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:45,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:45,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 628 [2024-11-10 14:35:45,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:46,143 INFO L124 PetriNetUnfolderBase]: 73/1297 cut-off events. [2024-11-10 14:35:46,144 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:35:46,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 1297 events. 73/1297 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 7137 event pairs, 20 based on Foata normal form. 0/1064 useless extension candidates. Maximal degree in co-relation 1347. Up to 65 conditions per place. [2024-11-10 14:35:46,165 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 16 selfloop transitions, 1 changer transitions 0/561 dead transitions. [2024-11-10 14:35:46,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 561 transitions, 1193 flow [2024-11-10 14:35:46,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:46,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2024-11-10 14:35:46,169 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9511677282377919 [2024-11-10 14:35:46,169 INFO L175 Difference]: Start difference. First operand has 560 places, 566 transitions, 1169 flow. Second operand 3 states and 1792 transitions. [2024-11-10 14:35:46,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 561 transitions, 1193 flow [2024-11-10 14:35:46,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 561 transitions, 1163 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:35:46,178 INFO L231 Difference]: Finished difference. Result has 552 places, 561 transitions, 1131 flow [2024-11-10 14:35:46,179 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1129, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1131, PETRI_PLACES=552, PETRI_TRANSITIONS=561} [2024-11-10 14:35:46,180 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -28 predicate places. [2024-11-10 14:35:46,180 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 561 transitions, 1131 flow [2024-11-10 14:35:46,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:46,182 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:46,182 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:46,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:35:46,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:46,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash 834076290, now seen corresponding path program 1 times [2024-11-10 14:35:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:46,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449196627] [2024-11-10 14:35:46,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:46,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:46,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:46,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:46,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449196627] [2024-11-10 14:35:46,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449196627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:46,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:46,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:46,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166990784] [2024-11-10 14:35:46,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:46,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:46,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:46,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:46,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:46,270 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 628 [2024-11-10 14:35:46,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 561 transitions, 1131 flow. Second operand has 3 states, 3 states have (on average 596.3333333333334) internal successors, (1789), 3 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:46,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:46,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 628 [2024-11-10 14:35:46,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:46,437 INFO L124 PetriNetUnfolderBase]: 35/843 cut-off events. [2024-11-10 14:35:46,437 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:35:46,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 843 events. 35/843 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3065 event pairs, 7 based on Foata normal form. 0/707 useless extension candidates. Maximal degree in co-relation 833. Up to 27 conditions per place. [2024-11-10 14:35:46,445 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2024-11-10 14:35:46,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 560 transitions, 1159 flow [2024-11-10 14:35:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2024-11-10 14:35:46,449 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9559447983014862 [2024-11-10 14:35:46,449 INFO L175 Difference]: Start difference. First operand has 552 places, 561 transitions, 1131 flow. Second operand 3 states and 1801 transitions. [2024-11-10 14:35:46,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 560 transitions, 1159 flow [2024-11-10 14:35:46,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 560 transitions, 1158 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:35:46,458 INFO L231 Difference]: Finished difference. Result has 552 places, 560 transitions, 1132 flow [2024-11-10 14:35:46,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1132, PETRI_PLACES=552, PETRI_TRANSITIONS=560} [2024-11-10 14:35:46,459 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -28 predicate places. [2024-11-10 14:35:46,459 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 560 transitions, 1132 flow [2024-11-10 14:35:46,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 596.3333333333334) internal successors, (1789), 3 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:46,462 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:46,462 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] [2024-11-10 14:35:46,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:35:46,463 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:46,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:46,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1788007152, now seen corresponding path program 1 times [2024-11-10 14:35:46,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:46,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348304862] [2024-11-10 14:35:46,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:46,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:46,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:46,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348304862] [2024-11-10 14:35:46,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348304862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:46,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:46,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:46,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839910552] [2024-11-10 14:35:46,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:46,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:46,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:46,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:46,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:46,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 590 out of 628 [2024-11-10 14:35:46,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 560 transitions, 1132 flow. Second operand has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:46,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:46,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 590 of 628 [2024-11-10 14:35:46,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:46,712 INFO L124 PetriNetUnfolderBase]: 70/1158 cut-off events. [2024-11-10 14:35:46,712 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-10 14:35:46,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238 conditions, 1158 events. 70/1158 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 5664 event pairs, 20 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 1188. Up to 67 conditions per place. [2024-11-10 14:35:46,732 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 16 selfloop transitions, 1 changer transitions 0/555 dead transitions. [2024-11-10 14:35:46,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 555 transitions, 1156 flow [2024-11-10 14:35:46,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1792 transitions. [2024-11-10 14:35:46,736 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9511677282377919 [2024-11-10 14:35:46,737 INFO L175 Difference]: Start difference. First operand has 552 places, 560 transitions, 1132 flow. Second operand 3 states and 1792 transitions. [2024-11-10 14:35:46,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 555 transitions, 1156 flow [2024-11-10 14:35:46,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 555 transitions, 1152 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:46,745 INFO L231 Difference]: Finished difference. Result has 547 places, 555 transitions, 1120 flow [2024-11-10 14:35:46,746 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1118, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1120, PETRI_PLACES=547, PETRI_TRANSITIONS=555} [2024-11-10 14:35:46,748 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -33 predicate places. [2024-11-10 14:35:46,748 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 555 transitions, 1120 flow [2024-11-10 14:35:46,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 591.0) internal successors, (1773), 3 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:46,749 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:46,750 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] [2024-11-10 14:35:46,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:35:46,750 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:46,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:46,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1682990641, now seen corresponding path program 1 times [2024-11-10 14:35:46,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:46,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027580430] [2024-11-10 14:35:46,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:46,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:46,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:46,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027580430] [2024-11-10 14:35:46,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027580430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:46,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:46,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:46,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37267970] [2024-11-10 14:35:46,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:46,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:46,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:46,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:46,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:46,842 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 595 out of 628 [2024-11-10 14:35:46,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 555 transitions, 1120 flow. Second operand has 3 states, 3 states have (on average 596.3333333333334) internal successors, (1789), 3 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:46,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:46,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 595 of 628 [2024-11-10 14:35:46,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:46,923 INFO L124 PetriNetUnfolderBase]: 26/632 cut-off events. [2024-11-10 14:35:46,923 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:35:46,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 632 events. 26/632 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1695 event pairs, 7 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 620. Up to 27 conditions per place. [2024-11-10 14:35:46,932 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/554 dead transitions. [2024-11-10 14:35:46,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 554 transitions, 1148 flow [2024-11-10 14:35:46,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2024-11-10 14:35:46,935 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9559447983014862 [2024-11-10 14:35:46,936 INFO L175 Difference]: Start difference. First operand has 547 places, 555 transitions, 1120 flow. Second operand 3 states and 1801 transitions. [2024-11-10 14:35:46,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 554 transitions, 1148 flow [2024-11-10 14:35:46,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 554 transitions, 1147 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:35:46,944 INFO L231 Difference]: Finished difference. Result has 547 places, 554 transitions, 1121 flow [2024-11-10 14:35:46,946 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1117, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1121, PETRI_PLACES=547, PETRI_TRANSITIONS=554} [2024-11-10 14:35:46,946 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -33 predicate places. [2024-11-10 14:35:46,947 INFO L471 AbstractCegarLoop]: Abstraction has has 547 places, 554 transitions, 1121 flow [2024-11-10 14:35:46,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 596.3333333333334) internal successors, (1789), 3 states have internal predecessors, (1789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:46,948 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:46,948 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] [2024-11-10 14:35:46,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:35:46,949 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:46,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:46,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1916024343, now seen corresponding path program 1 times [2024-11-10 14:35:46,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:46,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850874351] [2024-11-10 14:35:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:46,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:47,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:47,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:47,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850874351] [2024-11-10 14:35:47,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850874351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:47,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:47,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:47,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192672741] [2024-11-10 14:35:47,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:47,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:47,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:47,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:47,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:47,037 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 578 out of 628 [2024-11-10 14:35:47,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 547 places, 554 transitions, 1121 flow. Second operand has 3 states, 3 states have (on average 579.0) internal successors, (1737), 3 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:47,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:47,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 578 of 628 [2024-11-10 14:35:47,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:47,149 INFO L124 PetriNetUnfolderBase]: 47/751 cut-off events. [2024-11-10 14:35:47,149 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:35:47,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 751 events. 47/751 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2563 event pairs, 10 based on Foata normal form. 0/660 useless extension candidates. Maximal degree in co-relation 806. Up to 63 conditions per place. [2024-11-10 14:35:47,157 INFO L140 encePairwiseOnDemand]: 617/628 looper letters, 25 selfloop transitions, 2 changer transitions 0/547 dead transitions. [2024-11-10 14:35:47,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 547 transitions, 1163 flow [2024-11-10 14:35:47,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1770 transitions. [2024-11-10 14:35:47,161 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9394904458598726 [2024-11-10 14:35:47,161 INFO L175 Difference]: Start difference. First operand has 547 places, 554 transitions, 1121 flow. Second operand 3 states and 1770 transitions. [2024-11-10 14:35:47,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 547 transitions, 1163 flow [2024-11-10 14:35:47,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 547 transitions, 1159 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:47,169 INFO L231 Difference]: Finished difference. Result has 538 places, 545 transitions, 1103 flow [2024-11-10 14:35:47,170 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=543, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1103, PETRI_PLACES=538, PETRI_TRANSITIONS=545} [2024-11-10 14:35:47,172 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -42 predicate places. [2024-11-10 14:35:47,172 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 545 transitions, 1103 flow [2024-11-10 14:35:47,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 579.0) internal successors, (1737), 3 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:47,173 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:47,173 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] [2024-11-10 14:35:47,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:35:47,174 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:47,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1837646002, now seen corresponding path program 1 times [2024-11-10 14:35:47,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:47,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613933961] [2024-11-10 14:35:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:47,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:47,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:47,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613933961] [2024-11-10 14:35:47,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613933961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:47,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:47,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:47,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170291559] [2024-11-10 14:35:47,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:47,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:47,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:47,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:47,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:47,256 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 578 out of 628 [2024-11-10 14:35:47,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 545 transitions, 1103 flow. Second operand has 3 states, 3 states have (on average 579.3333333333334) internal successors, (1738), 3 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:47,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:47,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 578 of 628 [2024-11-10 14:35:47,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:47,345 INFO L124 PetriNetUnfolderBase]: 44/676 cut-off events. [2024-11-10 14:35:47,346 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-10 14:35:47,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 676 events. 44/676 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2127 event pairs, 2 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 720. Up to 62 conditions per place. [2024-11-10 14:35:47,355 INFO L140 encePairwiseOnDemand]: 617/628 looper letters, 25 selfloop transitions, 2 changer transitions 0/538 dead transitions. [2024-11-10 14:35:47,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 538 transitions, 1145 flow [2024-11-10 14:35:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:47,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:47,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1770 transitions. [2024-11-10 14:35:47,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9394904458598726 [2024-11-10 14:35:47,359 INFO L175 Difference]: Start difference. First operand has 538 places, 545 transitions, 1103 flow. Second operand 3 states and 1770 transitions. [2024-11-10 14:35:47,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 538 transitions, 1145 flow [2024-11-10 14:35:47,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 538 transitions, 1141 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:47,367 INFO L231 Difference]: Finished difference. Result has 529 places, 536 transitions, 1085 flow [2024-11-10 14:35:47,368 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1085, PETRI_PLACES=529, PETRI_TRANSITIONS=536} [2024-11-10 14:35:47,370 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -51 predicate places. [2024-11-10 14:35:47,370 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 536 transitions, 1085 flow [2024-11-10 14:35:47,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 579.3333333333334) internal successors, (1738), 3 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:47,371 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:47,371 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] [2024-11-10 14:35:47,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:35:47,371 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:47,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:47,373 INFO L85 PathProgramCache]: Analyzing trace with hash -273504734, now seen corresponding path program 1 times [2024-11-10 14:35:47,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:47,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353642420] [2024-11-10 14:35:47,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:47,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:47,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:47,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353642420] [2024-11-10 14:35:47,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353642420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:47,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:47,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:35:47,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80416318] [2024-11-10 14:35:47,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:47,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:47,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:47,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:47,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:47,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 628 [2024-11-10 14:35:47,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 536 transitions, 1085 flow. Second operand has 3 states, 3 states have (on average 599.6666666666666) internal successors, (1799), 3 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:47,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:47,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 628 [2024-11-10 14:35:47,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:47,511 INFO L124 PetriNetUnfolderBase]: 38/673 cut-off events. [2024-11-10 14:35:47,511 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 14:35:47,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 673 events. 38/673 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1886 event pairs, 12 based on Foata normal form. 0/606 useless extension candidates. Maximal degree in co-relation 702. Up to 39 conditions per place. [2024-11-10 14:35:47,517 INFO L140 encePairwiseOnDemand]: 624/628 looper letters, 14 selfloop transitions, 3 changer transitions 0/539 dead transitions. [2024-11-10 14:35:47,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 539 transitions, 1127 flow [2024-11-10 14:35:47,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1812 transitions. [2024-11-10 14:35:47,520 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9617834394904459 [2024-11-10 14:35:47,521 INFO L175 Difference]: Start difference. First operand has 529 places, 536 transitions, 1085 flow. Second operand 3 states and 1812 transitions. [2024-11-10 14:35:47,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 539 transitions, 1127 flow [2024-11-10 14:35:47,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 539 transitions, 1123 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:47,531 INFO L231 Difference]: Finished difference. Result has 531 places, 537 transitions, 1099 flow [2024-11-10 14:35:47,532 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1081, PETRI_DIFFERENCE_MINUEND_PLACES=527, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1099, PETRI_PLACES=531, PETRI_TRANSITIONS=537} [2024-11-10 14:35:47,533 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -49 predicate places. [2024-11-10 14:35:47,533 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 537 transitions, 1099 flow [2024-11-10 14:35:47,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 599.6666666666666) internal successors, (1799), 3 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:47,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:47,535 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] [2024-11-10 14:35:47,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:35:47,535 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:47,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:47,535 INFO L85 PathProgramCache]: Analyzing trace with hash -789927523, now seen corresponding path program 1 times [2024-11-10 14:35:47,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:47,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858785416] [2024-11-10 14:35:47,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:47,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:47,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858785416] [2024-11-10 14:35:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858785416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:47,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:47,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539335908] [2024-11-10 14:35:47,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:47,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:47,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:47,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:47,618 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 578 out of 628 [2024-11-10 14:35:47,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 537 transitions, 1099 flow. Second operand has 3 states, 3 states have (on average 579.6666666666666) internal successors, (1739), 3 states have internal predecessors, (1739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:47,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:47,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 578 of 628 [2024-11-10 14:35:47,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:47,696 INFO L124 PetriNetUnfolderBase]: 45/638 cut-off events. [2024-11-10 14:35:47,696 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2024-11-10 14:35:47,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 638 events. 45/638 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1943 event pairs, 18 based on Foata normal form. 0/589 useless extension candidates. Maximal degree in co-relation 681. Up to 65 conditions per place. [2024-11-10 14:35:47,702 INFO L140 encePairwiseOnDemand]: 617/628 looper letters, 25 selfloop transitions, 2 changer transitions 0/530 dead transitions. [2024-11-10 14:35:47,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 530 transitions, 1141 flow [2024-11-10 14:35:47,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1770 transitions. [2024-11-10 14:35:47,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9394904458598726 [2024-11-10 14:35:47,708 INFO L175 Difference]: Start difference. First operand has 531 places, 537 transitions, 1099 flow. Second operand 3 states and 1770 transitions. [2024-11-10 14:35:47,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 524 places, 530 transitions, 1141 flow [2024-11-10 14:35:47,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 522 places, 530 transitions, 1135 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:47,718 INFO L231 Difference]: Finished difference. Result has 522 places, 528 transitions, 1079 flow [2024-11-10 14:35:47,719 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1075, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1079, PETRI_PLACES=522, PETRI_TRANSITIONS=528} [2024-11-10 14:35:47,720 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -58 predicate places. [2024-11-10 14:35:47,720 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 528 transitions, 1079 flow [2024-11-10 14:35:47,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 579.6666666666666) internal successors, (1739), 3 states have internal predecessors, (1739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:47,721 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:47,722 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] [2024-11-10 14:35:47,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:35:47,722 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:47,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:47,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1213787722, now seen corresponding path program 1 times [2024-11-10 14:35:47,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:47,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518494630] [2024-11-10 14:35:47,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:47,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518494630] [2024-11-10 14:35:47,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518494630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:47,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:47,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:47,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404523827] [2024-11-10 14:35:47,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:47,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:47,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:47,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:47,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:47,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 628 [2024-11-10 14:35:47,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 528 transitions, 1079 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:47,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:47,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 628 [2024-11-10 14:35:47,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:47,990 INFO L124 PetriNetUnfolderBase]: 62/1080 cut-off events. [2024-11-10 14:35:47,991 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-10 14:35:47,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1189 conditions, 1080 events. 62/1080 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4721 event pairs, 2 based on Foata normal form. 0/982 useless extension candidates. Maximal degree in co-relation 1139. Up to 52 conditions per place. [2024-11-10 14:35:48,004 INFO L140 encePairwiseOnDemand]: 620/628 looper letters, 20 selfloop transitions, 4 changer transitions 0/533 dead transitions. [2024-11-10 14:35:48,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 533 transitions, 1142 flow [2024-11-10 14:35:48,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:48,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1807 transitions. [2024-11-10 14:35:48,008 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9591295116772823 [2024-11-10 14:35:48,009 INFO L175 Difference]: Start difference. First operand has 522 places, 528 transitions, 1079 flow. Second operand 3 states and 1807 transitions. [2024-11-10 14:35:48,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 533 transitions, 1142 flow [2024-11-10 14:35:48,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 533 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:48,019 INFO L231 Difference]: Finished difference. Result has 519 places, 528 transitions, 1095 flow [2024-11-10 14:35:48,019 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1067, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1095, PETRI_PLACES=519, PETRI_TRANSITIONS=528} [2024-11-10 14:35:48,020 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -61 predicate places. [2024-11-10 14:35:48,020 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 528 transitions, 1095 flow [2024-11-10 14:35:48,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:48,022 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:48,022 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] [2024-11-10 14:35:48,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:35:48,023 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:48,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:48,023 INFO L85 PathProgramCache]: Analyzing trace with hash 358980057, now seen corresponding path program 1 times [2024-11-10 14:35:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:48,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085691016] [2024-11-10 14:35:48,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:48,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:48,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:48,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:48,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085691016] [2024-11-10 14:35:48,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085691016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:48,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:48,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:35:48,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279516635] [2024-11-10 14:35:48,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:48,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:48,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:48,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:48,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:48,100 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 628 [2024-11-10 14:35:48,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 528 transitions, 1095 flow. Second operand has 3 states, 3 states have (on average 600.0) internal successors, (1800), 3 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:48,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:48,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 628 [2024-11-10 14:35:48,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:48,303 INFO L124 PetriNetUnfolderBase]: 72/1061 cut-off events. [2024-11-10 14:35:48,303 INFO L125 PetriNetUnfolderBase]: For 22/82 co-relation queries the response was YES. [2024-11-10 14:35:48,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 1061 events. 72/1061 cut-off events. For 22/82 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4944 event pairs, 18 based on Foata normal form. 2/957 useless extension candidates. Maximal degree in co-relation 1136. Up to 57 conditions per place. [2024-11-10 14:35:48,319 INFO L140 encePairwiseOnDemand]: 624/628 looper letters, 14 selfloop transitions, 3 changer transitions 0/531 dead transitions. [2024-11-10 14:35:48,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 531 transitions, 1137 flow [2024-11-10 14:35:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:48,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1812 transitions. [2024-11-10 14:35:48,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9617834394904459 [2024-11-10 14:35:48,325 INFO L175 Difference]: Start difference. First operand has 519 places, 528 transitions, 1095 flow. Second operand 3 states and 1812 transitions. [2024-11-10 14:35:48,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 531 transitions, 1137 flow [2024-11-10 14:35:48,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 531 transitions, 1137 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:35:48,335 INFO L231 Difference]: Finished difference. Result has 523 places, 529 transitions, 1113 flow [2024-11-10 14:35:48,337 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1095, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1113, PETRI_PLACES=523, PETRI_TRANSITIONS=529} [2024-11-10 14:35:48,337 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -57 predicate places. [2024-11-10 14:35:48,338 INFO L471 AbstractCegarLoop]: Abstraction has has 523 places, 529 transitions, 1113 flow [2024-11-10 14:35:48,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 600.0) internal successors, (1800), 3 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:48,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:48,340 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] [2024-11-10 14:35:48,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:35:48,340 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:48,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:48,341 INFO L85 PathProgramCache]: Analyzing trace with hash -946056074, now seen corresponding path program 1 times [2024-11-10 14:35:48,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:48,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271653310] [2024-11-10 14:35:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:48,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:48,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271653310] [2024-11-10 14:35:48,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271653310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:48,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:48,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:35:48,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226136739] [2024-11-10 14:35:48,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:48,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:48,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:48,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:48,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:48,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 628 [2024-11-10 14:35:48,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 529 transitions, 1113 flow. Second operand has 3 states, 3 states have (on average 594.6666666666666) internal successors, (1784), 3 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:48,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:48,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 628 [2024-11-10 14:35:48,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:48,765 INFO L124 PetriNetUnfolderBase]: 107/1693 cut-off events. [2024-11-10 14:35:48,765 INFO L125 PetriNetUnfolderBase]: For 21/29 co-relation queries the response was YES. [2024-11-10 14:35:48,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1923 conditions, 1693 events. 107/1693 cut-off events. For 21/29 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 9730 event pairs, 8 based on Foata normal form. 1/1551 useless extension candidates. Maximal degree in co-relation 1871. Up to 76 conditions per place. [2024-11-10 14:35:48,791 INFO L140 encePairwiseOnDemand]: 620/628 looper letters, 20 selfloop transitions, 4 changer transitions 0/534 dead transitions. [2024-11-10 14:35:48,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 534 transitions, 1176 flow [2024-11-10 14:35:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:48,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1807 transitions. [2024-11-10 14:35:48,796 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9591295116772823 [2024-11-10 14:35:48,796 INFO L175 Difference]: Start difference. First operand has 523 places, 529 transitions, 1113 flow. Second operand 3 states and 1807 transitions. [2024-11-10 14:35:48,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 534 transitions, 1176 flow [2024-11-10 14:35:48,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 534 transitions, 1170 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:48,808 INFO L231 Difference]: Finished difference. Result has 520 places, 529 transitions, 1127 flow [2024-11-10 14:35:48,809 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1099, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1127, PETRI_PLACES=520, PETRI_TRANSITIONS=529} [2024-11-10 14:35:48,810 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -60 predicate places. [2024-11-10 14:35:48,810 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 529 transitions, 1127 flow [2024-11-10 14:35:48,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.6666666666666) internal successors, (1784), 3 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:48,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:48,815 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, 1] [2024-11-10 14:35:48,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:35:48,815 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:48,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:48,816 INFO L85 PathProgramCache]: Analyzing trace with hash -437557714, now seen corresponding path program 1 times [2024-11-10 14:35:48,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:48,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398013417] [2024-11-10 14:35:48,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:48,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:49,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:49,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:49,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398013417] [2024-11-10 14:35:49,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398013417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:49,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:49,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:35:49,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188509439] [2024-11-10 14:35:49,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:49,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:35:49,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:49,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:35:49,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:35:49,775 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 628 [2024-11-10 14:35:49,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 529 transitions, 1127 flow. Second operand has 8 states, 8 states have (on average 571.125) internal successors, (4569), 8 states have internal predecessors, (4569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:49,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:49,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 628 [2024-11-10 14:35:49,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:50,241 INFO L124 PetriNetUnfolderBase]: 161/2342 cut-off events. [2024-11-10 14:35:50,241 INFO L125 PetriNetUnfolderBase]: For 14/58 co-relation queries the response was YES. [2024-11-10 14:35:50,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2857 conditions, 2342 events. 161/2342 cut-off events. For 14/58 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 14564 event pairs, 14 based on Foata normal form. 7/2186 useless extension candidates. Maximal degree in co-relation 2802. Up to 115 conditions per place. [2024-11-10 14:35:50,267 INFO L140 encePairwiseOnDemand]: 611/628 looper letters, 79 selfloop transitions, 19 changer transitions 0/581 dead transitions. [2024-11-10 14:35:50,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 531 places, 581 transitions, 1458 flow [2024-11-10 14:35:50,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:35:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 14:35:50,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6902 transitions. [2024-11-10 14:35:50,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9158704883227177 [2024-11-10 14:35:50,322 INFO L175 Difference]: Start difference. First operand has 520 places, 529 transitions, 1127 flow. Second operand 12 states and 6902 transitions. [2024-11-10 14:35:50,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 531 places, 581 transitions, 1458 flow [2024-11-10 14:35:50,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 581 transitions, 1458 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:35:50,331 INFO L231 Difference]: Finished difference. Result has 536 places, 540 transitions, 1234 flow [2024-11-10 14:35:50,332 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1127, PETRI_DIFFERENCE_MINUEND_PLACES=520, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1234, PETRI_PLACES=536, PETRI_TRANSITIONS=540} [2024-11-10 14:35:50,334 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -44 predicate places. [2024-11-10 14:35:50,334 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 540 transitions, 1234 flow [2024-11-10 14:35:50,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 571.125) internal successors, (4569), 8 states have internal predecessors, (4569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:50,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:50,335 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:50,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:35:50,336 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:50,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:50,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1333759526, now seen corresponding path program 1 times [2024-11-10 14:35:50,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:50,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712858318] [2024-11-10 14:35:50,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:50,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:50,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:50,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:50,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712858318] [2024-11-10 14:35:50,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712858318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:50,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:50,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:35:50,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528289736] [2024-11-10 14:35:50,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:50,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:35:50,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:50,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:35:50,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:35:51,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 628 [2024-11-10 14:35:51,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 540 transitions, 1234 flow. Second operand has 8 states, 8 states have (on average 571.25) internal successors, (4570), 8 states have internal predecessors, (4570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:51,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:51,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 628 [2024-11-10 14:35:51,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:52,256 INFO L124 PetriNetUnfolderBase]: 426/5790 cut-off events. [2024-11-10 14:35:52,256 INFO L125 PetriNetUnfolderBase]: For 223/351 co-relation queries the response was YES. [2024-11-10 14:35:52,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7022 conditions, 5790 events. 426/5790 cut-off events. For 223/351 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 52714 event pairs, 62 based on Foata normal form. 12/5299 useless extension candidates. Maximal degree in co-relation 6956. Up to 201 conditions per place. [2024-11-10 14:35:52,312 INFO L140 encePairwiseOnDemand]: 611/628 looper letters, 74 selfloop transitions, 19 changer transitions 0/582 dead transitions. [2024-11-10 14:35:52,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 582 transitions, 1534 flow [2024-11-10 14:35:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:35:52,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 14:35:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6892 transitions. [2024-11-10 14:35:52,327 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9145435244161358 [2024-11-10 14:35:52,327 INFO L175 Difference]: Start difference. First operand has 536 places, 540 transitions, 1234 flow. Second operand 12 states and 6892 transitions. [2024-11-10 14:35:52,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 582 transitions, 1534 flow [2024-11-10 14:35:52,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 547 places, 582 transitions, 1534 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:35:52,337 INFO L231 Difference]: Finished difference. Result has 552 places, 551 transitions, 1341 flow [2024-11-10 14:35:52,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1234, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1341, PETRI_PLACES=552, PETRI_TRANSITIONS=551} [2024-11-10 14:35:52,338 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -28 predicate places. [2024-11-10 14:35:52,338 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 551 transitions, 1341 flow [2024-11-10 14:35:52,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 571.25) internal successors, (4570), 8 states have internal predecessors, (4570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:52,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:52,340 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:52,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:35:52,340 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:52,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:52,341 INFO L85 PathProgramCache]: Analyzing trace with hash 2134225804, now seen corresponding path program 1 times [2024-11-10 14:35:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:52,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898247629] [2024-11-10 14:35:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:52,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:52,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:52,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898247629] [2024-11-10 14:35:52,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898247629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:52,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:52,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:35:52,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110325070] [2024-11-10 14:35:52,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:52,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:35:52,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:52,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:35:52,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:35:52,414 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 598 out of 628 [2024-11-10 14:35:52,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 551 transitions, 1341 flow. Second operand has 3 states, 3 states have (on average 600.3333333333334) internal successors, (1801), 3 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:52,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:52,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 598 of 628 [2024-11-10 14:35:52,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:53,294 INFO L124 PetriNetUnfolderBase]: 618/5410 cut-off events. [2024-11-10 14:35:53,294 INFO L125 PetriNetUnfolderBase]: For 456/588 co-relation queries the response was YES. [2024-11-10 14:35:53,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6786 conditions, 5410 events. 618/5410 cut-off events. For 456/588 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 48408 event pairs, 209 based on Foata normal form. 0/4826 useless extension candidates. Maximal degree in co-relation 6712. Up to 631 conditions per place. [2024-11-10 14:35:53,373 INFO L140 encePairwiseOnDemand]: 624/628 looper letters, 14 selfloop transitions, 3 changer transitions 0/554 dead transitions. [2024-11-10 14:35:53,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 554 places, 554 transitions, 1383 flow [2024-11-10 14:35:53,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:35:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:35:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1812 transitions. [2024-11-10 14:35:53,377 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9617834394904459 [2024-11-10 14:35:53,377 INFO L175 Difference]: Start difference. First operand has 552 places, 551 transitions, 1341 flow. Second operand 3 states and 1812 transitions. [2024-11-10 14:35:53,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 554 places, 554 transitions, 1383 flow [2024-11-10 14:35:53,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 554 transitions, 1383 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:35:53,388 INFO L231 Difference]: Finished difference. Result has 556 places, 552 transitions, 1359 flow [2024-11-10 14:35:53,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=551, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1359, PETRI_PLACES=556, PETRI_TRANSITIONS=552} [2024-11-10 14:35:53,389 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -24 predicate places. [2024-11-10 14:35:53,389 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 552 transitions, 1359 flow [2024-11-10 14:35:53,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 600.3333333333334) internal successors, (1801), 3 states have internal predecessors, (1801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:53,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:53,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:53,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:35:53,391 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:53,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:53,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1467597970, now seen corresponding path program 1 times [2024-11-10 14:35:53,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:53,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853591852] [2024-11-10 14:35:53,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:53,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:35:53,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:53,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853591852] [2024-11-10 14:35:53,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853591852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:53,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:53,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:35:53,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175742293] [2024-11-10 14:35:53,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:53,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:35:53,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:53,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:35:53,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:35:54,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 628 [2024-11-10 14:35:54,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 552 transitions, 1359 flow. Second operand has 8 states, 8 states have (on average 571.375) internal successors, (4571), 8 states have internal predecessors, (4571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:54,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:54,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 628 [2024-11-10 14:35:54,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:55,412 INFO L124 PetriNetUnfolderBase]: 663/7310 cut-off events. [2024-11-10 14:35:55,412 INFO L125 PetriNetUnfolderBase]: For 646/754 co-relation queries the response was YES. [2024-11-10 14:35:55,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9278 conditions, 7310 events. 663/7310 cut-off events. For 646/754 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 72707 event pairs, 135 based on Foata normal form. 9/6627 useless extension candidates. Maximal degree in co-relation 9199. Up to 372 conditions per place. [2024-11-10 14:35:55,483 INFO L140 encePairwiseOnDemand]: 611/628 looper letters, 86 selfloop transitions, 22 changer transitions 0/604 dead transitions. [2024-11-10 14:35:55,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 604 transitions, 1754 flow [2024-11-10 14:35:55,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 14:35:55,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 14:35:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7470 transitions. [2024-11-10 14:35:55,495 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9149926506614404 [2024-11-10 14:35:55,496 INFO L175 Difference]: Start difference. First operand has 556 places, 552 transitions, 1359 flow. Second operand 13 states and 7470 transitions. [2024-11-10 14:35:55,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 604 transitions, 1754 flow [2024-11-10 14:35:55,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 604 transitions, 1738 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:35:55,512 INFO L231 Difference]: Finished difference. Result has 569 places, 559 transitions, 1445 flow [2024-11-10 14:35:55,513 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1353, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=534, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1445, PETRI_PLACES=569, PETRI_TRANSITIONS=559} [2024-11-10 14:35:55,514 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -11 predicate places. [2024-11-10 14:35:55,514 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 559 transitions, 1445 flow [2024-11-10 14:35:55,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 571.375) internal successors, (4571), 8 states have internal predecessors, (4571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:55,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:55,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:55,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 14:35:55,516 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:55,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:55,516 INFO L85 PathProgramCache]: Analyzing trace with hash -129595567, now seen corresponding path program 1 times [2024-11-10 14:35:55,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:55,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105158295] [2024-11-10 14:35:55,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:55,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:55,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:55,752 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-10 14:35:55,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:55,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105158295] [2024-11-10 14:35:55,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105158295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:55,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:55,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:35:55,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837981579] [2024-11-10 14:35:55,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:55,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:35:55,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:55,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:35:55,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:35:56,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 628 [2024-11-10 14:35:56,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 559 transitions, 1445 flow. Second operand has 8 states, 8 states have (on average 571.25) internal successors, (4570), 8 states have internal predecessors, (4570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:56,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:56,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 628 [2024-11-10 14:35:56,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:57,321 INFO L124 PetriNetUnfolderBase]: 284/5307 cut-off events. [2024-11-10 14:35:57,321 INFO L125 PetriNetUnfolderBase]: For 254/383 co-relation queries the response was YES. [2024-11-10 14:35:57,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6607 conditions, 5307 events. 284/5307 cut-off events. For 254/383 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 42417 event pairs, 37 based on Foata normal form. 13/4958 useless extension candidates. Maximal degree in co-relation 6520. Up to 193 conditions per place. [2024-11-10 14:35:57,374 INFO L140 encePairwiseOnDemand]: 611/628 looper letters, 79 selfloop transitions, 24 changer transitions 0/600 dead transitions. [2024-11-10 14:35:57,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 600 transitions, 1795 flow [2024-11-10 14:35:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:35:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 14:35:57,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6895 transitions. [2024-11-10 14:35:57,385 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9149416135881104 [2024-11-10 14:35:57,386 INFO L175 Difference]: Start difference. First operand has 569 places, 559 transitions, 1445 flow. Second operand 12 states and 6895 transitions. [2024-11-10 14:35:57,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 600 transitions, 1795 flow [2024-11-10 14:35:57,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 600 transitions, 1778 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:35:57,399 INFO L231 Difference]: Finished difference. Result has 577 places, 566 transitions, 1551 flow [2024-11-10 14:35:57,399 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1551, PETRI_PLACES=577, PETRI_TRANSITIONS=566} [2024-11-10 14:35:57,400 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -3 predicate places. [2024-11-10 14:35:57,400 INFO L471 AbstractCegarLoop]: Abstraction has has 577 places, 566 transitions, 1551 flow [2024-11-10 14:35:57,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 571.25) internal successors, (4570), 8 states have internal predecessors, (4570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:57,401 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:57,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:57,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 14:35:57,402 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:57,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:57,403 INFO L85 PathProgramCache]: Analyzing trace with hash 645624663, now seen corresponding path program 1 times [2024-11-10 14:35:57,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:57,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725121224] [2024-11-10 14:35:57,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:57,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:57,600 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-10 14:35:57,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:57,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725121224] [2024-11-10 14:35:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725121224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:57,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:57,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:35:57,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912131052] [2024-11-10 14:35:57,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:57,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:35:57,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:57,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:35:57,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:35:58,017 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 628 [2024-11-10 14:35:58,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 566 transitions, 1551 flow. Second operand has 8 states, 8 states have (on average 571.375) internal successors, (4571), 8 states have internal predecessors, (4571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:58,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:35:58,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 628 [2024-11-10 14:35:58,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:35:59,571 INFO L124 PetriNetUnfolderBase]: 619/9258 cut-off events. [2024-11-10 14:35:59,572 INFO L125 PetriNetUnfolderBase]: For 856/1022 co-relation queries the response was YES. [2024-11-10 14:35:59,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11828 conditions, 9258 events. 619/9258 cut-off events. For 856/1022 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 92249 event pairs, 119 based on Foata normal form. 22/8549 useless extension candidates. Maximal degree in co-relation 11732. Up to 264 conditions per place. [2024-11-10 14:35:59,667 INFO L140 encePairwiseOnDemand]: 611/628 looper letters, 73 selfloop transitions, 27 changer transitions 0/604 dead transitions. [2024-11-10 14:35:59,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 604 transitions, 1890 flow [2024-11-10 14:35:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 14:35:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 14:35:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 7455 transitions. [2024-11-10 14:35:59,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9131553160215581 [2024-11-10 14:35:59,675 INFO L175 Difference]: Start difference. First operand has 577 places, 566 transitions, 1551 flow. Second operand 13 states and 7455 transitions. [2024-11-10 14:35:59,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 604 transitions, 1890 flow [2024-11-10 14:35:59,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 604 transitions, 1873 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:35:59,689 INFO L231 Difference]: Finished difference. Result has 588 places, 578 transitions, 1682 flow [2024-11-10 14:35:59,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1534, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1682, PETRI_PLACES=588, PETRI_TRANSITIONS=578} [2024-11-10 14:35:59,690 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, 8 predicate places. [2024-11-10 14:35:59,691 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 578 transitions, 1682 flow [2024-11-10 14:35:59,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 571.375) internal successors, (4571), 8 states have internal predecessors, (4571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:35:59,692 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:35:59,692 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:35:59,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 14:35:59,692 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:35:59,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:35:59,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1977499631, now seen corresponding path program 1 times [2024-11-10 14:35:59,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:35:59,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502556789] [2024-11-10 14:35:59,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:35:59,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:35:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:35:59,892 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-10 14:35:59,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:35:59,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502556789] [2024-11-10 14:35:59,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502556789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:35:59,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:35:59,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:35:59,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638611179] [2024-11-10 14:35:59,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:35:59,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:35:59,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:35:59,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:35:59,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:36:00,379 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 567 out of 628 [2024-11-10 14:36:00,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 578 transitions, 1682 flow. Second operand has 8 states, 8 states have (on average 571.5) internal successors, (4572), 8 states have internal predecessors, (4572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:00,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:00,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 567 of 628 [2024-11-10 14:36:00,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:01,588 INFO L124 PetriNetUnfolderBase]: 659/8227 cut-off events. [2024-11-10 14:36:01,588 INFO L125 PetriNetUnfolderBase]: For 1144/1250 co-relation queries the response was YES. [2024-11-10 14:36:01,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10843 conditions, 8227 events. 659/8227 cut-off events. For 1144/1250 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 82586 event pairs, 147 based on Foata normal form. 11/7540 useless extension candidates. Maximal degree in co-relation 10736. Up to 389 conditions per place. [2024-11-10 14:36:01,674 INFO L140 encePairwiseOnDemand]: 611/628 looper letters, 73 selfloop transitions, 24 changer transitions 0/607 dead transitions. [2024-11-10 14:36:01,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 607 transitions, 1990 flow [2024-11-10 14:36:01,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:36:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 14:36:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 6884 transitions. [2024-11-10 14:36:01,678 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9134819532908705 [2024-11-10 14:36:01,678 INFO L175 Difference]: Start difference. First operand has 588 places, 578 transitions, 1682 flow. Second operand 12 states and 6884 transitions. [2024-11-10 14:36:01,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 607 transitions, 1990 flow [2024-11-10 14:36:01,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 607 transitions, 1986 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:01,694 INFO L231 Difference]: Finished difference. Result has 601 places, 584 transitions, 1793 flow [2024-11-10 14:36:01,695 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1678, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1793, PETRI_PLACES=601, PETRI_TRANSITIONS=584} [2024-11-10 14:36:01,697 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, 21 predicate places. [2024-11-10 14:36:01,698 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 584 transitions, 1793 flow [2024-11-10 14:36:01,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 571.5) internal successors, (4572), 8 states have internal predecessors, (4572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:01,699 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:01,699 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] [2024-11-10 14:36:01,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 14:36:01,700 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:36:01,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:01,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1746729842, now seen corresponding path program 1 times [2024-11-10 14:36:01,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:01,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462743794] [2024-11-10 14:36:01,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:02,265 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-10 14:36:02,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:02,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462743794] [2024-11-10 14:36:02,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462743794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:02,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:02,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:36:02,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752598238] [2024-11-10 14:36:02,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:02,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:36:02,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:02,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:36:02,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:36:02,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 578 out of 628 [2024-11-10 14:36:02,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 584 transitions, 1793 flow. Second operand has 6 states, 6 states have (on average 580.8333333333334) internal successors, (3485), 6 states have internal predecessors, (3485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:02,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:02,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 578 of 628 [2024-11-10 14:36:02,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:04,112 INFO L124 PetriNetUnfolderBase]: 307/8451 cut-off events. [2024-11-10 14:36:04,112 INFO L125 PetriNetUnfolderBase]: For 669/742 co-relation queries the response was YES. [2024-11-10 14:36:04,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10335 conditions, 8451 events. 307/8451 cut-off events. For 669/742 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 76397 event pairs, 16 based on Foata normal form. 20/7903 useless extension candidates. Maximal degree in co-relation 10221. Up to 177 conditions per place. [2024-11-10 14:36:04,221 INFO L140 encePairwiseOnDemand]: 617/628 looper letters, 38 selfloop transitions, 10 changer transitions 0/597 dead transitions. [2024-11-10 14:36:04,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 597 transitions, 1926 flow [2024-11-10 14:36:04,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:36:04,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:36:04,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3517 transitions. [2024-11-10 14:36:04,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9333864118895966 [2024-11-10 14:36:04,224 INFO L175 Difference]: Start difference. First operand has 601 places, 584 transitions, 1793 flow. Second operand 6 states and 3517 transitions. [2024-11-10 14:36:04,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 597 transitions, 1926 flow [2024-11-10 14:36:04,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 597 transitions, 1907 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-10 14:36:04,235 INFO L231 Difference]: Finished difference. Result has 601 places, 586 transitions, 1822 flow [2024-11-10 14:36:04,235 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1822, PETRI_PLACES=601, PETRI_TRANSITIONS=586} [2024-11-10 14:36:04,235 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, 21 predicate places. [2024-11-10 14:36:04,235 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 586 transitions, 1822 flow [2024-11-10 14:36:04,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 580.8333333333334) internal successors, (3485), 6 states have internal predecessors, (3485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:04,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:04,237 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] [2024-11-10 14:36:04,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 14:36:04,237 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:36:04,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1022903867, now seen corresponding path program 1 times [2024-11-10 14:36:04,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:04,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923879550] [2024-11-10 14:36:04,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:04,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:04,763 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-10 14:36:04,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:04,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923879550] [2024-11-10 14:36:04,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923879550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:04,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:04,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:36:04,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161787299] [2024-11-10 14:36:04,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:04,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:36:04,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:04,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:36:04,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:36:05,297 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 578 out of 628 [2024-11-10 14:36:05,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 586 transitions, 1822 flow. Second operand has 6 states, 6 states have (on average 581.0) internal successors, (3486), 6 states have internal predecessors, (3486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:05,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:05,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 578 of 628 [2024-11-10 14:36:05,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:06,993 INFO L124 PetriNetUnfolderBase]: 407/10854 cut-off events. [2024-11-10 14:36:06,993 INFO L125 PetriNetUnfolderBase]: For 730/965 co-relation queries the response was YES. [2024-11-10 14:36:07,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13258 conditions, 10854 events. 407/10854 cut-off events. For 730/965 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 107108 event pairs, 18 based on Foata normal form. 35/10195 useless extension candidates. Maximal degree in co-relation 13141. Up to 294 conditions per place. [2024-11-10 14:36:07,078 INFO L140 encePairwiseOnDemand]: 617/628 looper letters, 37 selfloop transitions, 10 changer transitions 0/598 dead transitions. [2024-11-10 14:36:07,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 598 transitions, 1950 flow [2024-11-10 14:36:07,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:36:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:36:07,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3516 transitions. [2024-11-10 14:36:07,080 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9331210191082803 [2024-11-10 14:36:07,081 INFO L175 Difference]: Start difference. First operand has 601 places, 586 transitions, 1822 flow. Second operand 6 states and 3516 transitions. [2024-11-10 14:36:07,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 598 transitions, 1950 flow [2024-11-10 14:36:07,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 598 transitions, 1946 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:07,094 INFO L231 Difference]: Finished difference. Result has 607 places, 588 transitions, 1866 flow [2024-11-10 14:36:07,095 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1814, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=574, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1866, PETRI_PLACES=607, PETRI_TRANSITIONS=588} [2024-11-10 14:36:07,095 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, 27 predicate places. [2024-11-10 14:36:07,095 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 588 transitions, 1866 flow [2024-11-10 14:36:07,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 581.0) internal successors, (3486), 6 states have internal predecessors, (3486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:07,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:07,096 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] [2024-11-10 14:36:07,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 14:36:07,096 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:36:07,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:07,096 INFO L85 PathProgramCache]: Analyzing trace with hash -536852100, now seen corresponding path program 1 times [2024-11-10 14:36:07,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:07,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310712919] [2024-11-10 14:36:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:07,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:07,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:07,156 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-10 14:36:07,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:07,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310712919] [2024-11-10 14:36:07,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310712919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:07,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:07,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:07,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559087616] [2024-11-10 14:36:07,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:07,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:07,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:07,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:07,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:07,177 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 628 [2024-11-10 14:36:07,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 588 transitions, 1866 flow. Second operand has 3 states, 3 states have (on average 594.6666666666666) internal successors, (1784), 3 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:07,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:07,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 628 [2024-11-10 14:36:07,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:10,315 INFO L124 PetriNetUnfolderBase]: 863/16344 cut-off events. [2024-11-10 14:36:10,315 INFO L125 PetriNetUnfolderBase]: For 1349/1370 co-relation queries the response was YES. [2024-11-10 14:36:10,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20850 conditions, 16344 events. 863/16344 cut-off events. For 1349/1370 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 183181 event pairs, 169 based on Foata normal form. 0/15359 useless extension candidates. Maximal degree in co-relation 20731. Up to 946 conditions per place. [2024-11-10 14:36:10,675 INFO L140 encePairwiseOnDemand]: 620/628 looper letters, 19 selfloop transitions, 4 changer transitions 0/592 dead transitions. [2024-11-10 14:36:10,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 592 transitions, 1924 flow [2024-11-10 14:36:10,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2024-11-10 14:36:10,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9585987261146497 [2024-11-10 14:36:10,677 INFO L175 Difference]: Start difference. First operand has 607 places, 588 transitions, 1866 flow. Second operand 3 states and 1806 transitions. [2024-11-10 14:36:10,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 592 transitions, 1924 flow [2024-11-10 14:36:10,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 592 transitions, 1920 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:10,696 INFO L231 Difference]: Finished difference. Result has 605 places, 588 transitions, 1882 flow [2024-11-10 14:36:10,697 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1854, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1882, PETRI_PLACES=605, PETRI_TRANSITIONS=588} [2024-11-10 14:36:10,697 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, 25 predicate places. [2024-11-10 14:36:10,697 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 588 transitions, 1882 flow [2024-11-10 14:36:10,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.6666666666666) internal successors, (1784), 3 states have internal predecessors, (1784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:10,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:10,698 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, 1] [2024-11-10 14:36:10,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 14:36:10,698 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:36:10,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:10,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1064595437, now seen corresponding path program 1 times [2024-11-10 14:36:10,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:10,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196440823] [2024-11-10 14:36:10,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:10,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:11,321 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-10 14:36:11,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:11,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196440823] [2024-11-10 14:36:11,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196440823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:11,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:11,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:36:11,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450010561] [2024-11-10 14:36:11,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:11,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:36:11,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:11,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:36:11,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:36:11,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 578 out of 628 [2024-11-10 14:36:11,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 588 transitions, 1882 flow. Second operand has 6 states, 6 states have (on average 580.8333333333334) internal successors, (3485), 6 states have internal predecessors, (3485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:11,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:11,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 578 of 628 [2024-11-10 14:36:11,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:13,735 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1461] thread3EXIT-->L99-40: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][560], [Black: 767#(and (<= ~Bn~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 750#(= ~i_AB~0 0), Black: 754#(and (<= ~Bn~0 0) (= ~i_AB~0 0)), Black: 649#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 655#true, Black: 661#(not |thread2Thread1of1ForFork2_#t~short6|), 668#true, Black: 790#(and (not |thread2Thread1of1ForFork2_#t~short6|) (<= ~Cn~0 0) (= ~i_BC~0 0)), 800#(= ~i_AC~0 0), Black: 784#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 773#(= ~i_BC~0 0), Black: 664#true, Black: 782#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 777#(and (<= ~Cn~0 0) (= ~i_BC~0 0)), Black: 679#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), 657#(= |#race~A~0| 0), Black: 681#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), Black: 674#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 817#(and (not |thread3Thread1of1ForFork1_#t~short11|) (= ~i_AC~0 0) (<= ~Cn~0 0)), Black: 804#(and (= ~i_AC~0 0) (<= ~Cn~0 0)), Black: 687#(and (<= ~An~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 670#(= ~i_AB~0 0), 637#(= |#race~Cn~0| 0), 771#true, Black: 823#(= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0), Black: 824#(and (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0)), Black: 821#true, Black: 825#(and (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) 2 ~A~0.offset)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset 1)) 0) (= (select (select |#race| ~A~0.base) (+ (* ~i_AB~0 4) ~A~0.offset)) 0)), 725#(= ~i_AC~0 0), 843#(= |#race~C~0| 0), Black: 835#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset 1)) 0)), Black: 834#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset 1)) 0)), Black: 833#(= (select (select |#race| ~B~0.base) (+ (* ~i_BC~0 4) ~B~0.offset)) 0), Black: 699#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 695#(= ~i_BC~0 0), 619#(= |#race~An~0| 0), 290#L99-40true, Black: 712#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork2_#t~short6|) (= ~i_BC~0 0)), Black: 704#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 841#true, Black: 706#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 720#(not |thread3Thread1of1ForFork1_#t~short11|), 748#true, 850#(and (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) 2 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) 3 ~B~0.offset)) 0) (= (select (select |#race| ~B~0.base) (+ (* ~i_AB~0 4) ~B~0.offset 1)) 0)), 831#true, Black: 729#(and (= ~i_AC~0 0) (<= ~An~0 0)), Black: 742#(and (not |thread3Thread1of1ForFork1_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), 631#(= |#race~Bn~0| 0), 666#(= |#race~B~0| 0)]) [2024-11-10 14:36:13,735 INFO L294 olderBase$Statistics]: this new event has 442 ancestors and is cut-off event [2024-11-10 14:36:13,735 INFO L297 olderBase$Statistics]: existing Event has 369 ancestors and is cut-off event [2024-11-10 14:36:13,735 INFO L297 olderBase$Statistics]: existing Event has 397 ancestors and is cut-off event [2024-11-10 14:36:13,735 INFO L297 olderBase$Statistics]: existing Event has 397 ancestors and is cut-off event [2024-11-10 14:36:13,824 INFO L124 PetriNetUnfolderBase]: 446/11925 cut-off events. [2024-11-10 14:36:13,824 INFO L125 PetriNetUnfolderBase]: For 866/1043 co-relation queries the response was YES. [2024-11-10 14:36:13,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15300 conditions, 11925 events. 446/11925 cut-off events. For 866/1043 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 119870 event pairs, 25 based on Foata normal form. 64/11432 useless extension candidates. Maximal degree in co-relation 15178. Up to 273 conditions per place. [2024-11-10 14:36:13,911 INFO L140 encePairwiseOnDemand]: 617/628 looper letters, 38 selfloop transitions, 10 changer transitions 0/601 dead transitions. [2024-11-10 14:36:13,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 601 transitions, 2015 flow [2024-11-10 14:36:13,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:36:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:36:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3517 transitions. [2024-11-10 14:36:13,913 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9333864118895966 [2024-11-10 14:36:13,913 INFO L175 Difference]: Start difference. First operand has 605 places, 588 transitions, 1882 flow. Second operand 6 states and 3517 transitions. [2024-11-10 14:36:13,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 601 transitions, 2015 flow [2024-11-10 14:36:13,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 601 transitions, 2015 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:36:13,931 INFO L231 Difference]: Finished difference. Result has 612 places, 590 transitions, 1930 flow [2024-11-10 14:36:13,931 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1878, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1930, PETRI_PLACES=612, PETRI_TRANSITIONS=590} [2024-11-10 14:36:13,932 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, 32 predicate places. [2024-11-10 14:36:13,932 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 590 transitions, 1930 flow [2024-11-10 14:36:13,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 580.8333333333334) internal successors, (3485), 6 states have internal predecessors, (3485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:13,933 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:13,933 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, 1, 1, 1] [2024-11-10 14:36:13,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 14:36:13,933 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:36:13,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:13,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1320897525, now seen corresponding path program 1 times [2024-11-10 14:36:13,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:13,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125059649] [2024-11-10 14:36:13,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:13,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:14,599 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-10 14:36:14,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:14,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125059649] [2024-11-10 14:36:14,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125059649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:14,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:14,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:36:14,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856336277] [2024-11-10 14:36:14,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:14,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:36:14,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:14,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:36:14,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:36:15,182 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 578 out of 628 [2024-11-10 14:36:15,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 590 transitions, 1930 flow. Second operand has 6 states, 6 states have (on average 581.1666666666666) internal successors, (3487), 6 states have internal predecessors, (3487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:15,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:15,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 578 of 628 [2024-11-10 14:36:15,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:18,574 INFO L124 PetriNetUnfolderBase]: 936/17170 cut-off events. [2024-11-10 14:36:18,574 INFO L125 PetriNetUnfolderBase]: For 1495/1550 co-relation queries the response was YES. [2024-11-10 14:36:18,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22804 conditions, 17170 events. 936/17170 cut-off events. For 1495/1550 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 198165 event pairs, 75 based on Foata normal form. 4/16377 useless extension candidates. Maximal degree in co-relation 22678. Up to 660 conditions per place. [2024-11-10 14:36:18,859 INFO L140 encePairwiseOnDemand]: 617/628 looper letters, 36 selfloop transitions, 10 changer transitions 0/601 dead transitions. [2024-11-10 14:36:18,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 601 transitions, 2053 flow [2024-11-10 14:36:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:36:18,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:36:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3515 transitions. [2024-11-10 14:36:18,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.932855626326964 [2024-11-10 14:36:18,864 INFO L175 Difference]: Start difference. First operand has 612 places, 590 transitions, 1930 flow. Second operand 6 states and 3515 transitions. [2024-11-10 14:36:18,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 601 transitions, 2053 flow [2024-11-10 14:36:18,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 601 transitions, 2049 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:18,883 INFO L231 Difference]: Finished difference. Result has 618 places, 592 transitions, 1974 flow [2024-11-10 14:36:18,883 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1974, PETRI_PLACES=618, PETRI_TRANSITIONS=592} [2024-11-10 14:36:18,884 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, 38 predicate places. [2024-11-10 14:36:18,884 INFO L471 AbstractCegarLoop]: Abstraction has has 618 places, 592 transitions, 1974 flow [2024-11-10 14:36:18,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 581.1666666666666) internal successors, (3487), 6 states have internal predecessors, (3487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:18,885 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:18,885 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:18,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 14:36:18,885 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:36:18,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1161390240, now seen corresponding path program 1 times [2024-11-10 14:36:18,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:18,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366564527] [2024-11-10 14:36:18,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:18,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:19,561 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-10 14:36:19,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:19,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366564527] [2024-11-10 14:36:19,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366564527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:19,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:19,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:36:19,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992532993] [2024-11-10 14:36:19,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:19,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:36:19,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:19,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:36:19,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:36:20,039 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 578 out of 628 [2024-11-10 14:36:20,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 618 places, 592 transitions, 1974 flow. Second operand has 6 states, 6 states have (on average 581.0) internal successors, (3486), 6 states have internal predecessors, (3486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:20,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:20,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 578 of 628 [2024-11-10 14:36:20,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:23,232 INFO L124 PetriNetUnfolderBase]: 613/15286 cut-off events. [2024-11-10 14:36:23,233 INFO L125 PetriNetUnfolderBase]: For 1270/1651 co-relation queries the response was YES. [2024-11-10 14:36:23,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20850 conditions, 15286 events. 613/15286 cut-off events. For 1270/1651 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 164003 event pairs, 40 based on Foata normal form. 52/14798 useless extension candidates. Maximal degree in co-relation 20720. Up to 416 conditions per place. [2024-11-10 14:36:23,350 INFO L140 encePairwiseOnDemand]: 617/628 looper letters, 37 selfloop transitions, 10 changer transitions 0/604 dead transitions. [2024-11-10 14:36:23,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 604 transitions, 2102 flow [2024-11-10 14:36:23,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:36:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:36:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3516 transitions. [2024-11-10 14:36:23,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9331210191082803 [2024-11-10 14:36:23,354 INFO L175 Difference]: Start difference. First operand has 618 places, 592 transitions, 1974 flow. Second operand 6 states and 3516 transitions. [2024-11-10 14:36:23,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 604 transitions, 2102 flow [2024-11-10 14:36:23,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 604 transitions, 2098 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:23,384 INFO L231 Difference]: Finished difference. Result has 624 places, 594 transitions, 2018 flow [2024-11-10 14:36:23,385 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1966, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2018, PETRI_PLACES=624, PETRI_TRANSITIONS=594} [2024-11-10 14:36:23,386 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, 44 predicate places. [2024-11-10 14:36:23,386 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 594 transitions, 2018 flow [2024-11-10 14:36:23,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 581.0) internal successors, (3486), 6 states have internal predecessors, (3486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:23,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:23,387 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:23,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 14:36:23,387 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:36:23,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:23,388 INFO L85 PathProgramCache]: Analyzing trace with hash 588790779, now seen corresponding path program 1 times [2024-11-10 14:36:23,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:23,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950953007] [2024-11-10 14:36:23,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:23,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:23,454 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-10 14:36:23,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:23,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950953007] [2024-11-10 14:36:23,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950953007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:23,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:23,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:23,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717891326] [2024-11-10 14:36:23,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:23,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:23,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:23,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:23,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:23,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 628 [2024-11-10 14:36:23,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 594 transitions, 2018 flow. Second operand has 3 states, 3 states have (on average 595.0) internal successors, (1785), 3 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:23,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:23,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 628 [2024-11-10 14:36:23,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:26,518 INFO L124 PetriNetUnfolderBase]: 570/15101 cut-off events. [2024-11-10 14:36:26,519 INFO L125 PetriNetUnfolderBase]: For 1327/1740 co-relation queries the response was YES. [2024-11-10 14:36:26,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21329 conditions, 15101 events. 570/15101 cut-off events. For 1327/1740 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 158714 event pairs, 101 based on Foata normal form. 7/14615 useless extension candidates. Maximal degree in co-relation 21197. Up to 712 conditions per place. [2024-11-10 14:36:26,617 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 19 selfloop transitions, 2 changer transitions 0/595 dead transitions. [2024-11-10 14:36:26,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 595 transitions, 2064 flow [2024-11-10 14:36:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2024-11-10 14:36:26,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9543524416135881 [2024-11-10 14:36:26,619 INFO L175 Difference]: Start difference. First operand has 624 places, 594 transitions, 2018 flow. Second operand 3 states and 1798 transitions. [2024-11-10 14:36:26,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 595 transitions, 2064 flow [2024-11-10 14:36:26,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 624 places, 595 transitions, 2060 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:36:26,650 INFO L231 Difference]: Finished difference. Result has 624 places, 593 transitions, 2016 flow [2024-11-10 14:36:26,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=2012, PETRI_DIFFERENCE_MINUEND_PLACES=622, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2016, PETRI_PLACES=624, PETRI_TRANSITIONS=593} [2024-11-10 14:36:26,651 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, 44 predicate places. [2024-11-10 14:36:26,652 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 593 transitions, 2016 flow [2024-11-10 14:36:26,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 595.0) internal successors, (1785), 3 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:26,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:26,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:26,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 14:36:26,653 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:36:26,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:26,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1779992966, now seen corresponding path program 1 times [2024-11-10 14:36:26,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:26,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127185886] [2024-11-10 14:36:26,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:26,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:27,278 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-10 14:36:27,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:27,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127185886] [2024-11-10 14:36:27,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127185886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:27,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:27,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:36:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008894116] [2024-11-10 14:36:27,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:27,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:36:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:27,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:36:27,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:36:27,859 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 578 out of 628 [2024-11-10 14:36:27,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 593 transitions, 2016 flow. Second operand has 6 states, 6 states have (on average 581.1666666666666) internal successors, (3487), 6 states have internal predecessors, (3487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:27,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:27,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 578 of 628 [2024-11-10 14:36:27,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:31,333 INFO L124 PetriNetUnfolderBase]: 939/17065 cut-off events. [2024-11-10 14:36:31,333 INFO L125 PetriNetUnfolderBase]: For 1881/1939 co-relation queries the response was YES. [2024-11-10 14:36:31,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24211 conditions, 17065 events. 939/17065 cut-off events. For 1881/1939 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 195796 event pairs, 61 based on Foata normal form. 76/16487 useless extension candidates. Maximal degree in co-relation 24076. Up to 606 conditions per place. [2024-11-10 14:36:31,449 INFO L140 encePairwiseOnDemand]: 617/628 looper letters, 29 selfloop transitions, 6 changer transitions 173/604 dead transitions. [2024-11-10 14:36:31,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 627 places, 604 transitions, 2137 flow [2024-11-10 14:36:31,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:36:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:36:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3514 transitions. [2024-11-10 14:36:31,454 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9325902335456475 [2024-11-10 14:36:31,454 INFO L175 Difference]: Start difference. First operand has 624 places, 593 transitions, 2016 flow. Second operand 6 states and 3514 transitions. [2024-11-10 14:36:31,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 627 places, 604 transitions, 2137 flow [2024-11-10 14:36:31,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 625 places, 604 transitions, 2133 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:36:31,488 INFO L231 Difference]: Finished difference. Result has 625 places, 423 transitions, 1417 flow [2024-11-10 14:36:31,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=2008, PETRI_DIFFERENCE_MINUEND_PLACES=620, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1417, PETRI_PLACES=625, PETRI_TRANSITIONS=423} [2024-11-10 14:36:31,489 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, 45 predicate places. [2024-11-10 14:36:31,489 INFO L471 AbstractCegarLoop]: Abstraction has has 625 places, 423 transitions, 1417 flow [2024-11-10 14:36:31,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 581.1666666666666) internal successors, (3487), 6 states have internal predecessors, (3487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:31,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:31,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:31,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 14:36:31,491 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:36:31,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:31,491 INFO L85 PathProgramCache]: Analyzing trace with hash 347504872, now seen corresponding path program 1 times [2024-11-10 14:36:31,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:31,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889261936] [2024-11-10 14:36:31,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:31,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:31,564 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-10 14:36:31,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:31,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889261936] [2024-11-10 14:36:31,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889261936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:31,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:31,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392574079] [2024-11-10 14:36:31,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:31,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:31,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:31,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 628 [2024-11-10 14:36:31,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 625 places, 423 transitions, 1417 flow. Second operand has 3 states, 3 states have (on average 595.3333333333334) internal successors, (1786), 3 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:31,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:31,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 628 [2024-11-10 14:36:31,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:32,774 INFO L124 PetriNetUnfolderBase]: 407/4961 cut-off events. [2024-11-10 14:36:32,774 INFO L125 PetriNetUnfolderBase]: For 1420/1432 co-relation queries the response was YES. [2024-11-10 14:36:32,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8389 conditions, 4961 events. 407/4961 cut-off events. For 1420/1432 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 38491 event pairs, 208 based on Foata normal form. 0/4708 useless extension candidates. Maximal degree in co-relation 8256. Up to 520 conditions per place. [2024-11-10 14:36:32,851 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 14 selfloop transitions, 2 changer transitions 10/424 dead transitions. [2024-11-10 14:36:32,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 501 places, 424 transitions, 1453 flow [2024-11-10 14:36:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2024-11-10 14:36:32,853 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9516985138004246 [2024-11-10 14:36:32,853 INFO L175 Difference]: Start difference. First operand has 625 places, 423 transitions, 1417 flow. Second operand 3 states and 1793 transitions. [2024-11-10 14:36:32,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 501 places, 424 transitions, 1453 flow [2024-11-10 14:36:32,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 424 transitions, 1303 flow, removed 5 selfloop flow, removed 56 redundant places. [2024-11-10 14:36:32,870 INFO L231 Difference]: Finished difference. Result has 445 places, 412 transitions, 1197 flow [2024-11-10 14:36:32,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1265, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1197, PETRI_PLACES=445, PETRI_TRANSITIONS=412} [2024-11-10 14:36:32,871 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -135 predicate places. [2024-11-10 14:36:32,871 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 412 transitions, 1197 flow [2024-11-10 14:36:32,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 595.3333333333334) internal successors, (1786), 3 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:32,871 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:36:32,871 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:36:32,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 14:36:32,872 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 113 more)] === [2024-11-10 14:36:32,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:36:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash 440205666, now seen corresponding path program 1 times [2024-11-10 14:36:32,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:36:32,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408739280] [2024-11-10 14:36:32,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:36:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:36:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:36:32,922 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-10 14:36:32,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:36:32,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408739280] [2024-11-10 14:36:32,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408739280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:36:32,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:36:32,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:36:32,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180095918] [2024-11-10 14:36:32,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:36:32,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:36:32,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:36:32,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:36:32,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:36:32,955 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 628 [2024-11-10 14:36:32,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 412 transitions, 1197 flow. Second operand has 3 states, 3 states have (on average 595.6666666666666) internal successors, (1787), 3 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:32,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:36:32,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 628 [2024-11-10 14:36:32,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:36:33,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1462] thread2EXIT-->L97: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][271], [723#true, Black: 767#(and (<= ~Bn~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 754#(and (<= ~Bn~0 0) (= ~i_AB~0 0)), 843#(= |#race~C~0| 0), Black: 699#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 695#(= ~i_BC~0 0), 619#(= |#race~An~0| 0), Black: 649#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 712#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork2_#t~short6|) (= ~i_BC~0 0)), Black: 841#true, Black: 704#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 706#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 720#(not |thread3Thread1of1ForFork1_#t~short11|), Black: 655#true, Black: 661#(not |thread2Thread1of1ForFork2_#t~short6|), Black: 664#true, Black: 782#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 884#true, Black: 729#(and (= ~i_AC~0 0) (<= ~An~0 0)), 631#(= |#race~Bn~0| 0), Black: 742#(and (not |thread3Thread1of1ForFork1_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), Black: 725#(= ~i_AC~0 0), Black: 679#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), Black: 681#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), 657#(= |#race~A~0| 0), 666#(= |#race~B~0| 0), Black: 674#(and (<= ~An~0 0) (= ~i_AB~0 0)), 112#L71-21true, Black: 687#(and (<= ~An~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), 637#(= |#race~Cn~0| 0), 670#(= ~i_AB~0 0), 887#true, 528#L97true, 750#(= ~i_AB~0 0), 771#true]) [2024-11-10 14:36:33,584 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2024-11-10 14:36:33,584 INFO L297 olderBase$Statistics]: existing Event has 402 ancestors and is cut-off event [2024-11-10 14:36:33,584 INFO L297 olderBase$Statistics]: existing Event has 374 ancestors and is cut-off event [2024-11-10 14:36:33,584 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-11-10 14:36:33,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1425] L71-14-->L71-13: Formula: (= |v_#race~C~0_6| 0) InVars {} OutVars{#race~C~0=|v_#race~C~0_6|} AuxVars[] AssignedVars[#race~C~0][362], [723#true, Black: 767#(and (<= ~Bn~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 754#(and (<= ~Bn~0 0) (= ~i_AB~0 0)), 843#(= |#race~C~0| 0), Black: 699#(and (<= ~Bn~0 0) (= ~i_BC~0 0)), Black: 695#(= ~i_BC~0 0), 619#(= |#race~An~0| 0), Black: 649#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 712#(and (<= ~Bn~0 0) (not |thread2Thread1of1ForFork2_#t~short6|) (= ~i_BC~0 0)), Black: 841#true, Black: 704#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 706#(and (<= ~Bn~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Bn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), Black: 655#true, Black: 720#(not |thread3Thread1of1ForFork1_#t~short11|), Black: 661#(not |thread2Thread1of1ForFork2_#t~short6|), 138#L60-13true, Black: 664#true, Black: 782#(and (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~Cn~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~i_BC~0 0)), 884#true, Black: 729#(and (= ~i_AC~0 0) (<= ~An~0 0)), Black: 742#(and (not |thread3Thread1of1ForFork1_#t~short11|) (= ~i_AC~0 0) (<= ~An~0 0)), 631#(= |#race~Bn~0| 0), Black: 725#(= ~i_AC~0 0), 246#L96true, Black: 679#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (= ~i_AB~0 0)), 666#(= |#race~B~0| 0), Black: 681#(and (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~An~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0) (<= ~An~0 0) (= ~i_AB~0 0)), 657#(= |#race~A~0| 0), Black: 674#(and (<= ~An~0 0) (= ~i_AB~0 0)), Black: 687#(and (<= ~An~0 0) (= ~i_AB~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), 637#(= |#race~Cn~0| 0), 670#(= ~i_AB~0 0), 887#true, 750#(= ~i_AB~0 0), 771#true, 340#L71-13true]) [2024-11-10 14:36:33,592 INFO L294 olderBase$Statistics]: this new event has 440 ancestors and is cut-off event [2024-11-10 14:36:33,592 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-10 14:36:33,592 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2024-11-10 14:36:33,592 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-10 14:36:33,611 INFO L124 PetriNetUnfolderBase]: 489/4095 cut-off events. [2024-11-10 14:36:33,611 INFO L125 PetriNetUnfolderBase]: For 713/741 co-relation queries the response was YES. [2024-11-10 14:36:33,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5921 conditions, 4095 events. 489/4095 cut-off events. For 713/741 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 32398 event pairs, 216 based on Foata normal form. 0/3861 useless extension candidates. Maximal degree in co-relation 5821. Up to 517 conditions per place. [2024-11-10 14:36:33,657 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 0 selfloop transitions, 0 changer transitions 413/413 dead transitions. [2024-11-10 14:36:33,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 413 transitions, 1233 flow [2024-11-10 14:36:33,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:36:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:36:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2024-11-10 14:36:33,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9516985138004246 [2024-11-10 14:36:33,659 INFO L175 Difference]: Start difference. First operand has 445 places, 412 transitions, 1197 flow. Second operand 3 states and 1793 transitions. [2024-11-10 14:36:33,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 413 transitions, 1233 flow [2024-11-10 14:36:33,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 413 transitions, 1200 flow, removed 5 selfloop flow, removed 12 redundant places. [2024-11-10 14:36:33,666 INFO L231 Difference]: Finished difference. Result has 429 places, 0 transitions, 0 flow [2024-11-10 14:36:33,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=429, PETRI_TRANSITIONS=0} [2024-11-10 14:36:33,667 INFO L277 CegarLoopForPetriNet]: 580 programPoint places, -151 predicate places. [2024-11-10 14:36:33,667 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 0 transitions, 0 flow [2024-11-10 14:36:33,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 595.6666666666666) internal successors, (1787), 3 states have internal predecessors, (1787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:36:33,670 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (116 of 117 remaining) [2024-11-10 14:36:33,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (115 of 117 remaining) [2024-11-10 14:36:33,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (114 of 117 remaining) [2024-11-10 14:36:33,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (113 of 117 remaining) [2024-11-10 14:36:33,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (112 of 117 remaining) [2024-11-10 14:36:33,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (111 of 117 remaining) [2024-11-10 14:36:33,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (110 of 117 remaining) [2024-11-10 14:36:33,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (109 of 117 remaining) [2024-11-10 14:36:33,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (108 of 117 remaining) [2024-11-10 14:36:33,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (107 of 117 remaining) [2024-11-10 14:36:33,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (106 of 117 remaining) [2024-11-10 14:36:33,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (105 of 117 remaining) [2024-11-10 14:36:33,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (104 of 117 remaining) [2024-11-10 14:36:33,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (103 of 117 remaining) [2024-11-10 14:36:33,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (102 of 117 remaining) [2024-11-10 14:36:33,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (101 of 117 remaining) [2024-11-10 14:36:33,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (100 of 117 remaining) [2024-11-10 14:36:33,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (99 of 117 remaining) [2024-11-10 14:36:33,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (98 of 117 remaining) [2024-11-10 14:36:33,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (97 of 117 remaining) [2024-11-10 14:36:33,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (96 of 117 remaining) [2024-11-10 14:36:33,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (95 of 117 remaining) [2024-11-10 14:36:33,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (94 of 117 remaining) [2024-11-10 14:36:33,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (93 of 117 remaining) [2024-11-10 14:36:33,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (92 of 117 remaining) [2024-11-10 14:36:33,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (91 of 117 remaining) [2024-11-10 14:36:33,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (90 of 117 remaining) [2024-11-10 14:36:33,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (89 of 117 remaining) [2024-11-10 14:36:33,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (88 of 117 remaining) [2024-11-10 14:36:33,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (87 of 117 remaining) [2024-11-10 14:36:33,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (86 of 117 remaining) [2024-11-10 14:36:33,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (85 of 117 remaining) [2024-11-10 14:36:33,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (84 of 117 remaining) [2024-11-10 14:36:33,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (83 of 117 remaining) [2024-11-10 14:36:33,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (82 of 117 remaining) [2024-11-10 14:36:33,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (81 of 117 remaining) [2024-11-10 14:36:33,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONDATA_RACE (80 of 117 remaining) [2024-11-10 14:36:33,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONDATA_RACE (79 of 117 remaining) [2024-11-10 14:36:33,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONDATA_RACE (78 of 117 remaining) [2024-11-10 14:36:33,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONDATA_RACE (77 of 117 remaining) [2024-11-10 14:36:33,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONDATA_RACE (76 of 117 remaining) [2024-11-10 14:36:33,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONDATA_RACE (75 of 117 remaining) [2024-11-10 14:36:33,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONDATA_RACE (74 of 117 remaining) [2024-11-10 14:36:33,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (73 of 117 remaining) [2024-11-10 14:36:33,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (72 of 117 remaining) [2024-11-10 14:36:33,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (71 of 117 remaining) [2024-11-10 14:36:33,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (70 of 117 remaining) [2024-11-10 14:36:33,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (69 of 117 remaining) [2024-11-10 14:36:33,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (68 of 117 remaining) [2024-11-10 14:36:33,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (67 of 117 remaining) [2024-11-10 14:36:33,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (66 of 117 remaining) [2024-11-10 14:36:33,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (65 of 117 remaining) [2024-11-10 14:36:33,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (64 of 117 remaining) [2024-11-10 14:36:33,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (63 of 117 remaining) [2024-11-10 14:36:33,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (62 of 117 remaining) [2024-11-10 14:36:33,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (61 of 117 remaining) [2024-11-10 14:36:33,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (60 of 117 remaining) [2024-11-10 14:36:33,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (59 of 117 remaining) [2024-11-10 14:36:33,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (58 of 117 remaining) [2024-11-10 14:36:33,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (57 of 117 remaining) [2024-11-10 14:36:33,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (56 of 117 remaining) [2024-11-10 14:36:33,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (55 of 117 remaining) [2024-11-10 14:36:33,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (54 of 117 remaining) [2024-11-10 14:36:33,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (53 of 117 remaining) [2024-11-10 14:36:33,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (52 of 117 remaining) [2024-11-10 14:36:33,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (51 of 117 remaining) [2024-11-10 14:36:33,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (50 of 117 remaining) [2024-11-10 14:36:33,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (49 of 117 remaining) [2024-11-10 14:36:33,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (48 of 117 remaining) [2024-11-10 14:36:33,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (47 of 117 remaining) [2024-11-10 14:36:33,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (46 of 117 remaining) [2024-11-10 14:36:33,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (45 of 117 remaining) [2024-11-10 14:36:33,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (44 of 117 remaining) [2024-11-10 14:36:33,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (43 of 117 remaining) [2024-11-10 14:36:33,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (42 of 117 remaining) [2024-11-10 14:36:33,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 117 remaining) [2024-11-10 14:36:33,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 117 remaining) [2024-11-10 14:36:33,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 117 remaining) [2024-11-10 14:36:33,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 117 remaining) [2024-11-10 14:36:33,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 117 remaining) [2024-11-10 14:36:33,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 117 remaining) [2024-11-10 14:36:33,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (35 of 117 remaining) [2024-11-10 14:36:33,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (34 of 117 remaining) [2024-11-10 14:36:33,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (33 of 117 remaining) [2024-11-10 14:36:33,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (32 of 117 remaining) [2024-11-10 14:36:33,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (31 of 117 remaining) [2024-11-10 14:36:33,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (30 of 117 remaining) [2024-11-10 14:36:33,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (29 of 117 remaining) [2024-11-10 14:36:33,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 117 remaining) [2024-11-10 14:36:33,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 117 remaining) [2024-11-10 14:36:33,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 117 remaining) [2024-11-10 14:36:33,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 117 remaining) [2024-11-10 14:36:33,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (24 of 117 remaining) [2024-11-10 14:36:33,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (23 of 117 remaining) [2024-11-10 14:36:33,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (22 of 117 remaining) [2024-11-10 14:36:33,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (21 of 117 remaining) [2024-11-10 14:36:33,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (20 of 117 remaining) [2024-11-10 14:36:33,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (19 of 117 remaining) [2024-11-10 14:36:33,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (18 of 117 remaining) [2024-11-10 14:36:33,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (17 of 117 remaining) [2024-11-10 14:36:33,684 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 117 remaining) [2024-11-10 14:36:33,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (15 of 117 remaining) [2024-11-10 14:36:33,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (14 of 117 remaining) [2024-11-10 14:36:33,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 117 remaining) [2024-11-10 14:36:33,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (12 of 117 remaining) [2024-11-10 14:36:33,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 117 remaining) [2024-11-10 14:36:33,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 117 remaining) [2024-11-10 14:36:33,685 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 117 remaining) [2024-11-10 14:36:33,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 117 remaining) [2024-11-10 14:36:33,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 117 remaining) [2024-11-10 14:36:33,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 117 remaining) [2024-11-10 14:36:33,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 117 remaining) [2024-11-10 14:36:33,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 117 remaining) [2024-11-10 14:36:33,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 117 remaining) [2024-11-10 14:36:33,686 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 117 remaining) [2024-11-10 14:36:33,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 117 remaining) [2024-11-10 14:36:33,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 117 remaining) [2024-11-10 14:36:33,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 14:36:33,687 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, 1, 1, 1] [2024-11-10 14:36:33,693 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:36:33,693 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:36:33,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:36:33 BasicIcfg [2024-11-10 14:36:33,698 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:36:33,698 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:36:33,698 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:36:33,699 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:36:33,699 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:35:39" (3/4) ... [2024-11-10 14:36:33,701 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:36:33,704 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:36:33,704 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:36:33,704 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-10 14:36:33,713 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2024-11-10 14:36:33,715 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:36:33,716 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:36:33,716 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:36:33,834 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:36:33,835 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:36:33,835 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:36:33,835 INFO L158 Benchmark]: Toolchain (without parser) took 55469.54ms. Allocated memory was 159.4MB in the beginning and 11.6GB in the end (delta: 11.5GB). Free memory was 106.9MB in the beginning and 9.9GB in the end (delta: -9.8GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-11-10 14:36:33,835 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:36:33,836 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.52ms. Allocated memory is still 159.4MB. Free memory was 106.9MB in the beginning and 91.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 14:36:33,836 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.05ms. Allocated memory is still 159.4MB. Free memory was 91.3MB in the beginning and 88.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:36:33,836 INFO L158 Benchmark]: Boogie Preprocessor took 71.95ms. Allocated memory is still 159.4MB. Free memory was 88.1MB in the beginning and 85.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:36:33,836 INFO L158 Benchmark]: IcfgBuilder took 1123.43ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 104.8MB in the end (delta: -19.7MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2024-11-10 14:36:33,836 INFO L158 Benchmark]: TraceAbstraction took 53697.41ms. Allocated memory was 159.4MB in the beginning and 11.6GB in the end (delta: 11.5GB). Free memory was 104.0MB in the beginning and 9.9GB in the end (delta: -9.8GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-11-10 14:36:33,837 INFO L158 Benchmark]: Witness Printer took 136.47ms. Allocated memory is still 11.6GB. Free memory was 9.9GB in the beginning and 9.9GB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 14:36:33,841 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.19ms. Allocated memory is still 159.4MB. Free memory is still 119.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.52ms. Allocated memory is still 159.4MB. Free memory was 106.9MB in the beginning and 91.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.05ms. Allocated memory is still 159.4MB. Free memory was 91.3MB in the beginning and 88.1MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.95ms. Allocated memory is still 159.4MB. Free memory was 88.1MB in the beginning and 85.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1123.43ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 104.8MB in the end (delta: -19.7MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. * TraceAbstraction took 53697.41ms. Allocated memory was 159.4MB in the beginning and 11.6GB in the end (delta: 11.5GB). Free memory was 104.0MB in the beginning and 9.9GB in the end (delta: -9.8GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 136.47ms. Allocated memory is still 11.6GB. Free memory was 9.9GB in the beginning and 9.9GB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. 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: 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: 49]: 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: 49]: 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: 49]: 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: 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: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: 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: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: 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: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: 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 7 procedures, 791 locations, 117 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: 53.5s, OverallIterations: 34, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 46.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7282 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4527 mSDsluCounter, 5221 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4269 mSDsCounter, 1376 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12287 IncrementalHoareTripleChecker+Invalid, 13663 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1376 mSolverCounterUnsat, 952 mSDtfsCounter, 12287 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 173 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2018occurred in iteration=30, InterpolantAutomatonStates: 179, 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.3s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 5494 NumberOfCodeBlocks, 5494 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 5460 ConstructedInterpolants, 0 QuantifiedInterpolants, 10406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 46/46 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 78 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:36:33,876 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