./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.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 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:12:56,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:12:56,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:12:56,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:12:56,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:12:56,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:12:56,725 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:12:56,726 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:12:56,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:12:56,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:12:56,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:12:56,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:12:56,729 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:12:56,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:12:56,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:12:56,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:12:56,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:12:56,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:12:56,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:12:56,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:12:56,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:12:56,736 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:12:56,736 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:12:56,737 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:12:56,737 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:12:56,737 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:12:56,737 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:12:56,738 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:12:56,738 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:12:56,738 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:12:56,738 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:12:56,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:12:56,739 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:12:56,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:12:56,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:12:56,741 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:12:56,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:12:56,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:12:56,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:12:56,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:12:56,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:12:56,743 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 -> 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 [2024-10-14 17:12:56,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:12:57,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:12:57,010 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:12:57,011 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:12:57,011 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:12:57,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2024-10-14 17:12:58,415 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:12:58,639 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:12:58,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2024-10-14 17:12:58,657 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231570e89/71469063ed2f49bf9f2f910b6def49b3/FLAG1ca9b8a0e [2024-10-14 17:12:58,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/231570e89/71469063ed2f49bf9f2f910b6def49b3 [2024-10-14 17:12:58,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:12:58,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:12:58,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:12:58,682 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:12:58,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:12:58,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:12:58" (1/1) ... [2024-10-14 17:12:58,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@734f2e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:58, skipping insertion in model container [2024-10-14 17:12:58,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:12:58" (1/1) ... [2024-10-14 17:12:58,721 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:12:58,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:12:58,991 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:12:59,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:12:59,064 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:12:59,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:59 WrapperNode [2024-10-14 17:12:59,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:12:59,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:12:59,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:12:59,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:12:59,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:59" (1/1) ... [2024-10-14 17:12:59,088 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:59" (1/1) ... [2024-10-14 17:12:59,115 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 248 [2024-10-14 17:12:59,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:12:59,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:12:59,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:12:59,117 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:12:59,126 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:59" (1/1) ... [2024-10-14 17:12:59,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:59" (1/1) ... [2024-10-14 17:12:59,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:59" (1/1) ... [2024-10-14 17:12:59,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:59" (1/1) ... [2024-10-14 17:12:59,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:59" (1/1) ... [2024-10-14 17:12:59,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:59" (1/1) ... [2024-10-14 17:12:59,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:59" (1/1) ... [2024-10-14 17:12:59,170 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:59" (1/1) ... [2024-10-14 17:12:59,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:12:59,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:12:59,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:12:59,177 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:12:59,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:59" (1/1) ... [2024-10-14 17:12:59,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:12:59,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:12:59,220 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-10-14 17:12:59,223 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-10-14 17:12:59,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:12:59,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:12:59,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:12:59,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:12:59,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:12:59,274 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-14 17:12:59,274 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-14 17:12:59,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:12:59,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 17:12:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:12:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:12:59,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:12:59,275 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 17:12:59,277 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:12:59,433 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:12:59,436 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:13:00,222 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:13:00,222 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:13:00,261 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:13:00,261 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-14 17:13:00,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:00 BoogieIcfgContainer [2024-10-14 17:13:00,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:13:00,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:13:00,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:13:00,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:13:00,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:12:58" (1/3) ... [2024-10-14 17:13:00,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c1a659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:13:00, skipping insertion in model container [2024-10-14 17:13:00,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:59" (2/3) ... [2024-10-14 17:13:00,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c1a659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:13:00, skipping insertion in model container [2024-10-14 17:13:00,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:13:00" (3/3) ... [2024-10-14 17:13:00,271 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2024-10-14 17:13:00,286 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:13:00,287 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2024-10-14 17:13:00,287 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:13:00,437 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 17:13:00,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 632 places, 655 transitions, 1331 flow [2024-10-14 17:13:00,831 INFO L124 PetriNetUnfolderBase]: 33/652 cut-off events. [2024-10-14 17:13:00,832 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 17:13:00,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 652 events. 33/652 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1718 event pairs, 0 based on Foata normal form. 0/542 useless extension candidates. Maximal degree in co-relation 493. Up to 3 conditions per place. [2024-10-14 17:13:00,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 632 places, 655 transitions, 1331 flow [2024-10-14 17:13:00,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 611 places, 632 transitions, 1282 flow [2024-10-14 17:13:00,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:13:00,888 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;@47f9fe78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:13:00,889 INFO L334 AbstractCegarLoop]: Starting to check reachability of 137 error locations. [2024-10-14 17:13:00,895 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:13:00,895 INFO L124 PetriNetUnfolderBase]: 0/28 cut-off events. [2024-10-14 17:13:00,896 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:13:00,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:00,897 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] [2024-10-14 17:13:00,897 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:00,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash 452336704, now seen corresponding path program 1 times [2024-10-14 17:13:00,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:00,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138320516] [2024-10-14 17:13:00,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:00,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:01,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:01,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:01,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138320516] [2024-10-14 17:13:01,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138320516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:01,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:01,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:01,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727409847] [2024-10-14 17:13:01,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:01,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:01,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:01,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:01,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:01,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-10-14 17:13:01,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 632 transitions, 1282 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-14 17:13:01,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:01,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-10-14 17:13:01,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:01,583 INFO L124 PetriNetUnfolderBase]: 78/1518 cut-off events. [2024-10-14 17:13:01,583 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-10-14 17:13:01,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1518 events. 78/1518 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9253 event pairs, 20 based on Foata normal form. 30/1249 useless extension candidates. Maximal degree in co-relation 1200. Up to 50 conditions per place. [2024-10-14 17:13:01,612 INFO L140 encePairwiseOnDemand]: 639/655 looper letters, 13 selfloop transitions, 2 changer transitions 7/618 dead transitions. [2024-10-14 17:13:01,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 618 transitions, 1284 flow [2024-10-14 17:13:01,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:01,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1898 transitions. [2024-10-14 17:13:01,638 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659033078880407 [2024-10-14 17:13:01,640 INFO L175 Difference]: Start difference. First operand has 611 places, 632 transitions, 1282 flow. Second operand 3 states and 1898 transitions. [2024-10-14 17:13:01,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 618 transitions, 1284 flow [2024-10-14 17:13:01,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 618 transitions, 1272 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 17:13:01,661 INFO L231 Difference]: Finished difference. Result has 606 places, 611 transitions, 1232 flow [2024-10-14 17:13:01,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1242, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=606, PETRI_TRANSITIONS=611} [2024-10-14 17:13:01,669 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -5 predicate places. [2024-10-14 17:13:01,670 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 611 transitions, 1232 flow [2024-10-14 17:13:01,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-14 17:13:01,671 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:01,672 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:01,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:13:01,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:01,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:01,673 INFO L85 PathProgramCache]: Analyzing trace with hash 2119054710, now seen corresponding path program 1 times [2024-10-14 17:13:01,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:01,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790879799] [2024-10-14 17:13:01,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:01,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:01,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:01,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790879799] [2024-10-14 17:13:01,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790879799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:01,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:01,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:01,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048949006] [2024-10-14 17:13:01,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:01,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:01,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:01,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:01,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:01,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-10-14 17:13:01,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 611 transitions, 1232 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-14 17:13:01,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:01,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-10-14 17:13:01,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:02,086 INFO L124 PetriNetUnfolderBase]: 50/1054 cut-off events. [2024-10-14 17:13:02,086 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 17:13:02,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1105 conditions, 1054 events. 50/1054 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5195 event pairs, 12 based on Foata normal form. 0/869 useless extension candidates. Maximal degree in co-relation 1068. Up to 38 conditions per place. [2024-10-14 17:13:02,115 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/610 dead transitions. [2024-10-14 17:13:02,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 610 transitions, 1260 flow [2024-10-14 17:13:02,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-10-14 17:13:02,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-10-14 17:13:02,121 INFO L175 Difference]: Start difference. First operand has 606 places, 611 transitions, 1232 flow. Second operand 3 states and 1885 transitions. [2024-10-14 17:13:02,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 610 transitions, 1260 flow [2024-10-14 17:13:02,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 610 transitions, 1256 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:02,133 INFO L231 Difference]: Finished difference. Result has 598 places, 610 transitions, 1230 flow [2024-10-14 17:13:02,134 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=598, PETRI_TRANSITIONS=610} [2024-10-14 17:13:02,135 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -13 predicate places. [2024-10-14 17:13:02,135 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 610 transitions, 1230 flow [2024-10-14 17:13:02,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-14 17:13:02,137 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:02,137 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:02,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:13:02,138 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:02,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:02,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1745260268, now seen corresponding path program 1 times [2024-10-14 17:13:02,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:02,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851974051] [2024-10-14 17:13:02,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:02,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:02,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:02,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:02,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851974051] [2024-10-14 17:13:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851974051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:02,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:02,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554782485] [2024-10-14 17:13:02,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:02,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:02,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:02,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:02,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:02,258 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-10-14 17:13:02,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 610 transitions, 1230 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-14 17:13:02,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:02,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-10-14 17:13:02,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:02,585 INFO L124 PetriNetUnfolderBase]: 78/1485 cut-off events. [2024-10-14 17:13:02,585 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-10-14 17:13:02,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 1485 events. 78/1485 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8424 event pairs, 20 based on Foata normal form. 0/1206 useless extension candidates. Maximal degree in co-relation 1501. Up to 50 conditions per place. [2024-10-14 17:13:02,611 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2024-10-14 17:13:02,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 609 transitions, 1258 flow [2024-10-14 17:13:02,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:02,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-10-14 17:13:02,617 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-10-14 17:13:02,617 INFO L175 Difference]: Start difference. First operand has 598 places, 610 transitions, 1230 flow. Second operand 3 states and 1885 transitions. [2024-10-14 17:13:02,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 609 transitions, 1258 flow [2024-10-14 17:13:02,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 609 transitions, 1254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:02,627 INFO L231 Difference]: Finished difference. Result has 597 places, 609 transitions, 1228 flow [2024-10-14 17:13:02,630 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=597, PETRI_TRANSITIONS=609} [2024-10-14 17:13:02,631 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -14 predicate places. [2024-10-14 17:13:02,631 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 609 transitions, 1228 flow [2024-10-14 17:13:02,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-14 17:13:02,633 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:02,633 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] [2024-10-14 17:13:02,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:13:02,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:02,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:02,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1138626604, now seen corresponding path program 1 times [2024-10-14 17:13:02,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:02,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633077516] [2024-10-14 17:13:02,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:02,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:02,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:02,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:02,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633077516] [2024-10-14 17:13:02,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633077516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:02,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:02,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:02,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426502340] [2024-10-14 17:13:02,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:02,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:02,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:02,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:02,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:02,745 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-10-14 17:13:02,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 609 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-10-14 17:13:02,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:02,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-10-14 17:13:02,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:03,065 INFO L124 PetriNetUnfolderBase]: 88/1786 cut-off events. [2024-10-14 17:13:03,066 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 17:13:03,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1856 conditions, 1786 events. 88/1786 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11593 event pairs, 20 based on Foata normal form. 0/1448 useless extension candidates. Maximal degree in co-relation 1803. Up to 51 conditions per place. [2024-10-14 17:13:03,101 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/608 dead transitions. [2024-10-14 17:13:03,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 608 transitions, 1258 flow [2024-10-14 17:13:03,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-10-14 17:13:03,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-10-14 17:13:03,106 INFO L175 Difference]: Start difference. First operand has 597 places, 609 transitions, 1228 flow. Second operand 3 states and 1883 transitions. [2024-10-14 17:13:03,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 608 transitions, 1258 flow [2024-10-14 17:13:03,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 608 transitions, 1254 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:03,117 INFO L231 Difference]: Finished difference. Result has 596 places, 608 transitions, 1226 flow [2024-10-14 17:13:03,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1226, PETRI_PLACES=596, PETRI_TRANSITIONS=608} [2024-10-14 17:13:03,119 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -15 predicate places. [2024-10-14 17:13:03,119 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 608 transitions, 1226 flow [2024-10-14 17:13:03,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-10-14 17:13:03,120 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:03,120 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] [2024-10-14 17:13:03,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:13:03,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:03,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:03,121 INFO L85 PathProgramCache]: Analyzing trace with hash -392882240, now seen corresponding path program 1 times [2024-10-14 17:13:03,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:03,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863753485] [2024-10-14 17:13:03,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:03,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:03,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:03,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863753485] [2024-10-14 17:13:03,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863753485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:03,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:03,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:03,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39541593] [2024-10-14 17:13:03,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:03,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:03,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:03,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:03,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:03,221 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-10-14 17:13:03,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 608 transitions, 1226 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-10-14 17:13:03,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:03,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-10-14 17:13:03,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:03,432 INFO L124 PetriNetUnfolderBase]: 50/1089 cut-off events. [2024-10-14 17:13:03,432 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-14 17:13:03,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 1089 events. 50/1089 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5540 event pairs, 12 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1080. Up to 39 conditions per place. [2024-10-14 17:13:03,453 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2024-10-14 17:13:03,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 607 transitions, 1256 flow [2024-10-14 17:13:03,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-10-14 17:13:03,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-10-14 17:13:03,458 INFO L175 Difference]: Start difference. First operand has 596 places, 608 transitions, 1226 flow. Second operand 3 states and 1883 transitions. [2024-10-14 17:13:03,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 607 transitions, 1256 flow [2024-10-14 17:13:03,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 607 transitions, 1252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:03,467 INFO L231 Difference]: Finished difference. Result has 595 places, 607 transitions, 1224 flow [2024-10-14 17:13:03,468 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1224, PETRI_PLACES=595, PETRI_TRANSITIONS=607} [2024-10-14 17:13:03,469 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -16 predicate places. [2024-10-14 17:13:03,469 INFO L471 AbstractCegarLoop]: Abstraction has has 595 places, 607 transitions, 1224 flow [2024-10-14 17:13:03,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-10-14 17:13:03,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:03,470 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:03,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:13:03,471 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:03,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:03,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1194727645, now seen corresponding path program 1 times [2024-10-14 17:13:03,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:03,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40839343] [2024-10-14 17:13:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:03,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:03,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:03,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:03,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40839343] [2024-10-14 17:13:03,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40839343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:03,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:03,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:03,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662091971] [2024-10-14 17:13:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:03,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:03,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:03,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:03,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:03,574 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 622 out of 655 [2024-10-14 17:13:03,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 595 places, 607 transitions, 1224 flow. Second operand has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-10-14 17:13:03,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:03,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 622 of 655 [2024-10-14 17:13:03,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:03,764 INFO L124 PetriNetUnfolderBase]: 48/866 cut-off events. [2024-10-14 17:13:03,764 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-10-14 17:13:03,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 866 events. 48/866 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3777 event pairs, 20 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 859. Up to 51 conditions per place. [2024-10-14 17:13:03,781 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/606 dead transitions. [2024-10-14 17:13:03,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 596 places, 606 transitions, 1254 flow [2024-10-14 17:13:03,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1883 transitions. [2024-10-14 17:13:03,786 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9582697201017811 [2024-10-14 17:13:03,786 INFO L175 Difference]: Start difference. First operand has 595 places, 607 transitions, 1224 flow. Second operand 3 states and 1883 transitions. [2024-10-14 17:13:03,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 596 places, 606 transitions, 1254 flow [2024-10-14 17:13:03,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 606 transitions, 1250 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:03,798 INFO L231 Difference]: Finished difference. Result has 594 places, 606 transitions, 1222 flow [2024-10-14 17:13:03,799 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1218, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1222, PETRI_PLACES=594, PETRI_TRANSITIONS=606} [2024-10-14 17:13:03,800 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -17 predicate places. [2024-10-14 17:13:03,800 INFO L471 AbstractCegarLoop]: Abstraction has has 594 places, 606 transitions, 1222 flow [2024-10-14 17:13:03,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.3333333333334) internal successors, (1870), 3 states have internal predecessors, (1870), 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-10-14 17:13:03,802 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:03,802 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:03,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:13:03,802 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:03,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:03,803 INFO L85 PathProgramCache]: Analyzing trace with hash -420121175, now seen corresponding path program 1 times [2024-10-14 17:13:03,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:03,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166919524] [2024-10-14 17:13:03,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:03,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:03,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:03,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166919524] [2024-10-14 17:13:03,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166919524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:03,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:03,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:03,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665469236] [2024-10-14 17:13:03,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:03,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:03,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:03,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:03,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:03,874 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-10-14 17:13:03,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 606 transitions, 1222 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-10-14 17:13:03,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:03,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-10-14 17:13:03,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:04,369 INFO L124 PetriNetUnfolderBase]: 165/2324 cut-off events. [2024-10-14 17:13:04,369 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2024-10-14 17:13:04,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2512 conditions, 2324 events. 165/2324 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 17869 event pairs, 64 based on Foata normal form. 0/1904 useless extension candidates. Maximal degree in co-relation 2435. Up to 151 conditions per place. [2024-10-14 17:13:04,402 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/601 dead transitions. [2024-10-14 17:13:04,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 601 transitions, 1246 flow [2024-10-14 17:13:04,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-10-14 17:13:04,406 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-10-14 17:13:04,407 INFO L175 Difference]: Start difference. First operand has 594 places, 606 transitions, 1222 flow. Second operand 3 states and 1876 transitions. [2024-10-14 17:13:04,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 601 transitions, 1246 flow [2024-10-14 17:13:04,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 601 transitions, 1242 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:04,416 INFO L231 Difference]: Finished difference. Result has 589 places, 601 transitions, 1210 flow [2024-10-14 17:13:04,417 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1208, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1210, PETRI_PLACES=589, PETRI_TRANSITIONS=601} [2024-10-14 17:13:04,417 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-10-14 17:13:04,418 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 601 transitions, 1210 flow [2024-10-14 17:13:04,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-10-14 17:13:04,419 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:04,419 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] [2024-10-14 17:13:04,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:13:04,420 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:04,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:04,420 INFO L85 PathProgramCache]: Analyzing trace with hash 237991042, now seen corresponding path program 1 times [2024-10-14 17:13:04,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:04,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274720674] [2024-10-14 17:13:04,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:04,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:04,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:04,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274720674] [2024-10-14 17:13:04,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274720674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:04,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:04,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:04,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363484791] [2024-10-14 17:13:04,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:04,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:04,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:04,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:04,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:04,529 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-10-14 17:13:04,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 601 transitions, 1210 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-14 17:13:04,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:04,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-10-14 17:13:04,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:04,814 INFO L124 PetriNetUnfolderBase]: 88/1774 cut-off events. [2024-10-14 17:13:04,814 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-14 17:13:04,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1774 events. 88/1774 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10573 event pairs, 20 based on Foata normal form. 0/1446 useless extension candidates. Maximal degree in co-relation 1765. Up to 50 conditions per place. [2024-10-14 17:13:04,850 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2024-10-14 17:13:04,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 590 places, 600 transitions, 1238 flow [2024-10-14 17:13:04,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-10-14 17:13:04,854 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-10-14 17:13:04,854 INFO L175 Difference]: Start difference. First operand has 589 places, 601 transitions, 1210 flow. Second operand 3 states and 1885 transitions. [2024-10-14 17:13:04,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 590 places, 600 transitions, 1238 flow [2024-10-14 17:13:04,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 600 transitions, 1237 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:13:04,893 INFO L231 Difference]: Finished difference. Result has 589 places, 600 transitions, 1211 flow [2024-10-14 17:13:04,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1211, PETRI_PLACES=589, PETRI_TRANSITIONS=600} [2024-10-14 17:13:04,895 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-10-14 17:13:04,896 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 600 transitions, 1211 flow [2024-10-14 17:13:04,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-14 17:13:04,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:04,898 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] [2024-10-14 17:13:04,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:13:04,900 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:04,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:04,900 INFO L85 PathProgramCache]: Analyzing trace with hash 233819493, now seen corresponding path program 1 times [2024-10-14 17:13:04,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:04,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179298953] [2024-10-14 17:13:04,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:04,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:04,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:05,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:05,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179298953] [2024-10-14 17:13:05,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179298953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:05,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:05,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:13:05,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086805473] [2024-10-14 17:13:05,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:05,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:13:05,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:05,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:13:05,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:13:05,899 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 655 [2024-10-14 17:13:05,903 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 600 transitions, 1211 flow. Second operand has 6 states, 6 states have (on average 545.5) internal successors, (3273), 6 states have internal predecessors, (3273), 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-10-14 17:13:05,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:05,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 655 [2024-10-14 17:13:05,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:13,968 INFO L124 PetriNetUnfolderBase]: 12845/49235 cut-off events. [2024-10-14 17:13:13,968 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-10-14 17:13:14,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66718 conditions, 49235 events. 12845/49235 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 647538 event pairs, 10080 based on Foata normal form. 0/40940 useless extension candidates. Maximal degree in co-relation 66642. Up to 17156 conditions per place. [2024-10-14 17:13:14,470 INFO L140 encePairwiseOnDemand]: 637/655 looper letters, 78 selfloop transitions, 15 changer transitions 0/597 dead transitions. [2024-10-14 17:13:14,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 597 transitions, 1391 flow [2024-10-14 17:13:14,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:13:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:13:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3360 transitions. [2024-10-14 17:13:14,478 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8549618320610687 [2024-10-14 17:13:14,478 INFO L175 Difference]: Start difference. First operand has 589 places, 600 transitions, 1211 flow. Second operand 6 states and 3360 transitions. [2024-10-14 17:13:14,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 597 transitions, 1391 flow [2024-10-14 17:13:14,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 597 transitions, 1387 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:14,488 INFO L231 Difference]: Finished difference. Result has 589 places, 597 transitions, 1231 flow [2024-10-14 17:13:14,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=597, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1231, PETRI_PLACES=589, PETRI_TRANSITIONS=597} [2024-10-14 17:13:14,490 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -22 predicate places. [2024-10-14 17:13:14,490 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 597 transitions, 1231 flow [2024-10-14 17:13:14,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 545.5) internal successors, (3273), 6 states have internal predecessors, (3273), 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-10-14 17:13:14,492 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:14,492 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:14,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:13:14,493 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:14,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:14,493 INFO L85 PathProgramCache]: Analyzing trace with hash -895861133, now seen corresponding path program 1 times [2024-10-14 17:13:14,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:14,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114632947] [2024-10-14 17:13:14,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:14,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:14,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:14,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114632947] [2024-10-14 17:13:14,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114632947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:14,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:14,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954843538] [2024-10-14 17:13:14,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:14,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:14,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:14,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:14,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:14,568 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-10-14 17:13:14,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 597 transitions, 1231 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-10-14 17:13:14,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:14,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-10-14 17:13:14,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:15,007 INFO L124 PetriNetUnfolderBase]: 113/1699 cut-off events. [2024-10-14 17:13:15,007 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2024-10-14 17:13:15,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 1699 events. 113/1699 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 11076 event pairs, 32 based on Foata normal form. 0/1418 useless extension candidates. Maximal degree in co-relation 1784. Up to 102 conditions per place. [2024-10-14 17:13:15,036 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/592 dead transitions. [2024-10-14 17:13:15,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 592 transitions, 1255 flow [2024-10-14 17:13:15,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:15,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:15,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-10-14 17:13:15,041 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-10-14 17:13:15,041 INFO L175 Difference]: Start difference. First operand has 589 places, 597 transitions, 1231 flow. Second operand 3 states and 1876 transitions. [2024-10-14 17:13:15,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 592 transitions, 1255 flow [2024-10-14 17:13:15,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 592 transitions, 1225 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:13:15,049 INFO L231 Difference]: Finished difference. Result has 581 places, 592 transitions, 1193 flow [2024-10-14 17:13:15,051 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1191, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1193, PETRI_PLACES=581, PETRI_TRANSITIONS=592} [2024-10-14 17:13:15,052 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -30 predicate places. [2024-10-14 17:13:15,053 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 592 transitions, 1193 flow [2024-10-14 17:13:15,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-10-14 17:13:15,054 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:15,054 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] [2024-10-14 17:13:15,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:13:15,055 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:15,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:15,055 INFO L85 PathProgramCache]: Analyzing trace with hash -467743023, now seen corresponding path program 1 times [2024-10-14 17:13:15,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:15,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051217113] [2024-10-14 17:13:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:15,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:15,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:15,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051217113] [2024-10-14 17:13:15,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051217113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:15,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:15,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:15,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134891566] [2024-10-14 17:13:15,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:15,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:15,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:15,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:15,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:15,125 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-10-14 17:13:15,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 592 transitions, 1193 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-14 17:13:15,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:15,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-10-14 17:13:15,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:15,283 INFO L124 PetriNetUnfolderBase]: 50/1065 cut-off events. [2024-10-14 17:13:15,284 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-10-14 17:13:15,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1065 events. 50/1065 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4830 event pairs, 12 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 1039. Up to 38 conditions per place. [2024-10-14 17:13:15,303 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/591 dead transitions. [2024-10-14 17:13:15,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 582 places, 591 transitions, 1221 flow [2024-10-14 17:13:15,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:15,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-10-14 17:13:15,308 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-10-14 17:13:15,308 INFO L175 Difference]: Start difference. First operand has 581 places, 592 transitions, 1193 flow. Second operand 3 states and 1885 transitions. [2024-10-14 17:13:15,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 582 places, 591 transitions, 1221 flow [2024-10-14 17:13:15,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 591 transitions, 1220 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:13:15,318 INFO L231 Difference]: Finished difference. Result has 581 places, 591 transitions, 1194 flow [2024-10-14 17:13:15,319 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=579, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1194, PETRI_PLACES=581, PETRI_TRANSITIONS=591} [2024-10-14 17:13:15,320 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -30 predicate places. [2024-10-14 17:13:15,320 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 591 transitions, 1194 flow [2024-10-14 17:13:15,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-14 17:13:15,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:15,322 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] [2024-10-14 17:13:15,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:13:15,322 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:15,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:15,323 INFO L85 PathProgramCache]: Analyzing trace with hash 164645723, now seen corresponding path program 1 times [2024-10-14 17:13:15,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:15,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972469900] [2024-10-14 17:13:15,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:15,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:15,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:15,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:15,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:15,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972469900] [2024-10-14 17:13:15,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972469900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:15,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:15,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:15,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730014008] [2024-10-14 17:13:15,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:15,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:15,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:15,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:15,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:15,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 618 out of 655 [2024-10-14 17:13:15,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 591 transitions, 1194 flow. Second operand has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-10-14 17:13:15,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:15,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 618 of 655 [2024-10-14 17:13:15,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:15,779 INFO L124 PetriNetUnfolderBase]: 166/1874 cut-off events. [2024-10-14 17:13:15,779 INFO L125 PetriNetUnfolderBase]: For 33/35 co-relation queries the response was YES. [2024-10-14 17:13:15,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 1874 events. 166/1874 cut-off events. For 33/35 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 12465 event pairs, 64 based on Foata normal form. 0/1587 useless extension candidates. Maximal degree in co-relation 1981. Up to 169 conditions per place. [2024-10-14 17:13:15,802 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 16 selfloop transitions, 1 changer transitions 0/586 dead transitions. [2024-10-14 17:13:15,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 586 transitions, 1218 flow [2024-10-14 17:13:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:15,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1876 transitions. [2024-10-14 17:13:15,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.95470737913486 [2024-10-14 17:13:15,810 INFO L175 Difference]: Start difference. First operand has 581 places, 591 transitions, 1194 flow. Second operand 3 states and 1876 transitions. [2024-10-14 17:13:15,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 586 transitions, 1218 flow [2024-10-14 17:13:15,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 586 transitions, 1214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:15,818 INFO L231 Difference]: Finished difference. Result has 576 places, 586 transitions, 1182 flow [2024-10-14 17:13:15,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1182, PETRI_PLACES=576, PETRI_TRANSITIONS=586} [2024-10-14 17:13:15,821 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -35 predicate places. [2024-10-14 17:13:15,821 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 586 transitions, 1182 flow [2024-10-14 17:13:15,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 619.0) internal successors, (1857), 3 states have internal predecessors, (1857), 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-10-14 17:13:15,822 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:15,822 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] [2024-10-14 17:13:15,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:13:15,823 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:15,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:15,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1782534799, now seen corresponding path program 1 times [2024-10-14 17:13:15,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:15,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876478431] [2024-10-14 17:13:15,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:15,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:15,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:15,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876478431] [2024-10-14 17:13:15,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876478431] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:15,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:15,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:15,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301509522] [2024-10-14 17:13:15,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:15,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:15,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:15,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:15,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:15,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 623 out of 655 [2024-10-14 17:13:15,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 586 transitions, 1182 flow. Second operand has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-14 17:13:15,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:15,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 623 of 655 [2024-10-14 17:13:15,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:16,036 INFO L124 PetriNetUnfolderBase]: 48/837 cut-off events. [2024-10-14 17:13:16,036 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-10-14 17:13:16,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 899 conditions, 837 events. 48/837 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3270 event pairs, 20 based on Foata normal form. 0/725 useless extension candidates. Maximal degree in co-relation 822. Up to 50 conditions per place. [2024-10-14 17:13:16,053 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-10-14 17:13:16,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 585 transitions, 1210 flow [2024-10-14 17:13:16,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:16,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-10-14 17:13:16,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9592875318066157 [2024-10-14 17:13:16,058 INFO L175 Difference]: Start difference. First operand has 576 places, 586 transitions, 1182 flow. Second operand 3 states and 1885 transitions. [2024-10-14 17:13:16,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 585 transitions, 1210 flow [2024-10-14 17:13:16,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 585 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:13:16,067 INFO L231 Difference]: Finished difference. Result has 576 places, 585 transitions, 1183 flow [2024-10-14 17:13:16,068 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1179, PETRI_DIFFERENCE_MINUEND_PLACES=574, 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=1183, PETRI_PLACES=576, PETRI_TRANSITIONS=585} [2024-10-14 17:13:16,069 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -35 predicate places. [2024-10-14 17:13:16,069 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 585 transitions, 1183 flow [2024-10-14 17:13:16,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 624.3333333333334) internal successors, (1873), 3 states have internal predecessors, (1873), 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-10-14 17:13:16,071 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:16,071 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] [2024-10-14 17:13:16,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:13:16,071 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:16,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:16,072 INFO L85 PathProgramCache]: Analyzing trace with hash 286688870, now seen corresponding path program 1 times [2024-10-14 17:13:16,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:16,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675913789] [2024-10-14 17:13:16,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:16,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:16,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:16,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675913789] [2024-10-14 17:13:16,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675913789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:16,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:16,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:16,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297181947] [2024-10-14 17:13:16,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:16,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:16,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:16,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:16,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:16,142 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-10-14 17:13:16,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 585 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-10-14 17:13:16,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:16,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-10-14 17:13:16,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:16,395 INFO L124 PetriNetUnfolderBase]: 157/2220 cut-off events. [2024-10-14 17:13:16,395 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-14 17:13:16,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2386 conditions, 2220 events. 157/2220 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 16956 event pairs, 53 based on Foata normal form. 0/1869 useless extension candidates. Maximal degree in co-relation 2309. Up to 123 conditions per place. [2024-10-14 17:13:16,422 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-10-14 17:13:16,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 585 transitions, 1223 flow [2024-10-14 17:13:16,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:16,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-10-14 17:13:16,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-10-14 17:13:16,427 INFO L175 Difference]: Start difference. First operand has 576 places, 585 transitions, 1183 flow. Second operand 3 states and 1886 transitions. [2024-10-14 17:13:16,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 585 transitions, 1223 flow [2024-10-14 17:13:16,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 585 transitions, 1219 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:16,438 INFO L231 Difference]: Finished difference. Result has 573 places, 583 transitions, 1185 flow [2024-10-14 17:13:16,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1171, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1185, PETRI_PLACES=573, PETRI_TRANSITIONS=583} [2024-10-14 17:13:16,440 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -38 predicate places. [2024-10-14 17:13:16,440 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 583 transitions, 1185 flow [2024-10-14 17:13:16,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-10-14 17:13:16,442 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:16,442 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-10-14 17:13:16,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:13:16,442 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:16,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:16,443 INFO L85 PathProgramCache]: Analyzing trace with hash 630144488, now seen corresponding path program 1 times [2024-10-14 17:13:16,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:16,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140062484] [2024-10-14 17:13:16,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:16,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:16,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:16,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:16,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140062484] [2024-10-14 17:13:16,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140062484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:16,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:16,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581077276] [2024-10-14 17:13:16,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:16,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:16,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:16,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:16,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:16,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-10-14 17:13:16,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 583 transitions, 1185 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-10-14 17:13:16,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:16,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-10-14 17:13:16,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:16,858 INFO L124 PetriNetUnfolderBase]: 96/1534 cut-off events. [2024-10-14 17:13:16,859 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-14 17:13:16,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 1534 events. 96/1534 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9615 event pairs, 20 based on Foata normal form. 0/1315 useless extension candidates. Maximal degree in co-relation 1559. Up to 75 conditions per place. [2024-10-14 17:13:16,900 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2024-10-14 17:13:16,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 583 transitions, 1225 flow [2024-10-14 17:13:16,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:16,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:16,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-10-14 17:13:16,905 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-10-14 17:13:16,905 INFO L175 Difference]: Start difference. First operand has 573 places, 583 transitions, 1185 flow. Second operand 3 states and 1886 transitions. [2024-10-14 17:13:16,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 583 transitions, 1225 flow [2024-10-14 17:13:16,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 583 transitions, 1225 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:13:16,915 INFO L231 Difference]: Finished difference. Result has 572 places, 581 transitions, 1191 flow [2024-10-14 17:13:16,917 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=572, PETRI_TRANSITIONS=581} [2024-10-14 17:13:16,918 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-10-14 17:13:16,918 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 581 transitions, 1191 flow [2024-10-14 17:13:16,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-10-14 17:13:16,920 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:16,920 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-10-14 17:13:16,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:13:16,920 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:16,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:16,921 INFO L85 PathProgramCache]: Analyzing trace with hash -69708871, now seen corresponding path program 1 times [2024-10-14 17:13:16,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:16,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590284373] [2024-10-14 17:13:16,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:16,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:16,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:16,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:16,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590284373] [2024-10-14 17:13:16,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590284373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:16,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:16,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:16,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255199340] [2024-10-14 17:13:16,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:16,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:16,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:16,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:16,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:17,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-10-14 17:13:17,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 581 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-10-14 17:13:17,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:17,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-10-14 17:13:17,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:17,591 INFO L124 PetriNetUnfolderBase]: 250/3267 cut-off events. [2024-10-14 17:13:17,591 INFO L125 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2024-10-14 17:13:17,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3504 conditions, 3267 events. 250/3267 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 28606 event pairs, 52 based on Foata normal form. 1/2784 useless extension candidates. Maximal degree in co-relation 3426. Up to 202 conditions per place. [2024-10-14 17:13:17,634 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 17 selfloop transitions, 2 changer transitions 0/581 dead transitions. [2024-10-14 17:13:17,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 581 transitions, 1231 flow [2024-10-14 17:13:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:17,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1886 transitions. [2024-10-14 17:13:17,639 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597964376590331 [2024-10-14 17:13:17,639 INFO L175 Difference]: Start difference. First operand has 572 places, 581 transitions, 1191 flow. Second operand 3 states and 1886 transitions. [2024-10-14 17:13:17,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 581 transitions, 1231 flow [2024-10-14 17:13:17,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 581 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:13:17,650 INFO L231 Difference]: Finished difference. Result has 571 places, 579 transitions, 1197 flow [2024-10-14 17:13:17,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1197, PETRI_PLACES=571, PETRI_TRANSITIONS=579} [2024-10-14 17:13:17,651 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-10-14 17:13:17,651 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 579 transitions, 1197 flow [2024-10-14 17:13:17,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.6666666666666) internal successors, (1868), 3 states have internal predecessors, (1868), 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-10-14 17:13:17,653 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:17,653 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, 1, 1, 1] [2024-10-14 17:13:17,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:13:17,653 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:17,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:17,654 INFO L85 PathProgramCache]: Analyzing trace with hash 911023066, now seen corresponding path program 1 times [2024-10-14 17:13:17,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:17,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596798034] [2024-10-14 17:13:17,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:17,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:17,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:17,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596798034] [2024-10-14 17:13:17,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596798034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:17,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:17,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:17,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991416304] [2024-10-14 17:13:17,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:17,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:17,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:17,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:17,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:17,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-10-14 17:13:17,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 579 transitions, 1197 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-10-14 17:13:17,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:17,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-10-14 17:13:17,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:18,199 INFO L124 PetriNetUnfolderBase]: 108/2057 cut-off events. [2024-10-14 17:13:18,199 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2024-10-14 17:13:18,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 2057 events. 108/2057 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13449 event pairs, 8 based on Foata normal form. 1/1770 useless extension candidates. Maximal degree in co-relation 2089. Up to 33 conditions per place. [2024-10-14 17:13:18,237 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2024-10-14 17:13:18,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 580 transitions, 1231 flow [2024-10-14 17:13:18,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-10-14 17:13:18,242 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9638676844783715 [2024-10-14 17:13:18,242 INFO L175 Difference]: Start difference. First operand has 571 places, 579 transitions, 1197 flow. Second operand 3 states and 1894 transitions. [2024-10-14 17:13:18,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 580 transitions, 1231 flow [2024-10-14 17:13:18,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 580 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:13:18,254 INFO L231 Difference]: Finished difference. Result has 572 places, 578 transitions, 1199 flow [2024-10-14 17:13:18,255 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=572, PETRI_TRANSITIONS=578} [2024-10-14 17:13:18,255 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-10-14 17:13:18,255 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 578 transitions, 1199 flow [2024-10-14 17:13:18,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-10-14 17:13:18,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:18,257 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, 1, 1, 1, 1] [2024-10-14 17:13:18,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:13:18,257 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:18,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:18,257 INFO L85 PathProgramCache]: Analyzing trace with hash 44543776, now seen corresponding path program 1 times [2024-10-14 17:13:18,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:18,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333587291] [2024-10-14 17:13:18,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:18,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:18,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:18,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333587291] [2024-10-14 17:13:18,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333587291] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:18,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:18,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:13:18,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176138479] [2024-10-14 17:13:18,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:18,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:18,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:18,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:18,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:18,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-10-14 17:13:18,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 578 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-10-14 17:13:18,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:18,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-10-14 17:13:18,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:18,690 INFO L124 PetriNetUnfolderBase]: 89/1589 cut-off events. [2024-10-14 17:13:18,691 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-14 17:13:18,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1705 conditions, 1589 events. 89/1589 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10195 event pairs, 12 based on Foata normal form. 0/1372 useless extension candidates. Maximal degree in co-relation 1664. Up to 40 conditions per place. [2024-10-14 17:13:18,718 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/581 dead transitions. [2024-10-14 17:13:18,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 581 transitions, 1241 flow [2024-10-14 17:13:18,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-10-14 17:13:18,722 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-10-14 17:13:18,722 INFO L175 Difference]: Start difference. First operand has 572 places, 578 transitions, 1199 flow. Second operand 3 states and 1896 transitions. [2024-10-14 17:13:18,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 581 transitions, 1241 flow [2024-10-14 17:13:18,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 581 transitions, 1237 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:18,734 INFO L231 Difference]: Finished difference. Result has 574 places, 579 transitions, 1213 flow [2024-10-14 17:13:18,734 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1195, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=574, PETRI_TRANSITIONS=579} [2024-10-14 17:13:18,735 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -37 predicate places. [2024-10-14 17:13:18,735 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 579 transitions, 1213 flow [2024-10-14 17:13:18,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.6666666666666) internal successors, (1883), 3 states have internal predecessors, (1883), 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-10-14 17:13:18,736 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:18,736 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:18,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:13:18,736 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:18,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:18,737 INFO L85 PathProgramCache]: Analyzing trace with hash 578733025, now seen corresponding path program 1 times [2024-10-14 17:13:18,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:18,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881703148] [2024-10-14 17:13:18,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:18,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:18,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:18,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:18,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881703148] [2024-10-14 17:13:18,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881703148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:18,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:18,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:18,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670404161] [2024-10-14 17:13:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:18,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:18,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:18,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:18,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:18,822 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-10-14 17:13:18,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 579 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-10-14 17:13:18,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:18,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-10-14 17:13:18,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:19,329 INFO L124 PetriNetUnfolderBase]: 197/2613 cut-off events. [2024-10-14 17:13:19,329 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-10-14 17:13:19,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2907 conditions, 2613 events. 197/2613 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 19808 event pairs, 24 based on Foata normal form. 0/2267 useless extension candidates. Maximal degree in co-relation 2827. Up to 168 conditions per place. [2024-10-14 17:13:19,374 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 20 selfloop transitions, 2 changer transitions 0/582 dead transitions. [2024-10-14 17:13:19,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 582 transitions, 1268 flow [2024-10-14 17:13:19,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-10-14 17:13:19,379 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-10-14 17:13:19,379 INFO L175 Difference]: Start difference. First operand has 574 places, 579 transitions, 1213 flow. Second operand 3 states and 1889 transitions. [2024-10-14 17:13:19,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 582 transitions, 1268 flow [2024-10-14 17:13:19,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 570 places, 582 transitions, 1262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:19,390 INFO L231 Difference]: Finished difference. Result has 571 places, 577 transitions, 1213 flow [2024-10-14 17:13:19,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1199, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1213, PETRI_PLACES=571, PETRI_TRANSITIONS=577} [2024-10-14 17:13:19,391 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-10-14 17:13:19,391 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 577 transitions, 1213 flow [2024-10-14 17:13:19,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.3333333333334) internal successors, (1867), 3 states have internal predecessors, (1867), 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-10-14 17:13:19,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:19,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:19,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 17:13:19,392 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:19,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:19,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1172048154, now seen corresponding path program 1 times [2024-10-14 17:13:19,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:19,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301659475] [2024-10-14 17:13:19,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:19,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:19,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:19,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:19,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301659475] [2024-10-14 17:13:19,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301659475] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:19,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:19,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:19,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899107334] [2024-10-14 17:13:19,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:19,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:19,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:19,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:19,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:19,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-10-14 17:13:19,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 577 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-10-14 17:13:19,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:19,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-10-14 17:13:19,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:19,971 INFO L124 PetriNetUnfolderBase]: 169/2812 cut-off events. [2024-10-14 17:13:19,971 INFO L125 PetriNetUnfolderBase]: For 20/59 co-relation queries the response was YES. [2024-10-14 17:13:20,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3021 conditions, 2812 events. 169/2812 cut-off events. For 20/59 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 20819 event pairs, 19 based on Foata normal form. 0/2415 useless extension candidates. Maximal degree in co-relation 2941. Up to 72 conditions per place. [2024-10-14 17:13:20,048 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/578 dead transitions. [2024-10-14 17:13:20,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 572 places, 578 transitions, 1249 flow [2024-10-14 17:13:20,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:20,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-10-14 17:13:20,053 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-10-14 17:13:20,053 INFO L175 Difference]: Start difference. First operand has 571 places, 577 transitions, 1213 flow. Second operand 3 states and 1892 transitions. [2024-10-14 17:13:20,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 572 places, 578 transitions, 1249 flow [2024-10-14 17:13:20,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 578 transitions, 1249 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:13:20,068 INFO L231 Difference]: Finished difference. Result has 572 places, 576 transitions, 1215 flow [2024-10-14 17:13:20,069 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1211, PETRI_DIFFERENCE_MINUEND_PLACES=570, 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=1215, PETRI_PLACES=572, PETRI_TRANSITIONS=576} [2024-10-14 17:13:20,069 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -39 predicate places. [2024-10-14 17:13:20,069 INFO L471 AbstractCegarLoop]: Abstraction has has 572 places, 576 transitions, 1215 flow [2024-10-14 17:13:20,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-10-14 17:13:20,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:20,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:20,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 17:13:20,071 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:20,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash -756035181, now seen corresponding path program 1 times [2024-10-14 17:13:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:20,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832674277] [2024-10-14 17:13:20,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:20,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:20,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832674277] [2024-10-14 17:13:20,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832674277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:20,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:20,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422488727] [2024-10-14 17:13:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:20,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:20,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:20,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:20,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:20,168 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-10-14 17:13:20,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 576 transitions, 1215 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-10-14 17:13:20,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:20,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-10-14 17:13:20,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:20,607 INFO L124 PetriNetUnfolderBase]: 147/2543 cut-off events. [2024-10-14 17:13:20,608 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2024-10-14 17:13:20,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2738 conditions, 2543 events. 147/2543 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 18068 event pairs, 10 based on Foata normal form. 0/2202 useless extension candidates. Maximal degree in co-relation 2661. Up to 44 conditions per place. [2024-10-14 17:13:20,648 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 13 selfloop transitions, 2 changer transitions 0/577 dead transitions. [2024-10-14 17:13:20,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 577 transitions, 1249 flow [2024-10-14 17:13:20,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:20,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-10-14 17:13:20,652 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9638676844783715 [2024-10-14 17:13:20,652 INFO L175 Difference]: Start difference. First operand has 572 places, 576 transitions, 1215 flow. Second operand 3 states and 1894 transitions. [2024-10-14 17:13:20,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 577 transitions, 1249 flow [2024-10-14 17:13:20,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 577 transitions, 1245 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:20,663 INFO L231 Difference]: Finished difference. Result has 571 places, 575 transitions, 1213 flow [2024-10-14 17:13:20,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=569, 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=1213, PETRI_PLACES=571, PETRI_TRANSITIONS=575} [2024-10-14 17:13:20,664 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -40 predicate places. [2024-10-14 17:13:20,664 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 575 transitions, 1213 flow [2024-10-14 17:13:20,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 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-10-14 17:13:20,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:20,665 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 17:13:20,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 17:13:20,665 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:20,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:20,666 INFO L85 PathProgramCache]: Analyzing trace with hash 833850535, now seen corresponding path program 1 times [2024-10-14 17:13:20,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:20,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539244375] [2024-10-14 17:13:20,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:20,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:20,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:20,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539244375] [2024-10-14 17:13:20,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539244375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:20,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:20,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:13:20,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959586819] [2024-10-14 17:13:20,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:20,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:13:20,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:20,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:13:20,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:13:21,509 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-10-14 17:13:21,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 575 transitions, 1213 flow. Second operand has 8 states, 8 states have (on average 598.125) internal successors, (4785), 8 states have internal predecessors, (4785), 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-10-14 17:13:21,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:21,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-10-14 17:13:21,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:22,314 INFO L124 PetriNetUnfolderBase]: 235/3653 cut-off events. [2024-10-14 17:13:22,314 INFO L125 PetriNetUnfolderBase]: For 9/27 co-relation queries the response was YES. [2024-10-14 17:13:22,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4125 conditions, 3653 events. 235/3653 cut-off events. For 9/27 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31299 event pairs, 43 based on Foata normal form. 5/3193 useless extension candidates. Maximal degree in co-relation 4072. Up to 155 conditions per place. [2024-10-14 17:13:22,409 INFO L140 encePairwiseOnDemand]: 640/655 looper letters, 70 selfloop transitions, 16 changer transitions 0/614 dead transitions. [2024-10-14 17:13:22,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 614 transitions, 1479 flow [2024-10-14 17:13:22,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:13:22,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 17:13:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6620 transitions. [2024-10-14 17:13:22,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9188063844552394 [2024-10-14 17:13:22,419 INFO L175 Difference]: Start difference. First operand has 571 places, 575 transitions, 1213 flow. Second operand 11 states and 6620 transitions. [2024-10-14 17:13:22,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 614 transitions, 1479 flow [2024-10-14 17:13:22,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 614 transitions, 1475 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:22,431 INFO L231 Difference]: Finished difference. Result has 584 places, 584 transitions, 1293 flow [2024-10-14 17:13:22,431 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=575, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1293, PETRI_PLACES=584, PETRI_TRANSITIONS=584} [2024-10-14 17:13:22,432 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2024-10-14 17:13:22,432 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 584 transitions, 1293 flow [2024-10-14 17:13:22,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.125) internal successors, (4785), 8 states have internal predecessors, (4785), 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-10-14 17:13:22,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:22,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:22,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 17:13:22,434 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:22,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:22,435 INFO L85 PathProgramCache]: Analyzing trace with hash -206713279, now seen corresponding path program 1 times [2024-10-14 17:13:22,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:22,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026957399] [2024-10-14 17:13:22,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:22,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:22,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:22,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026957399] [2024-10-14 17:13:22,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026957399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:22,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:22,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49691804] [2024-10-14 17:13:22,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:22,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:22,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:22,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:22,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:22,531 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-10-14 17:13:22,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 584 transitions, 1293 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-10-14 17:13:22,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:22,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-10-14 17:13:22,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:22,997 INFO L124 PetriNetUnfolderBase]: 191/2428 cut-off events. [2024-10-14 17:13:22,997 INFO L125 PetriNetUnfolderBase]: For 79/144 co-relation queries the response was YES. [2024-10-14 17:13:23,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2813 conditions, 2428 events. 191/2428 cut-off events. For 79/144 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 18743 event pairs, 44 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 2724. Up to 165 conditions per place. [2024-10-14 17:13:23,042 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-10-14 17:13:23,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 585 transitions, 1329 flow [2024-10-14 17:13:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:23,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-10-14 17:13:23,046 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-10-14 17:13:23,046 INFO L175 Difference]: Start difference. First operand has 584 places, 584 transitions, 1293 flow. Second operand 3 states and 1892 transitions. [2024-10-14 17:13:23,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 585 transitions, 1329 flow [2024-10-14 17:13:23,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 585 transitions, 1325 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:13:23,055 INFO L231 Difference]: Finished difference. Result has 584 places, 583 transitions, 1291 flow [2024-10-14 17:13:23,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1291, PETRI_PLACES=584, PETRI_TRANSITIONS=583} [2024-10-14 17:13:23,056 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2024-10-14 17:13:23,056 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 583 transitions, 1291 flow [2024-10-14 17:13:23,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-10-14 17:13:23,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:23,056 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:23,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 17:13:23,057 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:23,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:23,057 INFO L85 PathProgramCache]: Analyzing trace with hash -245544325, now seen corresponding path program 1 times [2024-10-14 17:13:23,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:23,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885905676] [2024-10-14 17:13:23,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:23,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:23,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:23,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885905676] [2024-10-14 17:13:23,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885905676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:23,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:23,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:13:23,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90885099] [2024-10-14 17:13:23,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:23,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:23,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:23,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:23,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:23,131 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-10-14 17:13:23,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 583 transitions, 1291 flow. Second operand has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-10-14 17:13:23,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:23,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-10-14 17:13:23,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:23,809 INFO L124 PetriNetUnfolderBase]: 254/3174 cut-off events. [2024-10-14 17:13:23,809 INFO L125 PetriNetUnfolderBase]: For 114/211 co-relation queries the response was YES. [2024-10-14 17:13:23,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 3174 events. 254/3174 cut-off events. For 114/211 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 24936 event pairs, 66 based on Foata normal form. 0/2735 useless extension candidates. Maximal degree in co-relation 3606. Up to 236 conditions per place. [2024-10-14 17:13:23,866 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/586 dead transitions. [2024-10-14 17:13:23,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 586 transitions, 1333 flow [2024-10-14 17:13:23,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-10-14 17:13:23,869 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-10-14 17:13:23,870 INFO L175 Difference]: Start difference. First operand has 584 places, 583 transitions, 1291 flow. Second operand 3 states and 1896 transitions. [2024-10-14 17:13:23,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 586 transitions, 1333 flow [2024-10-14 17:13:23,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 586 transitions, 1329 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:23,878 INFO L231 Difference]: Finished difference. Result has 586 places, 584 transitions, 1305 flow [2024-10-14 17:13:23,879 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1287, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=586, PETRI_TRANSITIONS=584} [2024-10-14 17:13:23,879 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -25 predicate places. [2024-10-14 17:13:23,879 INFO L471 AbstractCegarLoop]: Abstraction has has 586 places, 584 transitions, 1305 flow [2024-10-14 17:13:23,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.3333333333334) internal successors, (1885), 3 states have internal predecessors, (1885), 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-10-14 17:13:23,880 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:23,880 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:23,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 17:13:23,880 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:23,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:23,881 INFO L85 PathProgramCache]: Analyzing trace with hash 894546295, now seen corresponding path program 1 times [2024-10-14 17:13:23,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:23,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929668473] [2024-10-14 17:13:23,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:23,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:23,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:23,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:23,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929668473] [2024-10-14 17:13:23,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929668473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:23,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:23,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:13:23,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407025705] [2024-10-14 17:13:23,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:23,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:23,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:23,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:23,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:23,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 655 [2024-10-14 17:13:23,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 584 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-10-14 17:13:23,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:23,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 655 [2024-10-14 17:13:23,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:24,910 INFO L124 PetriNetUnfolderBase]: 299/3771 cut-off events. [2024-10-14 17:13:24,911 INFO L125 PetriNetUnfolderBase]: For 92/125 co-relation queries the response was YES. [2024-10-14 17:13:24,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 3771 events. 299/3771 cut-off events. For 92/125 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 33338 event pairs, 72 based on Foata normal form. 0/3318 useless extension candidates. Maximal degree in co-relation 4389. Up to 227 conditions per place. [2024-10-14 17:13:24,980 INFO L140 encePairwiseOnDemand]: 651/655 looper letters, 14 selfloop transitions, 3 changer transitions 0/587 dead transitions. [2024-10-14 17:13:24,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 587 transitions, 1347 flow [2024-10-14 17:13:24,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:24,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1896 transitions. [2024-10-14 17:13:24,983 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9648854961832061 [2024-10-14 17:13:24,983 INFO L175 Difference]: Start difference. First operand has 586 places, 584 transitions, 1305 flow. Second operand 3 states and 1896 transitions. [2024-10-14 17:13:24,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 587 transitions, 1347 flow [2024-10-14 17:13:24,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 587 transitions, 1341 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:24,995 INFO L231 Difference]: Finished difference. Result has 588 places, 585 transitions, 1317 flow [2024-10-14 17:13:24,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=588, PETRI_TRANSITIONS=585} [2024-10-14 17:13:24,996 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -23 predicate places. [2024-10-14 17:13:24,996 INFO L471 AbstractCegarLoop]: Abstraction has has 588 places, 585 transitions, 1317 flow [2024-10-14 17:13:24,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 628.0) internal successors, (1884), 3 states have internal predecessors, (1884), 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-10-14 17:13:24,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:24,997 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:24,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 17:13:24,997 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:24,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:24,998 INFO L85 PathProgramCache]: Analyzing trace with hash -525151164, now seen corresponding path program 1 times [2024-10-14 17:13:24,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:24,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366183263] [2024-10-14 17:13:24,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:24,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:25,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:25,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366183263] [2024-10-14 17:13:25,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366183263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:25,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:25,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:25,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337552338] [2024-10-14 17:13:25,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:25,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:25,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:25,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:25,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:25,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-10-14 17:13:25,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 588 places, 585 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-10-14 17:13:25,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:25,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-10-14 17:13:25,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:25,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1791] thread2EXIT-->L124: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t2~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][466], [673#(= |#race~n3~0| 0), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 687#(= |#race~count3~0| 0), 699#(= |#race~get1~0| 0), Black: 677#true, 655#(= |#race~n1~0| 0), Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), 740#true, Black: 681#true, 745#true, 683#(= |#race~count2~0| 0), Black: 685#true, 679#(= |#race~count1~0| 0), 667#(= |#race~n2~0| 0), 585#L124true, Black: 712#(<= ~n1~0 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), Black: 697#true, 401#$Ultimate##0true]) [2024-10-14 17:13:25,890 INFO L294 olderBase$Statistics]: this new event has 284 ancestors and is cut-off event [2024-10-14 17:13:25,890 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2024-10-14 17:13:25,890 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-10-14 17:13:25,890 INFO L297 olderBase$Statistics]: existing Event has 275 ancestors and is cut-off event [2024-10-14 17:13:26,011 INFO L124 PetriNetUnfolderBase]: 307/4941 cut-off events. [2024-10-14 17:13:26,012 INFO L125 PetriNetUnfolderBase]: For 60/125 co-relation queries the response was YES. [2024-10-14 17:13:26,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5630 conditions, 4941 events. 307/4941 cut-off events. For 60/125 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 43982 event pairs, 29 based on Foata normal form. 0/4343 useless extension candidates. Maximal degree in co-relation 5540. Up to 131 conditions per place. [2024-10-14 17:13:26,093 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/586 dead transitions. [2024-10-14 17:13:26,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 586 transitions, 1353 flow [2024-10-14 17:13:26,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-10-14 17:13:26,097 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-10-14 17:13:26,097 INFO L175 Difference]: Start difference. First operand has 588 places, 585 transitions, 1317 flow. Second operand 3 states and 1892 transitions. [2024-10-14 17:13:26,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 586 transitions, 1353 flow [2024-10-14 17:13:26,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 586 transitions, 1347 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:26,110 INFO L231 Difference]: Finished difference. Result has 587 places, 584 transitions, 1313 flow [2024-10-14 17:13:26,110 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1309, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1313, PETRI_PLACES=587, PETRI_TRANSITIONS=584} [2024-10-14 17:13:26,110 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -24 predicate places. [2024-10-14 17:13:26,111 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 584 transitions, 1313 flow [2024-10-14 17:13:26,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.6666666666666) internal successors, (1880), 3 states have internal predecessors, (1880), 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-10-14 17:13:26,111 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:26,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:26,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 17:13:26,112 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:26,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash 38540104, now seen corresponding path program 1 times [2024-10-14 17:13:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:26,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460554643] [2024-10-14 17:13:26,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:26,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:26,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:26,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460554643] [2024-10-14 17:13:26,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460554643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:26,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:26,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:26,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124921948] [2024-10-14 17:13:26,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:26,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:26,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:26,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:26,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:26,188 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 655 [2024-10-14 17:13:26,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 584 transitions, 1313 flow. Second operand has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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-10-14 17:13:26,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:26,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 655 [2024-10-14 17:13:26,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:27,278 INFO L124 PetriNetUnfolderBase]: 369/4945 cut-off events. [2024-10-14 17:13:27,278 INFO L125 PetriNetUnfolderBase]: For 60/84 co-relation queries the response was YES. [2024-10-14 17:13:27,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5814 conditions, 4945 events. 369/4945 cut-off events. For 60/84 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 43310 event pairs, 45 based on Foata normal form. 0/4405 useless extension candidates. Maximal degree in co-relation 5754. Up to 325 conditions per place. [2024-10-14 17:13:27,327 INFO L140 encePairwiseOnDemand]: 649/655 looper letters, 20 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2024-10-14 17:13:27,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 587 transitions, 1368 flow [2024-10-14 17:13:27,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:27,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1889 transitions. [2024-10-14 17:13:27,331 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961323155216285 [2024-10-14 17:13:27,331 INFO L175 Difference]: Start difference. First operand has 587 places, 584 transitions, 1313 flow. Second operand 3 states and 1889 transitions. [2024-10-14 17:13:27,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 587 transitions, 1368 flow [2024-10-14 17:13:27,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 587 transitions, 1364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:27,341 INFO L231 Difference]: Finished difference. Result has 584 places, 582 transitions, 1315 flow [2024-10-14 17:13:27,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1315, PETRI_PLACES=584, PETRI_TRANSITIONS=582} [2024-10-14 17:13:27,342 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -27 predicate places. [2024-10-14 17:13:27,342 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 582 transitions, 1315 flow [2024-10-14 17:13:27,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 623.0) internal successors, (1869), 3 states have internal predecessors, (1869), 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-10-14 17:13:27,343 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:27,343 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:27,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 17:13:27,343 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:27,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:27,344 INFO L85 PathProgramCache]: Analyzing trace with hash -598679417, now seen corresponding path program 1 times [2024-10-14 17:13:27,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:27,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907198893] [2024-10-14 17:13:27,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:27,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:27,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-10-14 17:13:27,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:27,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907198893] [2024-10-14 17:13:27,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907198893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:27,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:27,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:13:27,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571337025] [2024-10-14 17:13:27,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:27,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:13:27,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:27,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:13:27,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:13:28,205 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-10-14 17:13:28,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 582 transitions, 1315 flow. Second operand has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-10-14 17:13:28,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:28,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-10-14 17:13:28,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:29,243 INFO L124 PetriNetUnfolderBase]: 394/4918 cut-off events. [2024-10-14 17:13:29,243 INFO L125 PetriNetUnfolderBase]: For 95/173 co-relation queries the response was YES. [2024-10-14 17:13:29,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6004 conditions, 4918 events. 394/4918 cut-off events. For 95/173 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 44741 event pairs, 108 based on Foata normal form. 8/4389 useless extension candidates. Maximal degree in co-relation 5912. Up to 341 conditions per place. [2024-10-14 17:13:29,305 INFO L140 encePairwiseOnDemand]: 640/655 looper letters, 70 selfloop transitions, 16 changer transitions 0/616 dead transitions. [2024-10-14 17:13:29,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 616 transitions, 1571 flow [2024-10-14 17:13:29,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:13:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 17:13:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6620 transitions. [2024-10-14 17:13:29,313 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9188063844552394 [2024-10-14 17:13:29,313 INFO L175 Difference]: Start difference. First operand has 584 places, 582 transitions, 1315 flow. Second operand 11 states and 6620 transitions. [2024-10-14 17:13:29,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 616 transitions, 1571 flow [2024-10-14 17:13:29,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 616 transitions, 1571 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:13:29,321 INFO L231 Difference]: Finished difference. Result has 597 places, 586 transitions, 1378 flow [2024-10-14 17:13:29,322 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1378, PETRI_PLACES=597, PETRI_TRANSITIONS=586} [2024-10-14 17:13:29,322 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -14 predicate places. [2024-10-14 17:13:29,322 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 586 transitions, 1378 flow [2024-10-14 17:13:29,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-10-14 17:13:29,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:29,328 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, 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-10-14 17:13:29,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 17:13:29,328 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:29,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:29,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1455026926, now seen corresponding path program 1 times [2024-10-14 17:13:29,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:29,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262685884] [2024-10-14 17:13:29,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:29,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:29,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:29,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262685884] [2024-10-14 17:13:29,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262685884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:29,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:29,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:29,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394352710] [2024-10-14 17:13:29,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:29,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:29,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:29,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:29,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 655 [2024-10-14 17:13:29,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 586 transitions, 1378 flow. Second operand has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-10-14 17:13:29,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:29,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 655 [2024-10-14 17:13:29,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:29,856 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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[][471], [Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 683#(= |#race~count2~0| 0), 679#(= |#race~count1~0| 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 752#true, Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, 673#(= |#race~n3~0| 0), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 677#true, Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), 655#(= |#race~n1~0| 0), Black: 681#true, Black: 748#true, Black: 685#true, 775#true, 667#(= |#race~n2~0| 0), Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), 750#(= |#race~get2~0| 0), Black: 697#true]) [2024-10-14 17:13:29,856 INFO L294 olderBase$Statistics]: this new event has 294 ancestors and is not cut-off event [2024-10-14 17:13:29,857 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is not cut-off event [2024-10-14 17:13:29,857 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is not cut-off event [2024-10-14 17:13:29,857 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is not cut-off event [2024-10-14 17:13:29,872 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([1792] thread3EXIT-->L125: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t3~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) 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[][471], [Black: 757#(<= ~n1~0 0), Black: 758#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0)), 687#(= |#race~count3~0| 0), Black: 771#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork0_~i~1 0) (not |thread2Thread1of1ForFork0_#t~short10|)), 683#(= |#race~count2~0| 0), 679#(= |#race~count1~0| 0), Black: 712#(<= ~n1~0 0), Black: 718#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 720#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 726#(and (not |thread1Thread1of1ForFork2_#t~short1|) (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 752#true, Black: 713#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork2_~i~0 0)), 258#L125true, 673#(= |#race~n3~0| 0), Black: 737#(not |thread3Thread1of1ForFork1_#t~short19|), 699#(= |#race~get1~0| 0), Black: 677#true, Black: 742#(not |thread2Thread1of1ForFork0_#t~short10|), 655#(= |#race~n1~0| 0), Black: 681#true, Black: 748#true, Black: 685#true, 667#(= |#race~n2~0| 0), 775#true, Black: 694#(not |thread1Thread1of1ForFork2_#t~short1|), 750#(= |#race~get2~0| 0), Black: 697#true]) [2024-10-14 17:13:29,872 INFO L294 olderBase$Statistics]: this new event has 303 ancestors and is cut-off event [2024-10-14 17:13:29,873 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-10-14 17:13:29,873 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-10-14 17:13:29,873 INFO L297 olderBase$Statistics]: existing Event has 325 ancestors and is cut-off event [2024-10-14 17:13:29,873 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-10-14 17:13:29,897 INFO L124 PetriNetUnfolderBase]: 245/2948 cut-off events. [2024-10-14 17:13:29,897 INFO L125 PetriNetUnfolderBase]: For 111/149 co-relation queries the response was YES. [2024-10-14 17:13:29,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3677 conditions, 2948 events. 245/2948 cut-off events. For 111/149 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 22558 event pairs, 42 based on Foata normal form. 2/2643 useless extension candidates. Maximal degree in co-relation 3580. Up to 210 conditions per place. [2024-10-14 17:13:29,952 INFO L140 encePairwiseOnDemand]: 652/655 looper letters, 14 selfloop transitions, 2 changer transitions 0/587 dead transitions. [2024-10-14 17:13:29,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 598 places, 587 transitions, 1414 flow [2024-10-14 17:13:29,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:29,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-10-14 17:13:29,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9628498727735368 [2024-10-14 17:13:29,955 INFO L175 Difference]: Start difference. First operand has 597 places, 586 transitions, 1378 flow. Second operand 3 states and 1892 transitions. [2024-10-14 17:13:29,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 598 places, 587 transitions, 1414 flow [2024-10-14 17:13:29,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 587 transitions, 1393 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-10-14 17:13:29,963 INFO L231 Difference]: Finished difference. Result has 591 places, 585 transitions, 1359 flow [2024-10-14 17:13:29,963 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=589, 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=1359, PETRI_PLACES=591, PETRI_TRANSITIONS=585} [2024-10-14 17:13:29,964 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -20 predicate places. [2024-10-14 17:13:29,964 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 585 transitions, 1359 flow [2024-10-14 17:13:29,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.0) internal successors, (1881), 3 states have internal predecessors, (1881), 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-10-14 17:13:29,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:29,965 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, 1, 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-10-14 17:13:29,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 17:13:29,965 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:29,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:29,966 INFO L85 PathProgramCache]: Analyzing trace with hash 657299342, now seen corresponding path program 1 times [2024-10-14 17:13:29,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:29,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879834866] [2024-10-14 17:13:29,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:29,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:30,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879834866] [2024-10-14 17:13:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879834866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:30,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:30,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:13:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429618974] [2024-10-14 17:13:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:30,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:13:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:30,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:13:30,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:13:30,704 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-10-14 17:13:30,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 585 transitions, 1359 flow. Second operand has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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-10-14 17:13:30,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:30,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-10-14 17:13:30,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:31,853 INFO L124 PetriNetUnfolderBase]: 517/5084 cut-off events. [2024-10-14 17:13:31,853 INFO L125 PetriNetUnfolderBase]: For 327/495 co-relation queries the response was YES. [2024-10-14 17:13:31,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6820 conditions, 5084 events. 517/5084 cut-off events. For 327/495 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 46594 event pairs, 175 based on Foata normal form. 22/4592 useless extension candidates. Maximal degree in co-relation 6722. Up to 680 conditions per place. [2024-10-14 17:13:31,942 INFO L140 encePairwiseOnDemand]: 640/655 looper letters, 66 selfloop transitions, 16 changer transitions 0/615 dead transitions. [2024-10-14 17:13:31,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 615 transitions, 1599 flow [2024-10-14 17:13:31,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:13:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 17:13:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6611 transitions. [2024-10-14 17:13:31,948 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.917557251908397 [2024-10-14 17:13:31,948 INFO L175 Difference]: Start difference. First operand has 591 places, 585 transitions, 1359 flow. Second operand 11 states and 6611 transitions. [2024-10-14 17:13:31,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 615 transitions, 1599 flow [2024-10-14 17:13:31,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 615 transitions, 1595 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:31,959 INFO L231 Difference]: Finished difference. Result has 604 places, 594 transitions, 1439 flow [2024-10-14 17:13:31,959 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=655, PETRI_DIFFERENCE_MINUEND_FLOW=1355, PETRI_DIFFERENCE_MINUEND_PLACES=589, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=585, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1439, PETRI_PLACES=604, PETRI_TRANSITIONS=594} [2024-10-14 17:13:31,960 INFO L277 CegarLoopForPetriNet]: 611 programPoint places, -7 predicate places. [2024-10-14 17:13:31,960 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 594 transitions, 1439 flow [2024-10-14 17:13:31,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 598.375) internal successors, (4787), 8 states have internal predecessors, (4787), 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-10-14 17:13:31,961 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:31,961 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, 1, 1, 1, 1, 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-10-14 17:13:31,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 17:13:31,962 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-10-14 17:13:31,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:31,962 INFO L85 PathProgramCache]: Analyzing trace with hash -672350260, now seen corresponding path program 1 times [2024-10-14 17:13:31,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:31,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598496586] [2024-10-14 17:13:31,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:31,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:13:32,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:32,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598496586] [2024-10-14 17:13:32,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598496586] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:32,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:32,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 17:13:32,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167734014] [2024-10-14 17:13:32,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:32,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:13:32,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:32,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:13:32,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:13:32,614 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 594 out of 655 [2024-10-14 17:13:32,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 594 transitions, 1439 flow. Second operand has 8 states, 8 states have (on average 598.25) internal successors, (4786), 8 states have internal predecessors, (4786), 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-10-14 17:13:32,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:32,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 594 of 655 [2024-10-14 17:13:32,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand