./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-barrier.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-barrier.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 b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:37:59,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:37:59,305 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:37:59,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:37:59,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:37:59,340 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:37:59,341 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:37:59,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:37:59,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:37:59,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:37:59,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:37:59,343 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:37:59,343 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:37:59,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:37:59,344 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:37:59,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:37:59,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:37:59,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:37:59,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:37:59,346 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:37:59,349 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:37:59,350 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:37:59,350 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:37:59,351 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:37:59,351 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:37:59,351 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:37:59,352 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:37:59,352 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:37:59,352 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:37:59,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:37:59,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:37:59,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:37:59,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:37:59,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:37:59,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:37:59,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:37:59,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:37:59,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:37:59,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:37:59,362 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:37:59,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:37:59,362 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 -> b78dfc9c2705d92d2bcea2c224e1a0e17a9d3d516f404185e5eda6bc0d05a15c [2024-11-10 14:37:59,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:37:59,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:37:59,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:37:59,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:37:59,656 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:37:59,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2024-11-10 14:38:01,103 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:38:01,301 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:38:01,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier.wvr.c [2024-11-10 14:38:01,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/809962d5d/838262171af04043bf7e6c37776c4ce7/FLAG224cbdae7 [2024-11-10 14:38:01,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/809962d5d/838262171af04043bf7e6c37776c4ce7 [2024-11-10 14:38:01,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:38:01,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:38:01,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:38:01,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:38:01,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:38:01,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:38:01" (1/1) ... [2024-11-10 14:38:01,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44276f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:01, skipping insertion in model container [2024-11-10 14:38:01,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:38:01" (1/1) ... [2024-11-10 14:38:01,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:38:01,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:38:01,608 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:38:01,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:38:01,675 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:38:01,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:01 WrapperNode [2024-11-10 14:38:01,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:38:01,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:38:01,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:38:01,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:38:01,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:01" (1/1) ... [2024-11-10 14:38:01,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:01" (1/1) ... [2024-11-10 14:38:01,737 INFO L138 Inliner]: procedures = 22, calls = 21, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 276 [2024-11-10 14:38:01,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:38:01,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:38:01,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:38:01,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:38:01,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:01" (1/1) ... [2024-11-10 14:38:01,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:01" (1/1) ... [2024-11-10 14:38:01,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:01" (1/1) ... [2024-11-10 14:38:01,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:01" (1/1) ... [2024-11-10 14:38:01,773 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:01" (1/1) ... [2024-11-10 14:38:01,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:01" (1/1) ... [2024-11-10 14:38:01,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:01" (1/1) ... [2024-11-10 14:38:01,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:01" (1/1) ... [2024-11-10 14:38:01,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:38:01,789 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:38:01,789 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:38:01,789 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:38:01,790 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:01" (1/1) ... [2024-11-10 14:38:01,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:38:01,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:38:01,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 14:38:01,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 14:38:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:38:01,886 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:38:01,887 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:38:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:38:01,887 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:38:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 14:38:01,887 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 14:38:01,887 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-10 14:38:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-10 14:38:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:38:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-10 14:38:01,888 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-10 14:38:01,888 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-10 14:38:01,889 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-10 14:38:01,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:38:01,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:38:01,890 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:38:01,991 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:38:01,993 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:38:02,337 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:38:02,338 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:38:02,397 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:38:02,397 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:38:02,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:38:02 BoogieIcfgContainer [2024-11-10 14:38:02,398 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:38:02,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:38:02,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:38:02,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:38:02,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:38:01" (1/3) ... [2024-11-10 14:38:02,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c57a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:38:02, skipping insertion in model container [2024-11-10 14:38:02,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:38:01" (2/3) ... [2024-11-10 14:38:02,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c57a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:38:02, skipping insertion in model container [2024-11-10 14:38:02,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:38:02" (3/3) ... [2024-11-10 14:38:02,406 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier.wvr.c [2024-11-10 14:38:02,422 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:38:02,422 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2024-11-10 14:38:02,422 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:38:02,583 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-10 14:38:02,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 336 places, 329 transitions, 724 flow [2024-11-10 14:38:02,852 INFO L124 PetriNetUnfolderBase]: 12/315 cut-off events. [2024-11-10 14:38:02,853 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:38:02,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 315 events. 12/315 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 574 event pairs, 0 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 272. Up to 3 conditions per place. [2024-11-10 14:38:02,868 INFO L82 GeneralOperation]: Start removeDead. Operand has 336 places, 329 transitions, 724 flow [2024-11-10 14:38:02,878 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 306 places, 298 transitions, 641 flow [2024-11-10 14:38:02,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:38:02,899 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;@76cfaf65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:38:02,899 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-10 14:38:02,909 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:38:02,909 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2024-11-10 14:38:02,909 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:38:02,909 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:02,910 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:02,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:02,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:02,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1075409143, now seen corresponding path program 1 times [2024-11-10 14:38:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:02,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99382883] [2024-11-10 14:38:02,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:02,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:03,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:03,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:03,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99382883] [2024-11-10 14:38:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99382883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:03,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:03,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:03,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798552218] [2024-11-10 14:38:03,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:03,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:03,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:03,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:03,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:03,256 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 333 [2024-11-10 14:38:03,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 298 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:03,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:03,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 333 [2024-11-10 14:38:03,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:06,023 INFO L124 PetriNetUnfolderBase]: 3107/13658 cut-off events. [2024-11-10 14:38:06,023 INFO L125 PetriNetUnfolderBase]: For 1713/1713 co-relation queries the response was YES. [2024-11-10 14:38:06,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19870 conditions, 13658 events. 3107/13658 cut-off events. For 1713/1713 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 156638 event pairs, 2737 based on Foata normal form. 802/12245 useless extension candidates. Maximal degree in co-relation 19411. Up to 4387 conditions per place. [2024-11-10 14:38:06,198 INFO L140 encePairwiseOnDemand]: 323/333 looper letters, 42 selfloop transitions, 2 changer transitions 1/290 dead transitions. [2024-11-10 14:38:06,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 290 transitions, 713 flow [2024-11-10 14:38:06,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:06,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:06,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 859 transitions. [2024-11-10 14:38:06,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8598598598598599 [2024-11-10 14:38:06,222 INFO L175 Difference]: Start difference. First operand has 306 places, 298 transitions, 641 flow. Second operand 3 states and 859 transitions. [2024-11-10 14:38:06,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 290 transitions, 713 flow [2024-11-10 14:38:06,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 290 transitions, 684 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-11-10 14:38:06,247 INFO L231 Difference]: Finished difference. Result has 296 places, 289 transitions, 598 flow [2024-11-10 14:38:06,249 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=294, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=598, PETRI_PLACES=296, PETRI_TRANSITIONS=289} [2024-11-10 14:38:06,255 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -10 predicate places. [2024-11-10 14:38:06,255 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 289 transitions, 598 flow [2024-11-10 14:38:06,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:06,257 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:06,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] [2024-11-10 14:38:06,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:38:06,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:06,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:06,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1824396501, now seen corresponding path program 1 times [2024-11-10 14:38:06,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:06,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190760176] [2024-11-10 14:38:06,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:06,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:06,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:06,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190760176] [2024-11-10 14:38:06,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190760176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:06,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:06,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:06,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537281768] [2024-11-10 14:38:06,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:06,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:06,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:06,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:06,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:06,396 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 333 [2024-11-10 14:38:06,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 289 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:06,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:06,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 333 [2024-11-10 14:38:06,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:08,429 INFO L124 PetriNetUnfolderBase]: 3215/13336 cut-off events. [2024-11-10 14:38:08,429 INFO L125 PetriNetUnfolderBase]: For 504/504 co-relation queries the response was YES. [2024-11-10 14:38:08,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18300 conditions, 13336 events. 3215/13336 cut-off events. For 504/504 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 149637 event pairs, 2737 based on Foata normal form. 0/11081 useless extension candidates. Maximal degree in co-relation 18243. Up to 4495 conditions per place. [2024-11-10 14:38:08,550 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 42 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-11-10 14:38:08,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 288 transitions, 684 flow [2024-11-10 14:38:08,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:08,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-11-10 14:38:08,553 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8528528528528528 [2024-11-10 14:38:08,553 INFO L175 Difference]: Start difference. First operand has 296 places, 289 transitions, 598 flow. Second operand 3 states and 852 transitions. [2024-11-10 14:38:08,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 288 transitions, 684 flow [2024-11-10 14:38:08,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 288 transitions, 680 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:08,559 INFO L231 Difference]: Finished difference. Result has 294 places, 288 transitions, 596 flow [2024-11-10 14:38:08,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=294, PETRI_TRANSITIONS=288} [2024-11-10 14:38:08,560 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -12 predicate places. [2024-11-10 14:38:08,560 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 288 transitions, 596 flow [2024-11-10 14:38:08,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 271.6666666666667) internal successors, (815), 3 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:08,561 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:08,561 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:08,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:38:08,562 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:08,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:08,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2004865597, now seen corresponding path program 1 times [2024-11-10 14:38:08,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:08,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661949704] [2024-11-10 14:38:08,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:08,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:08,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:08,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:08,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:08,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661949704] [2024-11-10 14:38:08,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661949704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:08,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:08,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:08,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444804053] [2024-11-10 14:38:08,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:08,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:08,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:08,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:08,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:08,696 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 333 [2024-11-10 14:38:08,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 288 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:08,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:08,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 333 [2024-11-10 14:38:08,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:10,528 INFO L124 PetriNetUnfolderBase]: 3107/12407 cut-off events. [2024-11-10 14:38:10,528 INFO L125 PetriNetUnfolderBase]: For 416/416 co-relation queries the response was YES. [2024-11-10 14:38:10,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17331 conditions, 12407 events. 3107/12407 cut-off events. For 416/416 co-relation queries the response was YES. Maximal size of possible extension queue 330. Compared 137489 event pairs, 2737 based on Foata normal form. 0/10312 useless extension candidates. Maximal degree in co-relation 17266. Up to 4387 conditions per place. [2024-11-10 14:38:10,635 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 42 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2024-11-10 14:38:10,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 287 transitions, 682 flow [2024-11-10 14:38:10,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:10,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-11-10 14:38:10,638 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8528528528528528 [2024-11-10 14:38:10,638 INFO L175 Difference]: Start difference. First operand has 294 places, 288 transitions, 596 flow. Second operand 3 states and 852 transitions. [2024-11-10 14:38:10,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 287 transitions, 682 flow [2024-11-10 14:38:10,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 287 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:10,644 INFO L231 Difference]: Finished difference. Result has 293 places, 287 transitions, 594 flow [2024-11-10 14:38:10,644 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=594, PETRI_PLACES=293, PETRI_TRANSITIONS=287} [2024-11-10 14:38:10,646 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -13 predicate places. [2024-11-10 14:38:10,646 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 287 transitions, 594 flow [2024-11-10 14:38:10,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:10,647 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:10,647 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] [2024-11-10 14:38:10,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:38:10,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:10,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1305207761, now seen corresponding path program 1 times [2024-11-10 14:38:10,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:10,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918948884] [2024-11-10 14:38:10,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:10,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:10,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918948884] [2024-11-10 14:38:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918948884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:10,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:10,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:10,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898458867] [2024-11-10 14:38:10,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:10,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:10,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:10,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:10,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:10,792 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 333 [2024-11-10 14:38:10,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 287 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:10,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:10,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 333 [2024-11-10 14:38:10,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:12,344 INFO L124 PetriNetUnfolderBase]: 3215/11250 cut-off events. [2024-11-10 14:38:12,348 INFO L125 PetriNetUnfolderBase]: For 524/524 co-relation queries the response was YES. [2024-11-10 14:38:12,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16174 conditions, 11250 events. 3215/11250 cut-off events. For 524/524 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 118570 event pairs, 2737 based on Foata normal form. 0/9317 useless extension candidates. Maximal degree in co-relation 16081. Up to 4495 conditions per place. [2024-11-10 14:38:12,457 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 42 selfloop transitions, 2 changer transitions 0/286 dead transitions. [2024-11-10 14:38:12,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 286 transitions, 680 flow [2024-11-10 14:38:12,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2024-11-10 14:38:12,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8528528528528528 [2024-11-10 14:38:12,461 INFO L175 Difference]: Start difference. First operand has 293 places, 287 transitions, 594 flow. Second operand 3 states and 852 transitions. [2024-11-10 14:38:12,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 286 transitions, 680 flow [2024-11-10 14:38:12,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 286 transitions, 676 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:12,468 INFO L231 Difference]: Finished difference. Result has 292 places, 286 transitions, 592 flow [2024-11-10 14:38:12,468 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=292, PETRI_TRANSITIONS=286} [2024-11-10 14:38:12,470 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -14 predicate places. [2024-11-10 14:38:12,471 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 286 transitions, 592 flow [2024-11-10 14:38:12,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:12,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:12,472 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] [2024-11-10 14:38:12,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:38:12,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:12,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:12,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1044795715, now seen corresponding path program 1 times [2024-11-10 14:38:12,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:12,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245518615] [2024-11-10 14:38:12,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:12,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:12,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:12,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:12,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245518615] [2024-11-10 14:38:12,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245518615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:12,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:12,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:12,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600981161] [2024-11-10 14:38:12,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:12,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:12,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:12,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:12,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:12,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2024-11-10 14:38:12,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 286 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:12,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:12,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2024-11-10 14:38:12,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:14,650 INFO L124 PetriNetUnfolderBase]: 4121/17477 cut-off events. [2024-11-10 14:38:14,650 INFO L125 PetriNetUnfolderBase]: For 471/471 co-relation queries the response was YES. [2024-11-10 14:38:14,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24042 conditions, 17477 events. 4121/17477 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 209549 event pairs, 2888 based on Foata normal form. 0/14708 useless extension candidates. Maximal degree in co-relation 23941. Up to 4858 conditions per place. [2024-11-10 14:38:14,783 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 58 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-11-10 14:38:14,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 302 transitions, 753 flow [2024-11-10 14:38:14,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:14,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:14,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2024-11-10 14:38:14,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8748748748748749 [2024-11-10 14:38:14,786 INFO L175 Difference]: Start difference. First operand has 292 places, 286 transitions, 592 flow. Second operand 3 states and 874 transitions. [2024-11-10 14:38:14,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 302 transitions, 753 flow [2024-11-10 14:38:14,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 302 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:14,790 INFO L231 Difference]: Finished difference. Result has 291 places, 285 transitions, 590 flow [2024-11-10 14:38:14,791 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=590, PETRI_PLACES=291, PETRI_TRANSITIONS=285} [2024-11-10 14:38:14,791 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -15 predicate places. [2024-11-10 14:38:14,792 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 285 transitions, 590 flow [2024-11-10 14:38:14,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:14,792 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:14,793 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:14,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:38:14,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:14,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:14,797 INFO L85 PathProgramCache]: Analyzing trace with hash 119509918, now seen corresponding path program 1 times [2024-11-10 14:38:14,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:14,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591443618] [2024-11-10 14:38:14,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:14,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:14,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:14,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591443618] [2024-11-10 14:38:14,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591443618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:14,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:14,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:14,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493713066] [2024-11-10 14:38:14,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:14,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:14,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:14,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:14,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:14,901 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2024-11-10 14:38:14,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 285 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:14,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:14,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2024-11-10 14:38:14,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:16,361 INFO L124 PetriNetUnfolderBase]: 3783/10199 cut-off events. [2024-11-10 14:38:16,362 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2024-11-10 14:38:16,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16375 conditions, 10199 events. 3783/10199 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 97008 event pairs, 846 based on Foata normal form. 0/8547 useless extension candidates. Maximal degree in co-relation 11250. Up to 3963 conditions per place. [2024-11-10 14:38:16,413 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 56 selfloop transitions, 3 changer transitions 0/300 dead transitions. [2024-11-10 14:38:16,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 300 transitions, 747 flow [2024-11-10 14:38:16,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2024-11-10 14:38:16,416 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8748748748748749 [2024-11-10 14:38:16,416 INFO L175 Difference]: Start difference. First operand has 291 places, 285 transitions, 590 flow. Second operand 3 states and 874 transitions. [2024-11-10 14:38:16,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 300 transitions, 747 flow [2024-11-10 14:38:16,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 300 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:16,421 INFO L231 Difference]: Finished difference. Result has 289 places, 283 transitions, 588 flow [2024-11-10 14:38:16,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=289, PETRI_TRANSITIONS=283} [2024-11-10 14:38:16,422 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -17 predicate places. [2024-11-10 14:38:16,422 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 283 transitions, 588 flow [2024-11-10 14:38:16,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 275.6666666666667) internal successors, (827), 3 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:16,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:16,423 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] [2024-11-10 14:38:16,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:38:16,423 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:16,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:16,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1379176041, now seen corresponding path program 1 times [2024-11-10 14:38:16,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:16,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39553469] [2024-11-10 14:38:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:16,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:16,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:16,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39553469] [2024-11-10 14:38:16,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39553469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:16,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:16,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:16,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497244563] [2024-11-10 14:38:16,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:16,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:16,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:16,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:16,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:16,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2024-11-10 14:38:16,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 283 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:16,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:16,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2024-11-10 14:38:16,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:18,051 INFO L124 PetriNetUnfolderBase]: 4310/15324 cut-off events. [2024-11-10 14:38:18,051 INFO L125 PetriNetUnfolderBase]: For 660/660 co-relation queries the response was YES. [2024-11-10 14:38:18,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21936 conditions, 15324 events. 4310/15324 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 171371 event pairs, 3050 based on Foata normal form. 0/12699 useless extension candidates. Maximal degree in co-relation 16648. Up to 4993 conditions per place. [2024-11-10 14:38:18,145 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 59 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2024-11-10 14:38:18,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 300 transitions, 754 flow [2024-11-10 14:38:18,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions. [2024-11-10 14:38:18,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8758758758758759 [2024-11-10 14:38:18,147 INFO L175 Difference]: Start difference. First operand has 289 places, 283 transitions, 588 flow. Second operand 3 states and 875 transitions. [2024-11-10 14:38:18,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 300 transitions, 754 flow [2024-11-10 14:38:18,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 300 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:18,153 INFO L231 Difference]: Finished difference. Result has 288 places, 282 transitions, 584 flow [2024-11-10 14:38:18,153 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=584, PETRI_PLACES=288, PETRI_TRANSITIONS=282} [2024-11-10 14:38:18,154 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -18 predicate places. [2024-11-10 14:38:18,154 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 282 transitions, 584 flow [2024-11-10 14:38:18,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:18,155 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:18,155 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] [2024-11-10 14:38:18,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:38:18,155 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread5Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:18,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:18,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1194086298, now seen corresponding path program 1 times [2024-11-10 14:38:18,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:18,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188770914] [2024-11-10 14:38:18,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:18,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-11-10 14:38:18,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:18,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188770914] [2024-11-10 14:38:18,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188770914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:18,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:18,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:18,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288461566] [2024-11-10 14:38:18,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:18,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:18,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:18,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:18,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:18,238 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2024-11-10 14:38:18,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 282 transitions, 584 flow. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:18,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:18,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2024-11-10 14:38:18,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:20,456 INFO L124 PetriNetUnfolderBase]: 4121/16000 cut-off events. [2024-11-10 14:38:20,456 INFO L125 PetriNetUnfolderBase]: For 506/506 co-relation queries the response was YES. [2024-11-10 14:38:20,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22507 conditions, 16000 events. 4121/16000 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 185785 event pairs, 2888 based on Foata normal form. 0/13446 useless extension candidates. Maximal degree in co-relation 17152. Up to 4858 conditions per place. [2024-11-10 14:38:20,535 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 58 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2024-11-10 14:38:20,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 298 transitions, 744 flow [2024-11-10 14:38:20,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:20,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2024-11-10 14:38:20,537 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8748748748748749 [2024-11-10 14:38:20,537 INFO L175 Difference]: Start difference. First operand has 288 places, 282 transitions, 584 flow. Second operand 3 states and 874 transitions. [2024-11-10 14:38:20,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 298 transitions, 744 flow [2024-11-10 14:38:20,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 298 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:20,542 INFO L231 Difference]: Finished difference. Result has 287 places, 281 transitions, 582 flow [2024-11-10 14:38:20,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=287, PETRI_TRANSITIONS=281} [2024-11-10 14:38:20,543 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -19 predicate places. [2024-11-10 14:38:20,543 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 281 transitions, 582 flow [2024-11-10 14:38:20,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:20,543 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:20,544 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] [2024-11-10 14:38:20,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:38:20,544 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:20,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1376977042, now seen corresponding path program 1 times [2024-11-10 14:38:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104811747] [2024-11-10 14:38:20,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:20,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:20,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104811747] [2024-11-10 14:38:20,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104811747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:20,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:20,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:20,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946847826] [2024-11-10 14:38:20,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:20,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:20,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:20,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:20,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:20,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2024-11-10 14:38:20,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 281 transitions, 582 flow. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:20,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:20,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2024-11-10 14:38:20,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:21,757 INFO L124 PetriNetUnfolderBase]: 3945/11033 cut-off events. [2024-11-10 14:38:21,757 INFO L125 PetriNetUnfolderBase]: For 608/608 co-relation queries the response was YES. [2024-11-10 14:38:21,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17073 conditions, 11033 events. 3945/11033 cut-off events. For 608/608 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 106739 event pairs, 1091 based on Foata normal form. 0/9195 useless extension candidates. Maximal degree in co-relation 12725. Up to 3671 conditions per place. [2024-11-10 14:38:21,830 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 57 selfloop transitions, 3 changer transitions 0/297 dead transitions. [2024-11-10 14:38:21,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 297 transitions, 744 flow [2024-11-10 14:38:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:21,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions. [2024-11-10 14:38:21,832 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8758758758758759 [2024-11-10 14:38:21,833 INFO L175 Difference]: Start difference. First operand has 287 places, 281 transitions, 582 flow. Second operand 3 states and 875 transitions. [2024-11-10 14:38:21,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 297 transitions, 744 flow [2024-11-10 14:38:21,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 297 transitions, 740 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:21,836 INFO L231 Difference]: Finished difference. Result has 285 places, 279 transitions, 580 flow [2024-11-10 14:38:21,837 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=580, PETRI_PLACES=285, PETRI_TRANSITIONS=279} [2024-11-10 14:38:21,837 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -21 predicate places. [2024-11-10 14:38:21,838 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 279 transitions, 580 flow [2024-11-10 14:38:21,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:21,838 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:21,838 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] [2024-11-10 14:38:21,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:38:21,839 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread5Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:21,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:21,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2105006512, now seen corresponding path program 1 times [2024-11-10 14:38:21,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:21,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808859841] [2024-11-10 14:38:21,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:21,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:21,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:21,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808859841] [2024-11-10 14:38:21,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808859841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:21,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:21,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:21,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951658896] [2024-11-10 14:38:21,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:21,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:21,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:21,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:21,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:21,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2024-11-10 14:38:21,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 279 transitions, 580 flow. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:21,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:21,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2024-11-10 14:38:21,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:23,395 INFO L124 PetriNetUnfolderBase]: 3783/11485 cut-off events. [2024-11-10 14:38:23,396 INFO L125 PetriNetUnfolderBase]: For 449/449 co-relation queries the response was YES. [2024-11-10 14:38:23,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17571 conditions, 11485 events. 3783/11485 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 116615 event pairs, 1156 based on Foata normal form. 0/9835 useless extension candidates. Maximal degree in co-relation 13208. Up to 3892 conditions per place. [2024-11-10 14:38:23,448 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 56 selfloop transitions, 3 changer transitions 0/294 dead transitions. [2024-11-10 14:38:23,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 294 transitions, 736 flow [2024-11-10 14:38:23,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:23,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2024-11-10 14:38:23,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8748748748748749 [2024-11-10 14:38:23,450 INFO L175 Difference]: Start difference. First operand has 285 places, 279 transitions, 580 flow. Second operand 3 states and 874 transitions. [2024-11-10 14:38:23,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 294 transitions, 736 flow [2024-11-10 14:38:23,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 294 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:23,454 INFO L231 Difference]: Finished difference. Result has 283 places, 277 transitions, 576 flow [2024-11-10 14:38:23,454 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=283, PETRI_TRANSITIONS=277} [2024-11-10 14:38:23,454 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -23 predicate places. [2024-11-10 14:38:23,455 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 277 transitions, 576 flow [2024-11-10 14:38:23,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:23,455 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:23,455 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] [2024-11-10 14:38:23,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:38:23,456 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread6Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:23,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:23,456 INFO L85 PathProgramCache]: Analyzing trace with hash -335058583, now seen corresponding path program 1 times [2024-11-10 14:38:23,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:23,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932350088] [2024-11-10 14:38:23,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:23,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:23,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:23,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932350088] [2024-11-10 14:38:23,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932350088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:23,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:23,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:23,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401830104] [2024-11-10 14:38:23,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:23,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:23,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:23,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:23,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:23,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2024-11-10 14:38:23,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 277 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:23,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:23,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2024-11-10 14:38:23,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:24,751 INFO L124 PetriNetUnfolderBase]: 4310/11722 cut-off events. [2024-11-10 14:38:24,752 INFO L125 PetriNetUnfolderBase]: For 695/695 co-relation queries the response was YES. [2024-11-10 14:38:24,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18436 conditions, 11722 events. 4310/11722 cut-off events. For 695/695 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 114325 event pairs, 3050 based on Foata normal form. 0/9795 useless extension candidates. Maximal degree in co-relation 13915. Up to 4993 conditions per place. [2024-11-10 14:38:24,823 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 59 selfloop transitions, 2 changer transitions 0/294 dead transitions. [2024-11-10 14:38:24,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 294 transitions, 741 flow [2024-11-10 14:38:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:24,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions. [2024-11-10 14:38:24,825 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8758758758758759 [2024-11-10 14:38:24,825 INFO L175 Difference]: Start difference. First operand has 283 places, 277 transitions, 576 flow. Second operand 3 states and 875 transitions. [2024-11-10 14:38:24,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 294 transitions, 741 flow [2024-11-10 14:38:24,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 294 transitions, 735 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:24,834 INFO L231 Difference]: Finished difference. Result has 282 places, 276 transitions, 572 flow [2024-11-10 14:38:24,834 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=282, PETRI_TRANSITIONS=276} [2024-11-10 14:38:24,835 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -24 predicate places. [2024-11-10 14:38:24,835 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 276 transitions, 572 flow [2024-11-10 14:38:24,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:24,836 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:24,836 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:24,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:38:24,836 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:24,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:24,837 INFO L85 PathProgramCache]: Analyzing trace with hash 195773733, now seen corresponding path program 1 times [2024-11-10 14:38:24,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:24,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221336582] [2024-11-10 14:38:24,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:24,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:24,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:24,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:24,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221336582] [2024-11-10 14:38:24,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221336582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:24,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:24,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:24,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291026587] [2024-11-10 14:38:24,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:24,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:24,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:24,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:24,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:24,904 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2024-11-10 14:38:24,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 276 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:24,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:24,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2024-11-10 14:38:24,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:26,644 INFO L124 PetriNetUnfolderBase]: 4121/13882 cut-off events. [2024-11-10 14:38:26,645 INFO L125 PetriNetUnfolderBase]: For 455/455 co-relation queries the response was YES. [2024-11-10 14:38:26,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20497 conditions, 13882 events. 4121/13882 cut-off events. For 455/455 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 151440 event pairs, 3050 based on Foata normal form. 0/11829 useless extension candidates. Maximal degree in co-relation 14228. Up to 4858 conditions per place. [2024-11-10 14:38:26,734 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 58 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2024-11-10 14:38:26,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 292 transitions, 733 flow [2024-11-10 14:38:26,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:26,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions. [2024-11-10 14:38:26,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8748748748748749 [2024-11-10 14:38:26,737 INFO L175 Difference]: Start difference. First operand has 282 places, 276 transitions, 572 flow. Second operand 3 states and 874 transitions. [2024-11-10 14:38:26,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 292 transitions, 733 flow [2024-11-10 14:38:26,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 292 transitions, 729 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:26,744 INFO L231 Difference]: Finished difference. Result has 281 places, 275 transitions, 570 flow [2024-11-10 14:38:26,744 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=281, PETRI_TRANSITIONS=275} [2024-11-10 14:38:26,745 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -25 predicate places. [2024-11-10 14:38:26,745 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 275 transitions, 570 flow [2024-11-10 14:38:26,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.0) internal successors, (831), 3 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:26,746 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:26,746 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:26,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:38:26,747 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread6Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:26,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:26,747 INFO L85 PathProgramCache]: Analyzing trace with hash -225466739, now seen corresponding path program 1 times [2024-11-10 14:38:26,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:26,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542514750] [2024-11-10 14:38:26,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:26,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:26,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-11-10 14:38:26,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:26,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542514750] [2024-11-10 14:38:26,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542514750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:26,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:26,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:26,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423030690] [2024-11-10 14:38:26,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:26,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:26,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:26,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:26,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:26,824 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2024-11-10 14:38:26,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 275 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:26,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:26,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2024-11-10 14:38:26,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:28,246 INFO L124 PetriNetUnfolderBase]: 3945/10611 cut-off events. [2024-11-10 14:38:28,246 INFO L125 PetriNetUnfolderBase]: For 638/638 co-relation queries the response was YES. [2024-11-10 14:38:28,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16621 conditions, 10611 events. 3945/10611 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 100363 event pairs, 1131 based on Foata normal form. 0/9098 useless extension candidates. Maximal degree in co-relation 12507. Up to 3600 conditions per place. [2024-11-10 14:38:28,309 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 57 selfloop transitions, 3 changer transitions 0/291 dead transitions. [2024-11-10 14:38:28,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 291 transitions, 731 flow [2024-11-10 14:38:28,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions. [2024-11-10 14:38:28,311 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8758758758758759 [2024-11-10 14:38:28,311 INFO L175 Difference]: Start difference. First operand has 281 places, 275 transitions, 570 flow. Second operand 3 states and 875 transitions. [2024-11-10 14:38:28,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 291 transitions, 731 flow [2024-11-10 14:38:28,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 291 transitions, 727 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:28,316 INFO L231 Difference]: Finished difference. Result has 279 places, 273 transitions, 568 flow [2024-11-10 14:38:28,316 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=279, PETRI_TRANSITIONS=273} [2024-11-10 14:38:28,317 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -27 predicate places. [2024-11-10 14:38:28,317 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 273 transitions, 568 flow [2024-11-10 14:38:28,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:28,318 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:28,318 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] [2024-11-10 14:38:28,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:38:28,318 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:28,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1818231783, now seen corresponding path program 1 times [2024-11-10 14:38:28,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:28,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611278793] [2024-11-10 14:38:28,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:28,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:28,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:28,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:28,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611278793] [2024-11-10 14:38:28,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611278793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:28,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:28,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:28,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114832023] [2024-11-10 14:38:28,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:28,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:28,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:28,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:28,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:28,386 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2024-11-10 14:38:28,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 273 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:28,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:28,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2024-11-10 14:38:28,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:30,153 INFO L124 PetriNetUnfolderBase]: 4310/12771 cut-off events. [2024-11-10 14:38:30,154 INFO L125 PetriNetUnfolderBase]: For 660/660 co-relation queries the response was YES. [2024-11-10 14:38:30,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19716 conditions, 12771 events. 4310/12771 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 131318 event pairs, 3050 based on Foata normal form. 0/11024 useless extension candidates. Maximal degree in co-relation 14794. Up to 4993 conditions per place. [2024-11-10 14:38:30,228 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 55 selfloop transitions, 2 changer transitions 6/290 dead transitions. [2024-11-10 14:38:30,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 290 transitions, 734 flow [2024-11-10 14:38:30,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 875 transitions. [2024-11-10 14:38:30,231 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8758758758758759 [2024-11-10 14:38:30,231 INFO L175 Difference]: Start difference. First operand has 279 places, 273 transitions, 568 flow. Second operand 3 states and 875 transitions. [2024-11-10 14:38:30,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 290 transitions, 734 flow [2024-11-10 14:38:30,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 290 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:30,237 INFO L231 Difference]: Finished difference. Result has 278 places, 268 transitions, 554 flow [2024-11-10 14:38:30,237 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=278, PETRI_TRANSITIONS=268} [2024-11-10 14:38:30,238 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -28 predicate places. [2024-11-10 14:38:30,238 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 268 transitions, 554 flow [2024-11-10 14:38:30,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:30,238 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:30,238 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] [2024-11-10 14:38:30,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:38:30,239 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread5Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:30,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:30,239 INFO L85 PathProgramCache]: Analyzing trace with hash -887391977, now seen corresponding path program 1 times [2024-11-10 14:38:30,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:30,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939073707] [2024-11-10 14:38:30,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:30,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:30,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:30,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:30,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939073707] [2024-11-10 14:38:30,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939073707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:30,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:30,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:30,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720802396] [2024-11-10 14:38:30,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:30,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:30,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:30,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:30,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:30,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2024-11-10 14:38:30,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 268 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:30,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:30,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2024-11-10 14:38:30,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:31,828 INFO L124 PetriNetUnfolderBase]: 4048/11520 cut-off events. [2024-11-10 14:38:31,828 INFO L125 PetriNetUnfolderBase]: For 473/473 co-relation queries the response was YES. [2024-11-10 14:38:31,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18048 conditions, 11520 events. 4048/11520 cut-off events. For 473/473 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 116212 event pairs, 3009 based on Foata normal form. 0/10131 useless extension candidates. Maximal degree in co-relation 13640. Up to 4758 conditions per place. [2024-11-10 14:38:31,897 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 54 selfloop transitions, 2 changer transitions 4/284 dead transitions. [2024-11-10 14:38:31,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 284 transitions, 710 flow [2024-11-10 14:38:31,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2024-11-10 14:38:31,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8728728728728729 [2024-11-10 14:38:31,900 INFO L175 Difference]: Start difference. First operand has 278 places, 268 transitions, 554 flow. Second operand 3 states and 872 transitions. [2024-11-10 14:38:31,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 284 transitions, 710 flow [2024-11-10 14:38:31,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 284 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:31,906 INFO L231 Difference]: Finished difference. Result has 274 places, 264 transitions, 546 flow [2024-11-10 14:38:31,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=546, PETRI_PLACES=274, PETRI_TRANSITIONS=264} [2024-11-10 14:38:31,907 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -32 predicate places. [2024-11-10 14:38:31,907 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 264 transitions, 546 flow [2024-11-10 14:38:31,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:31,908 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:31,908 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] [2024-11-10 14:38:31,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:38:31,908 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread6Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-11-10 14:38:31,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:31,909 INFO L85 PathProgramCache]: Analyzing trace with hash 922525140, now seen corresponding path program 1 times [2024-11-10 14:38:31,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:31,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014441983] [2024-11-10 14:38:31,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:31,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:31,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:31,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:31,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014441983] [2024-11-10 14:38:31,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014441983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:31,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:31,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:31,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700228947] [2024-11-10 14:38:31,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:31,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:31,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:31,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:31,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:31,991 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 333 [2024-11-10 14:38:31,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 264 transitions, 546 flow. Second operand has 3 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:31,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:31,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 333 [2024-11-10 14:38:31,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:33,368 INFO L124 PetriNetUnfolderBase]: 3872/10643 cut-off events. [2024-11-10 14:38:33,369 INFO L125 PetriNetUnfolderBase]: For 605/605 co-relation queries the response was YES. [2024-11-10 14:38:33,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16776 conditions, 10643 events. 3872/10643 cut-off events. For 605/605 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 103762 event pairs, 2696 based on Foata normal form. 0/9319 useless extension candidates. Maximal degree in co-relation 12652. Up to 4393 conditions per place. [2024-11-10 14:38:33,402 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 0 selfloop transitions, 0 changer transitions 281/281 dead transitions. [2024-11-10 14:38:33,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 281 transitions, 705 flow [2024-11-10 14:38:33,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:33,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:33,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions. [2024-11-10 14:38:33,405 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8728728728728729 [2024-11-10 14:38:33,405 INFO L175 Difference]: Start difference. First operand has 274 places, 264 transitions, 546 flow. Second operand 3 states and 872 transitions. [2024-11-10 14:38:33,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 281 transitions, 705 flow [2024-11-10 14:38:33,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 281 transitions, 701 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:33,412 INFO L231 Difference]: Finished difference. Result has 270 places, 0 transitions, 0 flow [2024-11-10 14:38:33,413 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=270, PETRI_TRANSITIONS=0} [2024-11-10 14:38:33,413 INFO L277 CegarLoopForPetriNet]: 306 programPoint places, -36 predicate places. [2024-11-10 14:38:33,413 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 0 transitions, 0 flow [2024-11-10 14:38:33,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.6666666666667) internal successors, (833), 3 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:38:33,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 46 remaining) [2024-11-10 14:38:33,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 46 remaining) [2024-11-10 14:38:33,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2024-11-10 14:38:33,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2024-11-10 14:38:33,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2024-11-10 14:38:33,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2024-11-10 14:38:33,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2024-11-10 14:38:33,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2024-11-10 14:38:33,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2024-11-10 14:38:33,417 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2024-11-10 14:38:33,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2024-11-10 14:38:33,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2024-11-10 14:38:33,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2024-11-10 14:38:33,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2024-11-10 14:38:33,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 46 remaining) [2024-11-10 14:38:33,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 46 remaining) [2024-11-10 14:38:33,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 46 remaining) [2024-11-10 14:38:33,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 46 remaining) [2024-11-10 14:38:33,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2024-11-10 14:38:33,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2024-11-10 14:38:33,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2024-11-10 14:38:33,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2024-11-10 14:38:33,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2024-11-10 14:38:33,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2024-11-10 14:38:33,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2024-11-10 14:38:33,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2024-11-10 14:38:33,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork5Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 46 remaining) [2024-11-10 14:38:33,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork5Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 46 remaining) [2024-11-10 14:38:33,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 46 remaining) [2024-11-10 14:38:33,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (16 of 46 remaining) [2024-11-10 14:38:33,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2024-11-10 14:38:33,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2024-11-10 14:38:33,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2024-11-10 14:38:33,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2024-11-10 14:38:33,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2024-11-10 14:38:33,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2024-11-10 14:38:33,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork2Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 46 remaining) [2024-11-10 14:38:33,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork2Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 46 remaining) [2024-11-10 14:38:33,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2024-11-10 14:38:33,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2024-11-10 14:38:33,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2024-11-10 14:38:33,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2024-11-10 14:38:33,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2024-11-10 14:38:33,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2024-11-10 14:38:33,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2024-11-10 14:38:33,421 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2024-11-10 14:38:33,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:38:33,421 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:33,426 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:38:33,426 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:38:33,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:38:33 BasicIcfg [2024-11-10 14:38:33,430 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:38:33,431 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:38:33,431 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:38:33,431 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:38:33,431 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:38:02" (3/4) ... [2024-11-10 14:38:33,433 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:38:33,436 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:38:33,436 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:38:33,436 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-10 14:38:33,436 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-10 14:38:33,436 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread5 [2024-11-10 14:38:33,437 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread6 [2024-11-10 14:38:33,439 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 14:38:33,440 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:38:33,440 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-11-10 14:38:33,440 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:38:33,515 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:38:33,515 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:38:33,516 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:38:33,517 INFO L158 Benchmark]: Toolchain (without parser) took 32193.39ms. Allocated memory was 169.9MB in the beginning and 13.3GB in the end (delta: 13.1GB). Free memory was 115.4MB in the beginning and 11.1GB in the end (delta: -10.9GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-11-10 14:38:33,517 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 169.9MB. Free memory is still 137.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:38:33,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.05ms. Allocated memory is still 169.9MB. Free memory was 115.4MB in the beginning and 100.3MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 14:38:33,517 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.48ms. Allocated memory is still 169.9MB. Free memory was 100.3MB in the beginning and 97.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:38:33,518 INFO L158 Benchmark]: Boogie Preprocessor took 49.85ms. Allocated memory is still 169.9MB. Free memory was 97.7MB in the beginning and 96.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:38:33,518 INFO L158 Benchmark]: IcfgBuilder took 609.54ms. Allocated memory is still 169.9MB. Free memory was 96.1MB in the beginning and 70.4MB in the end (delta: 25.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 14:38:33,518 INFO L158 Benchmark]: TraceAbstraction took 31030.32ms. Allocated memory was 169.9MB in the beginning and 13.3GB in the end (delta: 13.1GB). Free memory was 69.6MB in the beginning and 11.1GB in the end (delta: -11.0GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. [2024-11-10 14:38:33,518 INFO L158 Benchmark]: Witness Printer took 84.91ms. Allocated memory is still 13.3GB. Free memory was 11.1GB in the beginning and 11.1GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:38:33,520 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 169.9MB. Free memory is still 137.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.05ms. Allocated memory is still 169.9MB. Free memory was 115.4MB in the beginning and 100.3MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.48ms. Allocated memory is still 169.9MB. Free memory was 100.3MB in the beginning and 97.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.85ms. Allocated memory is still 169.9MB. Free memory was 97.7MB in the beginning and 96.1MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 609.54ms. Allocated memory is still 169.9MB. Free memory was 96.1MB in the beginning and 70.4MB in the end (delta: 25.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 31030.32ms. Allocated memory was 169.9MB in the beginning and 13.3GB in the end (delta: 13.1GB). Free memory was 69.6MB in the beginning and 11.1GB in the end (delta: -11.0GB). Peak memory consumption was 2.4GB. Max. memory is 16.1GB. * Witness Printer took 84.91ms. Allocated memory is still 13.3GB. Free memory was 11.1GB in the beginning and 11.1GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 502 locations, 46 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 703 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 372 mSDsluCounter, 96 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1698 IncrementalHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 96 mSDtfsCounter, 1698 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=641occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1784 NumberOfCodeBlocks, 1784 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 1800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:38:33,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE