./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-barrier-loop.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 a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:38:15,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:38:15,356 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:38:15,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:38:15,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:38:15,392 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:38:15,393 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:38:15,393 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:38:15,394 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:38:15,395 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:38:15,396 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:38:15,396 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:38:15,396 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:38:15,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:38:15,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:38:15,398 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:38:15,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:38:15,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:38:15,402 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:38:15,402 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:38:15,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:38:15,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:38:15,403 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:38:15,403 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:38:15,403 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:38:15,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:38:15,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:38:15,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:38:15,404 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:38:15,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:38:15,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:38:15,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:38:15,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:38:15,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:38:15,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:38:15,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:38:15,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:38:15,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:38:15,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:38:15,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:38:15,408 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:38:15,408 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 -> a107795e01eed1ee79fba30cb5022ee32b5d5a3711e8a094ab0bb165fd3efa7a [2024-11-12 12:38:15,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:38:15,673 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:38:15,676 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:38:15,677 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:38:15,678 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:38:15,679 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2024-11-12 12:38:17,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:38:17,340 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:38:17,341 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-barrier-loop.wvr.c [2024-11-12 12:38:17,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232519053/cec5c55d096a4603a502e3aca5fad208/FLAGa7879f949 [2024-11-12 12:38:17,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/232519053/cec5c55d096a4603a502e3aca5fad208 [2024-11-12 12:38:17,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:38:17,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:38:17,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:38:17,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:38:17,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:38:17,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:38:17" (1/1) ... [2024-11-12 12:38:17,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee4bbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:38:17, skipping insertion in model container [2024-11-12 12:38:17,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:38:17" (1/1) ... [2024-11-12 12:38:17,776 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:38:17,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:38:18,006 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:38:18,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:38:18,082 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:38:18,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:38:18 WrapperNode [2024-11-12 12:38:18,083 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:38:18,084 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:38:18,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:38:18,085 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:38:18,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:38:18" (1/1) ... [2024-11-12 12:38:18,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:38:18" (1/1) ... [2024-11-12 12:38:18,142 INFO L138 Inliner]: procedures = 22, calls = 23, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 309 [2024-11-12 12:38:18,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:38:18,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:38:18,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:38:18,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:38:18,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:38:18" (1/1) ... [2024-11-12 12:38:18,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:38:18" (1/1) ... [2024-11-12 12:38:18,157 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:38:18" (1/1) ... [2024-11-12 12:38:18,158 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:38:18" (1/1) ... [2024-11-12 12:38:18,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:38:18" (1/1) ... [2024-11-12 12:38:18,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:38:18" (1/1) ... [2024-11-12 12:38:18,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:38:18" (1/1) ... [2024-11-12 12:38:18,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:38:18" (1/1) ... [2024-11-12 12:38:18,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:38:18,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:38:18,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:38:18,196 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:38:18,196 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:38:18" (1/1) ... [2024-11-12 12:38:18,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:38:18,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:38:18,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:38:18,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:38:18,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:38:18,282 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 12:38:18,282 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 12:38:18,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 12:38:18,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 12:38:18,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-12 12:38:18,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-12 12:38:18,283 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-12 12:38:18,283 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-12 12:38:18,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:38:18,284 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-12 12:38:18,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-12 12:38:18,284 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-12 12:38:18,284 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-12 12:38:18,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:38:18,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:38:18,286 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:38:18,387 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:38:18,389 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:38:18,863 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:38:18,863 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:38:18,895 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:38:18,896 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-12 12:38:18,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:38:18 BoogieIcfgContainer [2024-11-12 12:38:18,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:38:18,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:38:18,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:38:18,904 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:38:18,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:38:17" (1/3) ... [2024-11-12 12:38:18,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbdbe72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:38:18, skipping insertion in model container [2024-11-12 12:38:18,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:38:18" (2/3) ... [2024-11-12 12:38:18,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bbdbe72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:38:18, skipping insertion in model container [2024-11-12 12:38:18,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:38:18" (3/3) ... [2024-11-12 12:38:18,907 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2024-11-12 12:38:18,926 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:38:18,927 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-12 12:38:18,927 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:38:19,072 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-12 12:38:19,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 405 places, 408 transitions, 882 flow [2024-11-12 12:38:19,288 INFO L124 PetriNetUnfolderBase]: 22/394 cut-off events. [2024-11-12 12:38:19,291 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-12 12:38:19,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 394 events. 22/394 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 925 event pairs, 0 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 335. Up to 3 conditions per place. [2024-11-12 12:38:19,306 INFO L82 GeneralOperation]: Start removeDead. Operand has 405 places, 408 transitions, 882 flow [2024-11-12 12:38:19,316 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 375 places, 377 transitions, 799 flow [2024-11-12 12:38:19,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:38:19,335 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;@68a82bda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:38:19,336 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-12 12:38:19,359 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:38:19,360 INFO L124 PetriNetUnfolderBase]: 0/42 cut-off events. [2024-11-12 12:38:19,360 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:38:19,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:19,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:19,362 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:19,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash 684120472, now seen corresponding path program 1 times [2024-11-12 12:38:19,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:19,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897053226] [2024-11-12 12:38:19,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:19,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:19,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:19,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:19,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897053226] [2024-11-12 12:38:19,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897053226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:19,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:19,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:19,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495875704] [2024-11-12 12:38:19,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:19,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:19,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:19,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:19,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:19,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-12 12:38:19,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 377 transitions, 799 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:19,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:19,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-12 12:38:19,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:20,215 INFO L124 PetriNetUnfolderBase]: 116/1711 cut-off events. [2024-11-12 12:38:20,215 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2024-11-12 12:38:20,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 1711 events. 116/1711 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12312 event pairs, 56 based on Foata normal form. 157/1625 useless extension candidates. Maximal degree in co-relation 1869. Up to 151 conditions per place. [2024-11-12 12:38:20,250 INFO L140 encePairwiseOnDemand]: 396/412 looper letters, 20 selfloop transitions, 2 changer transitions 1/363 dead transitions. [2024-11-12 12:38:20,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 363 transitions, 815 flow [2024-11-12 12:38:20,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-12 12:38:20,273 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-12 12:38:20,277 INFO L175 Difference]: Start difference. First operand has 375 places, 377 transitions, 799 flow. Second operand 3 states and 1128 transitions. [2024-11-12 12:38:20,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 363 transitions, 815 flow [2024-11-12 12:38:20,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 363 transitions, 786 flow, removed 0 selfloop flow, removed 11 redundant places. [2024-11-12 12:38:20,296 INFO L231 Difference]: Finished difference. Result has 365 places, 362 transitions, 744 flow [2024-11-12 12:38:20,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=365, PETRI_TRANSITIONS=362} [2024-11-12 12:38:20,306 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -10 predicate places. [2024-11-12 12:38:20,306 INFO L471 AbstractCegarLoop]: Abstraction has has 365 places, 362 transitions, 744 flow [2024-11-12 12:38:20,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:20,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:20,309 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:20,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:38:20,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:20,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:20,311 INFO L85 PathProgramCache]: Analyzing trace with hash 2031107495, now seen corresponding path program 1 times [2024-11-12 12:38:20,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:20,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655553030] [2024-11-12 12:38:20,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:20,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:20,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655553030] [2024-11-12 12:38:20,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655553030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:20,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:20,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:20,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093690218] [2024-11-12 12:38:20,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:20,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:20,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:20,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:20,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:20,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-12 12:38:20,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 362 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:20,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:20,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-12 12:38:20,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:20,812 INFO L124 PetriNetUnfolderBase]: 116/1709 cut-off events. [2024-11-12 12:38:20,813 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-12 12:38:20,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1929 conditions, 1709 events. 116/1709 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 11696 event pairs, 56 based on Foata normal form. 0/1464 useless extension candidates. Maximal degree in co-relation 1878. Up to 151 conditions per place. [2024-11-12 12:38:20,839 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-12 12:38:20,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 361 transitions, 786 flow [2024-11-12 12:38:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-12 12:38:20,843 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-12 12:38:20,843 INFO L175 Difference]: Start difference. First operand has 365 places, 362 transitions, 744 flow. Second operand 3 states and 1115 transitions. [2024-11-12 12:38:20,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 361 transitions, 786 flow [2024-11-12 12:38:20,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 361 transitions, 782 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:20,853 INFO L231 Difference]: Finished difference. Result has 363 places, 361 transitions, 742 flow [2024-11-12 12:38:20,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=742, PETRI_PLACES=363, PETRI_TRANSITIONS=361} [2024-11-12 12:38:20,855 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -12 predicate places. [2024-11-12 12:38:20,855 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 361 transitions, 742 flow [2024-11-12 12:38:20,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:20,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:20,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:20,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:38:20,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:20,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:20,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1682370515, now seen corresponding path program 1 times [2024-11-12 12:38:20,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:20,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163141929] [2024-11-12 12:38:20,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:20,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:20,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:20,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163141929] [2024-11-12 12:38:20,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163141929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:20,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:20,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:20,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509012612] [2024-11-12 12:38:20,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:20,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:20,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:20,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:20,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:20,972 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-12 12:38:20,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 361 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:20,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:20,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-12 12:38:20,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:21,253 INFO L124 PetriNetUnfolderBase]: 116/1156 cut-off events. [2024-11-12 12:38:21,255 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-12 12:38:21,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 1156 events. 116/1156 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6980 event pairs, 56 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 1318. Up to 163 conditions per place. [2024-11-12 12:38:21,272 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-12 12:38:21,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 360 transitions, 784 flow [2024-11-12 12:38:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-12 12:38:21,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-12 12:38:21,275 INFO L175 Difference]: Start difference. First operand has 363 places, 361 transitions, 742 flow. Second operand 3 states and 1115 transitions. [2024-11-12 12:38:21,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 360 transitions, 784 flow [2024-11-12 12:38:21,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 360 transitions, 780 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:21,281 INFO L231 Difference]: Finished difference. Result has 362 places, 360 transitions, 740 flow [2024-11-12 12:38:21,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=362, PETRI_TRANSITIONS=360} [2024-11-12 12:38:21,283 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -13 predicate places. [2024-11-12 12:38:21,283 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 360 transitions, 740 flow [2024-11-12 12:38:21,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:21,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:21,285 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:21,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:38:21,285 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:21,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:21,286 INFO L85 PathProgramCache]: Analyzing trace with hash 510584919, now seen corresponding path program 1 times [2024-11-12 12:38:21,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:21,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091593702] [2024-11-12 12:38:21,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:21,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:21,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:21,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:21,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091593702] [2024-11-12 12:38:21,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091593702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:21,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:21,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:21,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223364862] [2024-11-12 12:38:21,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:21,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:21,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:21,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:21,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:21,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-12 12:38:21,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 360 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:21,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:21,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-12 12:38:21,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:21,613 INFO L124 PetriNetUnfolderBase]: 116/1155 cut-off events. [2024-11-12 12:38:21,613 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-12 12:38:21,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1375 conditions, 1155 events. 116/1155 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6823 event pairs, 56 based on Foata normal form. 0/987 useless extension candidates. Maximal degree in co-relation 1310. Up to 163 conditions per place. [2024-11-12 12:38:21,631 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2024-11-12 12:38:21,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 359 transitions, 782 flow [2024-11-12 12:38:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:21,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-12 12:38:21,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-12 12:38:21,636 INFO L175 Difference]: Start difference. First operand has 362 places, 360 transitions, 740 flow. Second operand 3 states and 1115 transitions. [2024-11-12 12:38:21,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 359 transitions, 782 flow [2024-11-12 12:38:21,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 359 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:21,641 INFO L231 Difference]: Finished difference. Result has 361 places, 359 transitions, 738 flow [2024-11-12 12:38:21,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=361, PETRI_TRANSITIONS=359} [2024-11-12 12:38:21,644 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -14 predicate places. [2024-11-12 12:38:21,644 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 359 transitions, 738 flow [2024-11-12 12:38:21,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:21,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:21,646 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:21,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:38:21,647 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:21,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:21,648 INFO L85 PathProgramCache]: Analyzing trace with hash -315095758, now seen corresponding path program 1 times [2024-11-12 12:38:21,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:21,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224015175] [2024-11-12 12:38:21,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:21,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:21,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:21,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224015175] [2024-11-12 12:38:21,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224015175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:21,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:21,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411153135] [2024-11-12 12:38:21,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:21,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:21,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:21,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:21,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:21,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-12 12:38:21,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 359 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:21,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:21,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-12 12:38:21,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:22,011 INFO L124 PetriNetUnfolderBase]: 110/1386 cut-off events. [2024-11-12 12:38:22,011 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-12 12:38:22,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 1386 events. 110/1386 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8907 event pairs, 56 based on Foata normal form. 0/1188 useless extension candidates. Maximal degree in co-relation 1526. Up to 151 conditions per place. [2024-11-12 12:38:22,039 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-12 12:38:22,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 358 transitions, 780 flow [2024-11-12 12:38:22,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-12 12:38:22,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-12 12:38:22,043 INFO L175 Difference]: Start difference. First operand has 361 places, 359 transitions, 738 flow. Second operand 3 states and 1115 transitions. [2024-11-12 12:38:22,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 358 transitions, 780 flow [2024-11-12 12:38:22,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 358 transitions, 776 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:22,050 INFO L231 Difference]: Finished difference. Result has 360 places, 358 transitions, 736 flow [2024-11-12 12:38:22,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=736, PETRI_PLACES=360, PETRI_TRANSITIONS=358} [2024-11-12 12:38:22,052 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -15 predicate places. [2024-11-12 12:38:22,052 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 358 transitions, 736 flow [2024-11-12 12:38:22,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:22,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:22,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:22,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:38:22,054 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:22,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:22,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1140211658, now seen corresponding path program 1 times [2024-11-12 12:38:22,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:22,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542863432] [2024-11-12 12:38:22,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:22,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:22,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:22,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542863432] [2024-11-12 12:38:22,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542863432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:22,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:22,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:22,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542051373] [2024-11-12 12:38:22,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:22,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:22,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:22,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:22,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:22,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-12 12:38:22,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 358 transitions, 736 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:22,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:22,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-12 12:38:22,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:22,384 INFO L124 PetriNetUnfolderBase]: 110/1385 cut-off events. [2024-11-12 12:38:22,384 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-11-12 12:38:22,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1597 conditions, 1385 events. 110/1385 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8321 event pairs, 56 based on Foata normal form. 0/1187 useless extension candidates. Maximal degree in co-relation 1518. Up to 151 conditions per place. [2024-11-12 12:38:22,411 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-12 12:38:22,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 357 transitions, 778 flow [2024-11-12 12:38:22,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:22,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:22,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-12 12:38:22,414 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-12 12:38:22,415 INFO L175 Difference]: Start difference. First operand has 360 places, 358 transitions, 736 flow. Second operand 3 states and 1115 transitions. [2024-11-12 12:38:22,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 357 transitions, 778 flow [2024-11-12 12:38:22,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 357 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:22,420 INFO L231 Difference]: Finished difference. Result has 359 places, 357 transitions, 734 flow [2024-11-12 12:38:22,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=359, PETRI_TRANSITIONS=357} [2024-11-12 12:38:22,422 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -16 predicate places. [2024-11-12 12:38:22,423 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 357 transitions, 734 flow [2024-11-12 12:38:22,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:22,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:22,424 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:22,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:38:22,425 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:22,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:22,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1776993455, now seen corresponding path program 1 times [2024-11-12 12:38:22,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:22,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246239929] [2024-11-12 12:38:22,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:22,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:22,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:22,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:22,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246239929] [2024-11-12 12:38:22,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246239929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:22,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:22,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:22,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509268815] [2024-11-12 12:38:22,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:22,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:22,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:22,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:22,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:22,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-12 12:38:22,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 357 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:22,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:22,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-12 12:38:22,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:22,644 INFO L124 PetriNetUnfolderBase]: 112/926 cut-off events. [2024-11-12 12:38:22,645 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-11-12 12:38:22,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 926 events. 112/926 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4933 event pairs, 56 based on Foata normal form. 0/793 useless extension candidates. Maximal degree in co-relation 1052. Up to 163 conditions per place. [2024-11-12 12:38:22,662 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2024-11-12 12:38:22,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 356 transitions, 776 flow [2024-11-12 12:38:22,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-12 12:38:22,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-12 12:38:22,665 INFO L175 Difference]: Start difference. First operand has 359 places, 357 transitions, 734 flow. Second operand 3 states and 1115 transitions. [2024-11-12 12:38:22,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 356 transitions, 776 flow [2024-11-12 12:38:22,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 356 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:22,671 INFO L231 Difference]: Finished difference. Result has 358 places, 356 transitions, 732 flow [2024-11-12 12:38:22,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=358, PETRI_TRANSITIONS=356} [2024-11-12 12:38:22,673 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -17 predicate places. [2024-11-12 12:38:22,673 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 356 transitions, 732 flow [2024-11-12 12:38:22,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:22,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:22,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:22,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:38:22,675 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:22,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:22,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1223676544, now seen corresponding path program 1 times [2024-11-12 12:38:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:22,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805132287] [2024-11-12 12:38:22,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:22,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:22,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:22,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805132287] [2024-11-12 12:38:22,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805132287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:22,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:22,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:22,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198812031] [2024-11-12 12:38:22,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:22,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:22,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:22,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:22,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:22,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 412 [2024-11-12 12:38:22,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 356 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:22,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:22,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 412 [2024-11-12 12:38:22,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:22,918 INFO L124 PetriNetUnfolderBase]: 112/925 cut-off events. [2024-11-12 12:38:22,918 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-11-12 12:38:22,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 925 events. 112/925 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4886 event pairs, 56 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 1044. Up to 163 conditions per place. [2024-11-12 12:38:22,936 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 20 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2024-11-12 12:38:22,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 355 transitions, 774 flow [2024-11-12 12:38:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:22,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1115 transitions. [2024-11-12 12:38:22,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9021035598705501 [2024-11-12 12:38:22,939 INFO L175 Difference]: Start difference. First operand has 358 places, 356 transitions, 732 flow. Second operand 3 states and 1115 transitions. [2024-11-12 12:38:22,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 355 transitions, 774 flow [2024-11-12 12:38:22,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 355 transitions, 770 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:22,945 INFO L231 Difference]: Finished difference. Result has 357 places, 355 transitions, 730 flow [2024-11-12 12:38:22,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=357, PETRI_TRANSITIONS=355} [2024-11-12 12:38:22,946 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -18 predicate places. [2024-11-12 12:38:22,946 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 355 transitions, 730 flow [2024-11-12 12:38:22,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:22,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:22,947 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:22,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:38:22,948 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:22,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:22,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1915489821, now seen corresponding path program 1 times [2024-11-12 12:38:22,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041690766] [2024-11-12 12:38:22,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:22,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:23,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:23,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:23,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041690766] [2024-11-12 12:38:23,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041690766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:23,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:23,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:23,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576707831] [2024-11-12 12:38:23,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:23,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:23,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:23,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:23,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-12 12:38:23,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 355 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:23,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:23,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-12 12:38:23,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:23,361 INFO L124 PetriNetUnfolderBase]: 191/1845 cut-off events. [2024-11-12 12:38:23,362 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-12 12:38:23,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2222 conditions, 1845 events. 191/1845 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 13759 event pairs, 72 based on Foata normal form. 0/1576 useless extension candidates. Maximal degree in co-relation 2122. Up to 204 conditions per place. [2024-11-12 12:38:23,386 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2024-11-12 12:38:23,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 362 transitions, 811 flow [2024-11-12 12:38:23,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:23,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-12 12:38:23,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-12 12:38:23,390 INFO L175 Difference]: Start difference. First operand has 357 places, 355 transitions, 730 flow. Second operand 3 states and 1128 transitions. [2024-11-12 12:38:23,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 362 transitions, 811 flow [2024-11-12 12:38:23,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 362 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:23,396 INFO L231 Difference]: Finished difference. Result has 356 places, 354 transitions, 728 flow [2024-11-12 12:38:23,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=356, PETRI_TRANSITIONS=354} [2024-11-12 12:38:23,397 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-12 12:38:23,397 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 354 transitions, 728 flow [2024-11-12 12:38:23,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:23,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:23,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:23,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:38:23,399 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:23,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1422681314, now seen corresponding path program 1 times [2024-11-12 12:38:23,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:23,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314552895] [2024-11-12 12:38:23,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:23,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:23,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:23,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:23,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314552895] [2024-11-12 12:38:23,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314552895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:23,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:23,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:23,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435273984] [2024-11-12 12:38:23,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:23,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:23,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:23,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:23,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:23,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-12 12:38:23,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 354 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:23,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:23,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-12 12:38:23,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:23,830 INFO L124 PetriNetUnfolderBase]: 171/1831 cut-off events. [2024-11-12 12:38:23,831 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-12 12:38:23,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2187 conditions, 1831 events. 171/1831 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 13577 event pairs, 40 based on Foata normal form. 0/1575 useless extension candidates. Maximal degree in co-relation 1175. Up to 129 conditions per place. [2024-11-12 12:38:23,855 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 31 selfloop transitions, 2 changer transitions 0/367 dead transitions. [2024-11-12 12:38:23,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 367 transitions, 836 flow [2024-11-12 12:38:23,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:23,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2024-11-12 12:38:23,859 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9207119741100324 [2024-11-12 12:38:23,859 INFO L175 Difference]: Start difference. First operand has 356 places, 354 transitions, 728 flow. Second operand 3 states and 1138 transitions. [2024-11-12 12:38:23,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 367 transitions, 836 flow [2024-11-12 12:38:23,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 367 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:23,868 INFO L231 Difference]: Finished difference. Result has 356 places, 354 transitions, 732 flow [2024-11-12 12:38:23,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=356, PETRI_TRANSITIONS=354} [2024-11-12 12:38:23,869 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-12 12:38:23,870 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 354 transitions, 732 flow [2024-11-12 12:38:23,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:23,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:23,872 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:23,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:38:23,872 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread5Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:23,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:23,873 INFO L85 PathProgramCache]: Analyzing trace with hash -894769896, now seen corresponding path program 1 times [2024-11-12 12:38:23,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:23,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612777023] [2024-11-12 12:38:23,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:23,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:23,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:23,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612777023] [2024-11-12 12:38:23,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612777023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:23,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:23,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:23,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807866569] [2024-11-12 12:38:23,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:23,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:23,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:23,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:23,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-12 12:38:23,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 354 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:23,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:23,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-12 12:38:23,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:24,276 INFO L124 PetriNetUnfolderBase]: 292/1806 cut-off events. [2024-11-12 12:38:24,276 INFO L125 PetriNetUnfolderBase]: For 114/130 co-relation queries the response was YES. [2024-11-12 12:38:24,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2339 conditions, 1806 events. 292/1806 cut-off events. For 114/130 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 12350 event pairs, 113 based on Foata normal form. 0/1514 useless extension candidates. Maximal degree in co-relation 1749. Up to 314 conditions per place. [2024-11-12 12:38:24,312 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-12 12:38:24,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 361 transitions, 812 flow [2024-11-12 12:38:24,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:24,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-12 12:38:24,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-12 12:38:24,316 INFO L175 Difference]: Start difference. First operand has 356 places, 354 transitions, 732 flow. Second operand 3 states and 1128 transitions. [2024-11-12 12:38:24,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 361 transitions, 812 flow [2024-11-12 12:38:24,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 361 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:38:24,326 INFO L231 Difference]: Finished difference. Result has 356 places, 353 transitions, 732 flow [2024-11-12 12:38:24,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=356, PETRI_TRANSITIONS=353} [2024-11-12 12:38:24,328 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-12 12:38:24,328 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 353 transitions, 732 flow [2024-11-12 12:38:24,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:24,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:24,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:24,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:38:24,330 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:24,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:24,334 INFO L85 PathProgramCache]: Analyzing trace with hash 936481567, now seen corresponding path program 1 times [2024-11-12 12:38:24,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:24,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553539541] [2024-11-12 12:38:24,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:24,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:24,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:24,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:24,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553539541] [2024-11-12 12:38:24,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553539541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:24,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:24,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:24,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720978146] [2024-11-12 12:38:24,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:24,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:24,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:24,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:24,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:24,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-12 12:38:24,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 353 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:24,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:24,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-12 12:38:24,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:24,747 INFO L124 PetriNetUnfolderBase]: 362/2136 cut-off events. [2024-11-12 12:38:24,748 INFO L125 PetriNetUnfolderBase]: For 145/151 co-relation queries the response was YES. [2024-11-12 12:38:24,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2751 conditions, 2136 events. 362/2136 cut-off events. For 145/151 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 15290 event pairs, 119 based on Foata normal form. 0/1742 useless extension candidates. Maximal degree in co-relation 2502. Up to 364 conditions per place. [2024-11-12 12:38:24,784 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/361 dead transitions. [2024-11-12 12:38:24,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 361 transitions, 818 flow [2024-11-12 12:38:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-12 12:38:24,788 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-12 12:38:24,788 INFO L175 Difference]: Start difference. First operand has 356 places, 353 transitions, 732 flow. Second operand 3 states and 1129 transitions. [2024-11-12 12:38:24,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 361 transitions, 818 flow [2024-11-12 12:38:24,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 361 transitions, 814 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:24,793 INFO L231 Difference]: Finished difference. Result has 355 places, 352 transitions, 730 flow [2024-11-12 12:38:24,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=355, PETRI_TRANSITIONS=352} [2024-11-12 12:38:24,794 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-12 12:38:24,795 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 352 transitions, 730 flow [2024-11-12 12:38:24,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:24,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:24,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:24,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:38:24,796 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread5Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:24,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:24,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1521898020, now seen corresponding path program 1 times [2024-11-12 12:38:24,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:24,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12779750] [2024-11-12 12:38:24,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:24,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:24,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:24,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12779750] [2024-11-12 12:38:24,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12779750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:24,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:24,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:24,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107673361] [2024-11-12 12:38:24,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:24,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:24,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:24,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:24,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:24,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-12 12:38:24,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 352 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:24,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:24,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-12 12:38:24,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:25,165 INFO L124 PetriNetUnfolderBase]: 253/2046 cut-off events. [2024-11-12 12:38:25,165 INFO L125 PetriNetUnfolderBase]: For 101/113 co-relation queries the response was YES. [2024-11-12 12:38:25,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2507 conditions, 2046 events. 253/2046 cut-off events. For 101/113 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14326 event pairs, 63 based on Foata normal form. 0/1740 useless extension candidates. Maximal degree in co-relation 2468. Up to 203 conditions per place. [2024-11-12 12:38:25,198 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2024-11-12 12:38:25,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 364 transitions, 830 flow [2024-11-12 12:38:25,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:25,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:25,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-12 12:38:25,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-12 12:38:25,201 INFO L175 Difference]: Start difference. First operand has 355 places, 352 transitions, 730 flow. Second operand 3 states and 1137 transitions. [2024-11-12 12:38:25,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 364 transitions, 830 flow [2024-11-12 12:38:25,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 364 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:25,207 INFO L231 Difference]: Finished difference. Result has 355 places, 352 transitions, 734 flow [2024-11-12 12:38:25,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=355, PETRI_TRANSITIONS=352} [2024-11-12 12:38:25,209 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-12 12:38:25,209 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 352 transitions, 734 flow [2024-11-12 12:38:25,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:25,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:25,210 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:25,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:38:25,211 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:25,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1384226096, now seen corresponding path program 1 times [2024-11-12 12:38:25,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:25,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765770014] [2024-11-12 12:38:25,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:25,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:25,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:25,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765770014] [2024-11-12 12:38:25,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765770014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:25,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:25,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:25,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228148465] [2024-11-12 12:38:25,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:25,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:25,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:25,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:25,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:25,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-12 12:38:25,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 352 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:25,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:25,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-12 12:38:25,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:25,660 INFO L124 PetriNetUnfolderBase]: 414/2575 cut-off events. [2024-11-12 12:38:25,661 INFO L125 PetriNetUnfolderBase]: For 203/227 co-relation queries the response was YES. [2024-11-12 12:38:25,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3280 conditions, 2575 events. 414/2575 cut-off events. For 203/227 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 18953 event pairs, 91 based on Foata normal form. 0/2124 useless extension candidates. Maximal degree in co-relation 2370. Up to 307 conditions per place. [2024-11-12 12:38:25,704 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/364 dead transitions. [2024-11-12 12:38:25,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 364 transitions, 835 flow [2024-11-12 12:38:25,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:25,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-12 12:38:25,707 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-12 12:38:25,707 INFO L175 Difference]: Start difference. First operand has 355 places, 352 transitions, 734 flow. Second operand 3 states and 1137 transitions. [2024-11-12 12:38:25,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 364 transitions, 835 flow [2024-11-12 12:38:25,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 364 transitions, 833 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:38:25,713 INFO L231 Difference]: Finished difference. Result has 356 places, 352 transitions, 740 flow [2024-11-12 12:38:25,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=356, PETRI_TRANSITIONS=352} [2024-11-12 12:38:25,714 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-12 12:38:25,715 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 352 transitions, 740 flow [2024-11-12 12:38:25,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:25,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:25,716 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:25,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:38:25,716 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread6Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:25,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:25,717 INFO L85 PathProgramCache]: Analyzing trace with hash 116901643, now seen corresponding path program 1 times [2024-11-12 12:38:25,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:25,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733446457] [2024-11-12 12:38:25,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:25,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:25,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:25,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:25,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733446457] [2024-11-12 12:38:25,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733446457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:25,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:25,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:25,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815500178] [2024-11-12 12:38:25,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:25,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:25,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:25,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:25,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:25,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-12 12:38:25,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 352 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:25,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:25,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-12 12:38:25,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:26,353 INFO L124 PetriNetUnfolderBase]: 808/3108 cut-off events. [2024-11-12 12:38:26,354 INFO L125 PetriNetUnfolderBase]: For 416/459 co-relation queries the response was YES. [2024-11-12 12:38:26,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4322 conditions, 3108 events. 808/3108 cut-off events. For 416/459 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 22162 event pairs, 266 based on Foata normal form. 0/2371 useless extension candidates. Maximal degree in co-relation 3187. Up to 797 conditions per place. [2024-11-12 12:38:26,405 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-12 12:38:26,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 360 transitions, 825 flow [2024-11-12 12:38:26,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-12 12:38:26,408 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-12 12:38:26,408 INFO L175 Difference]: Start difference. First operand has 356 places, 352 transitions, 740 flow. Second operand 3 states and 1129 transitions. [2024-11-12 12:38:26,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 360 transitions, 825 flow [2024-11-12 12:38:26,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:38:26,413 INFO L231 Difference]: Finished difference. Result has 356 places, 351 transitions, 740 flow [2024-11-12 12:38:26,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=740, PETRI_PLACES=356, PETRI_TRANSITIONS=351} [2024-11-12 12:38:26,414 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-12 12:38:26,414 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 351 transitions, 740 flow [2024-11-12 12:38:26,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:26,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:26,415 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:26,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:38:26,415 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread6Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:26,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:26,416 INFO L85 PathProgramCache]: Analyzing trace with hash -600548039, now seen corresponding path program 1 times [2024-11-12 12:38:26,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:26,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115939712] [2024-11-12 12:38:26,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:26,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:26,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:26,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115939712] [2024-11-12 12:38:26,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115939712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:26,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:26,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:26,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696269697] [2024-11-12 12:38:26,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:26,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:26,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:26,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:26,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:26,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-12 12:38:26,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 351 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:26,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:26,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-12 12:38:26,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:26,971 INFO L124 PetriNetUnfolderBase]: 609/3336 cut-off events. [2024-11-12 12:38:26,972 INFO L125 PetriNetUnfolderBase]: For 401/434 co-relation queries the response was YES. [2024-11-12 12:38:27,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4394 conditions, 3336 events. 609/3336 cut-off events. For 401/434 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 24794 event pairs, 142 based on Foata normal form. 1/2704 useless extension candidates. Maximal degree in co-relation 3120. Up to 466 conditions per place. [2024-11-12 12:38:27,021 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 29 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2024-11-12 12:38:27,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 362 transitions, 837 flow [2024-11-12 12:38:27,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-12 12:38:27,025 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.919093851132686 [2024-11-12 12:38:27,025 INFO L175 Difference]: Start difference. First operand has 356 places, 351 transitions, 740 flow. Second operand 3 states and 1136 transitions. [2024-11-12 12:38:27,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 362 transitions, 837 flow [2024-11-12 12:38:27,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 362 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:27,031 INFO L231 Difference]: Finished difference. Result has 356 places, 351 transitions, 744 flow [2024-11-12 12:38:27,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=356, PETRI_TRANSITIONS=351} [2024-11-12 12:38:27,033 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-12 12:38:27,033 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 351 transitions, 744 flow [2024-11-12 12:38:27,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:27,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:27,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:27,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 12:38:27,034 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:27,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:27,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2071319894, now seen corresponding path program 1 times [2024-11-12 12:38:27,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:27,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820104532] [2024-11-12 12:38:27,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:27,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:27,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:27,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820104532] [2024-11-12 12:38:27,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820104532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:27,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:27,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:27,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468965370] [2024-11-12 12:38:27,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:27,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:27,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:27,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:27,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:27,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-12 12:38:27,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 351 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:27,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:27,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-12 12:38:27,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:27,619 INFO L124 PetriNetUnfolderBase]: 486/3093 cut-off events. [2024-11-12 12:38:27,619 INFO L125 PetriNetUnfolderBase]: For 209/319 co-relation queries the response was YES. [2024-11-12 12:38:27,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4063 conditions, 3093 events. 486/3093 cut-off events. For 209/319 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 24185 event pairs, 188 based on Foata normal form. 9/2597 useless extension candidates. Maximal degree in co-relation 3190. Up to 569 conditions per place. [2024-11-12 12:38:27,672 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-12 12:38:27,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 825 flow [2024-11-12 12:38:27,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-12 12:38:27,677 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-12 12:38:27,677 INFO L175 Difference]: Start difference. First operand has 356 places, 351 transitions, 744 flow. Second operand 3 states and 1128 transitions. [2024-11-12 12:38:27,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 825 flow [2024-11-12 12:38:27,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 358 transitions, 823 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:38:27,683 INFO L231 Difference]: Finished difference. Result has 356 places, 350 transitions, 744 flow [2024-11-12 12:38:27,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=356, PETRI_TRANSITIONS=350} [2024-11-12 12:38:27,684 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-12 12:38:27,685 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 350 transitions, 744 flow [2024-11-12 12:38:27,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.0) internal successors, (1104), 3 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:27,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:27,687 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:27,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 12:38:27,687 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:27,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:27,688 INFO L85 PathProgramCache]: Analyzing trace with hash -894883096, now seen corresponding path program 1 times [2024-11-12 12:38:27,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:27,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765118378] [2024-11-12 12:38:27,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:27,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:27,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:27,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765118378] [2024-11-12 12:38:27,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765118378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:27,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:27,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:27,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104264082] [2024-11-12 12:38:27,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:27,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:27,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:27,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:27,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:27,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-12 12:38:27,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 350 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:27,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:27,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-12 12:38:27,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:28,214 INFO L124 PetriNetUnfolderBase]: 406/2971 cut-off events. [2024-11-12 12:38:28,214 INFO L125 PetriNetUnfolderBase]: For 218/296 co-relation queries the response was YES. [2024-11-12 12:38:28,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3821 conditions, 2971 events. 406/2971 cut-off events. For 218/296 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 23189 event pairs, 89 based on Foata normal form. 9/2535 useless extension candidates. Maximal degree in co-relation 2949. Up to 299 conditions per place. [2024-11-12 12:38:28,256 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 31 selfloop transitions, 2 changer transitions 0/363 dead transitions. [2024-11-12 12:38:28,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 363 transitions, 852 flow [2024-11-12 12:38:28,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:28,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1138 transitions. [2024-11-12 12:38:28,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9207119741100324 [2024-11-12 12:38:28,260 INFO L175 Difference]: Start difference. First operand has 356 places, 350 transitions, 744 flow. Second operand 3 states and 1138 transitions. [2024-11-12 12:38:28,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 363 transitions, 852 flow [2024-11-12 12:38:28,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 363 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:28,266 INFO L231 Difference]: Finished difference. Result has 356 places, 350 transitions, 748 flow [2024-11-12 12:38:28,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=356, PETRI_TRANSITIONS=350} [2024-11-12 12:38:28,267 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-12 12:38:28,267 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 350 transitions, 748 flow [2024-11-12 12:38:28,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:28,268 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:28,268 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:28,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 12:38:28,268 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:28,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:28,269 INFO L85 PathProgramCache]: Analyzing trace with hash 911133796, now seen corresponding path program 1 times [2024-11-12 12:38:28,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:28,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766365678] [2024-11-12 12:38:28,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:28,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:28,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:28,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766365678] [2024-11-12 12:38:28,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766365678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:28,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:28,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:28,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910757581] [2024-11-12 12:38:28,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:28,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:28,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:28,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:28,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:28,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-12 12:38:28,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 350 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:28,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:28,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-12 12:38:28,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:28,816 INFO L124 PetriNetUnfolderBase]: 528/2947 cut-off events. [2024-11-12 12:38:28,816 INFO L125 PetriNetUnfolderBase]: For 254/390 co-relation queries the response was YES. [2024-11-12 12:38:28,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3971 conditions, 2947 events. 528/2947 cut-off events. For 254/390 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 22520 event pairs, 215 based on Foata normal form. 10/2465 useless extension candidates. Maximal degree in co-relation 3009. Up to 610 conditions per place. [2024-11-12 12:38:28,859 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 27 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-12 12:38:28,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 357 transitions, 828 flow [2024-11-12 12:38:28,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:28,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2024-11-12 12:38:28,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912621359223301 [2024-11-12 12:38:28,863 INFO L175 Difference]: Start difference. First operand has 356 places, 350 transitions, 748 flow. Second operand 3 states and 1128 transitions. [2024-11-12 12:38:28,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 357 transitions, 828 flow [2024-11-12 12:38:28,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 357 transitions, 826 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:38:28,869 INFO L231 Difference]: Finished difference. Result has 356 places, 349 transitions, 748 flow [2024-11-12 12:38:28,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=356, PETRI_TRANSITIONS=349} [2024-11-12 12:38:28,870 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-12 12:38:28,871 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 349 transitions, 748 flow [2024-11-12 12:38:28,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:28,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:28,872 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:28,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 12:38:28,872 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:28,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:28,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1204443032, now seen corresponding path program 1 times [2024-11-12 12:38:28,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:28,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643293996] [2024-11-12 12:38:28,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:28,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:28,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:28,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643293996] [2024-11-12 12:38:28,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643293996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:28,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:28,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:28,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427488886] [2024-11-12 12:38:28,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:28,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:28,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:28,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:28,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:28,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-12 12:38:28,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 349 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:28,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:28,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-12 12:38:28,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:29,474 INFO L124 PetriNetUnfolderBase]: 712/3261 cut-off events. [2024-11-12 12:38:29,474 INFO L125 PetriNetUnfolderBase]: For 341/399 co-relation queries the response was YES. [2024-11-12 12:38:29,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4491 conditions, 3261 events. 712/3261 cut-off events. For 341/399 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 24931 event pairs, 245 based on Foata normal form. 0/2592 useless extension candidates. Maximal degree in co-relation 3441. Up to 744 conditions per place. [2024-11-12 12:38:29,581 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-12 12:38:29,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 357 transitions, 834 flow [2024-11-12 12:38:29,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:29,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-12 12:38:29,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-12 12:38:29,584 INFO L175 Difference]: Start difference. First operand has 356 places, 349 transitions, 748 flow. Second operand 3 states and 1129 transitions. [2024-11-12 12:38:29,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 357 transitions, 834 flow [2024-11-12 12:38:29,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 357 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:29,590 INFO L231 Difference]: Finished difference. Result has 355 places, 348 transitions, 746 flow [2024-11-12 12:38:29,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=746, PETRI_PLACES=355, PETRI_TRANSITIONS=348} [2024-11-12 12:38:29,591 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-12 12:38:29,591 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 348 transitions, 746 flow [2024-11-12 12:38:29,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:29,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:29,592 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:29,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 12:38:29,592 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread5Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:29,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash -605340477, now seen corresponding path program 1 times [2024-11-12 12:38:29,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:29,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910320600] [2024-11-12 12:38:29,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:29,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:29,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:29,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:29,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910320600] [2024-11-12 12:38:29,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910320600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:29,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:29,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:29,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983863253] [2024-11-12 12:38:29,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:29,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:29,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:29,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:29,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:29,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-12 12:38:29,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 348 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:29,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:29,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-12 12:38:29,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:30,109 INFO L124 PetriNetUnfolderBase]: 433/3145 cut-off events. [2024-11-12 12:38:30,109 INFO L125 PetriNetUnfolderBase]: For 210/326 co-relation queries the response was YES. [2024-11-12 12:38:30,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4017 conditions, 3145 events. 433/3145 cut-off events. For 210/326 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 24504 event pairs, 105 based on Foata normal form. 10/2700 useless extension candidates. Maximal degree in co-relation 3049. Up to 339 conditions per place. [2024-11-12 12:38:30,151 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-12 12:38:30,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 846 flow [2024-11-12 12:38:30,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:30,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-12 12:38:30,154 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-12 12:38:30,154 INFO L175 Difference]: Start difference. First operand has 355 places, 348 transitions, 746 flow. Second operand 3 states and 1137 transitions. [2024-11-12 12:38:30,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 846 flow [2024-11-12 12:38:30,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 360 transitions, 842 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:30,160 INFO L231 Difference]: Finished difference. Result has 355 places, 348 transitions, 750 flow [2024-11-12 12:38:30,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=355, PETRI_TRANSITIONS=348} [2024-11-12 12:38:30,161 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-12 12:38:30,161 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 348 transitions, 750 flow [2024-11-12 12:38:30,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:30,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:30,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:30,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-12 12:38:30,163 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:30,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:30,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1406560618, now seen corresponding path program 1 times [2024-11-12 12:38:30,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:30,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568119030] [2024-11-12 12:38:30,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:30,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:30,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568119030] [2024-11-12 12:38:30,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568119030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:30,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:30,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912166794] [2024-11-12 12:38:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:30,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:30,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:30,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:30,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-12 12:38:30,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 348 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:30,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:30,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-12 12:38:30,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:30,681 INFO L124 PetriNetUnfolderBase]: 542/3144 cut-off events. [2024-11-12 12:38:30,681 INFO L125 PetriNetUnfolderBase]: For 272/318 co-relation queries the response was YES. [2024-11-12 12:38:30,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4144 conditions, 3144 events. 542/3144 cut-off events. For 272/318 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 23785 event pairs, 117 based on Foata normal form. 0/2622 useless extension candidates. Maximal degree in co-relation 3199. Up to 399 conditions per place. [2024-11-12 12:38:30,737 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 30 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2024-11-12 12:38:30,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 360 transitions, 851 flow [2024-11-12 12:38:30,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:30,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:30,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2024-11-12 12:38:30,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9199029126213593 [2024-11-12 12:38:30,740 INFO L175 Difference]: Start difference. First operand has 355 places, 348 transitions, 750 flow. Second operand 3 states and 1137 transitions. [2024-11-12 12:38:30,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 360 transitions, 851 flow [2024-11-12 12:38:30,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 360 transitions, 849 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:38:30,746 INFO L231 Difference]: Finished difference. Result has 356 places, 348 transitions, 756 flow [2024-11-12 12:38:30,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=356, PETRI_TRANSITIONS=348} [2024-11-12 12:38:30,747 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-12 12:38:30,747 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 348 transitions, 756 flow [2024-11-12 12:38:30,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:30,748 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:30,748 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:30,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-12 12:38:30,748 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread6Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:30,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:30,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1175845953, now seen corresponding path program 1 times [2024-11-12 12:38:30,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:30,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504743816] [2024-11-12 12:38:30,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:30,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:30,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:30,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504743816] [2024-11-12 12:38:30,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504743816] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:30,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:30,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:30,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301848758] [2024-11-12 12:38:30,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:30,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:30,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:30,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:30,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:30,804 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 412 [2024-11-12 12:38:30,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 348 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:30,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:30,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 412 [2024-11-12 12:38:30,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:31,339 INFO L124 PetriNetUnfolderBase]: 821/3691 cut-off events. [2024-11-12 12:38:31,340 INFO L125 PetriNetUnfolderBase]: For 436/461 co-relation queries the response was YES. [2024-11-12 12:38:31,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5078 conditions, 3691 events. 821/3691 cut-off events. For 436/461 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 28606 event pairs, 290 based on Foata normal form. 0/2960 useless extension candidates. Maximal degree in co-relation 3607. Up to 836 conditions per place. [2024-11-12 12:38:31,370 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 28 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2024-11-12 12:38:31,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 356 transitions, 841 flow [2024-11-12 12:38:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:31,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:31,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1129 transitions. [2024-11-12 12:38:31,372 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9134304207119741 [2024-11-12 12:38:31,372 INFO L175 Difference]: Start difference. First operand has 356 places, 348 transitions, 756 flow. Second operand 3 states and 1129 transitions. [2024-11-12 12:38:31,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 356 transitions, 841 flow [2024-11-12 12:38:31,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 356 transitions, 839 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:38:31,378 INFO L231 Difference]: Finished difference. Result has 356 places, 347 transitions, 756 flow [2024-11-12 12:38:31,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=752, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=356, PETRI_TRANSITIONS=347} [2024-11-12 12:38:31,379 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -19 predicate places. [2024-11-12 12:38:31,379 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 347 transitions, 756 flow [2024-11-12 12:38:31,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.6666666666667) internal successors, (1106), 3 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:31,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:38:31,380 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:31,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-12 12:38:31,380 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread6Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 47 more)] === [2024-11-12 12:38:31,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:38:31,381 INFO L85 PathProgramCache]: Analyzing trace with hash -125379082, now seen corresponding path program 1 times [2024-11-12 12:38:31,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:38:31,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596778788] [2024-11-12 12:38:31,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:38:31,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:38:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:38:31,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:38:31,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:38:31,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596778788] [2024-11-12 12:38:31,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596778788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:38:31,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:38:31,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:38:31,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136052562] [2024-11-12 12:38:31,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:38:31,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:38:31,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:38:31,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:38:31,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:38:31,430 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 412 [2024-11-12 12:38:31,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 347 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:31,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:38:31,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 412 [2024-11-12 12:38:31,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:38:31,949 INFO L124 PetriNetUnfolderBase]: 609/3532 cut-off events. [2024-11-12 12:38:31,949 INFO L125 PetriNetUnfolderBase]: For 401/426 co-relation queries the response was YES. [2024-11-12 12:38:31,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4731 conditions, 3532 events. 609/3532 cut-off events. For 401/426 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 27041 event pairs, 142 based on Foata normal form. 0/2964 useless extension candidates. Maximal degree in co-relation 3375. Up to 466 conditions per place. [2024-11-12 12:38:31,972 INFO L140 encePairwiseOnDemand]: 409/412 looper letters, 0 selfloop transitions, 0 changer transitions 358/358 dead transitions. [2024-11-12 12:38:31,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 853 flow [2024-11-12 12:38:31,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:38:31,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:38:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-12 12:38:31,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.919093851132686 [2024-11-12 12:38:31,975 INFO L175 Difference]: Start difference. First operand has 356 places, 347 transitions, 756 flow. Second operand 3 states and 1136 transitions. [2024-11-12 12:38:31,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 853 flow [2024-11-12 12:38:31,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 358 transitions, 847 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:38:31,980 INFO L231 Difference]: Finished difference. Result has 355 places, 0 transitions, 0 flow [2024-11-12 12:38:31,981 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=412, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=355, PETRI_TRANSITIONS=0} [2024-11-12 12:38:31,981 INFO L279 CegarLoopForPetriNet]: 375 programPoint places, -20 predicate places. [2024-11-12 12:38:31,981 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 0 transitions, 0 flow [2024-11-12 12:38:31,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.6666666666667) internal successors, (1112), 3 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:38:31,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 50 remaining) [2024-11-12 12:38:31,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 50 remaining) [2024-11-12 12:38:31,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2024-11-12 12:38:31,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2024-11-12 12:38:31,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2024-11-12 12:38:31,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2024-11-12 12:38:31,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2024-11-12 12:38:31,985 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2024-11-12 12:38:31,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2024-11-12 12:38:31,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2024-11-12 12:38:31,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2024-11-12 12:38:31,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2024-11-12 12:38:31,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2024-11-12 12:38:31,986 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2024-11-12 12:38:31,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2024-11-12 12:38:31,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2024-11-12 12:38:31,987 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2024-11-12 12:38:31,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2024-11-12 12:38:31,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 50 remaining) [2024-11-12 12:38:31,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 50 remaining) [2024-11-12 12:38:31,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 50 remaining) [2024-11-12 12:38:31,988 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 50 remaining) [2024-11-12 12:38:31,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2024-11-12 12:38:31,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2024-11-12 12:38:31,989 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2024-11-12 12:38:31,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2024-11-12 12:38:31,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2024-11-12 12:38:31,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2024-11-12 12:38:31,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2024-11-12 12:38:31,990 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2024-11-12 12:38:31,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork4Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2024-11-12 12:38:31,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork4Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2024-11-12 12:38:31,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2024-11-12 12:38:31,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2024-11-12 12:38:31,991 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2024-11-12 12:38:31,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2024-11-12 12:38:31,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2024-11-12 12:38:31,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2024-11-12 12:38:31,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2024-11-12 12:38:31,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2024-11-12 12:38:31,992 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork0Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 50 remaining) [2024-11-12 12:38:31,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork0Err9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 50 remaining) [2024-11-12 12:38:31,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2024-11-12 12:38:31,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2024-11-12 12:38:31,993 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2024-11-12 12:38:31,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2024-11-12 12:38:31,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2024-11-12 12:38:31,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2024-11-12 12:38:31,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2024-11-12 12:38:31,994 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2024-11-12 12:38:31,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-12 12:38:31,995 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:38:32,001 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 12:38:32,001 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:38:32,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:38:32 BasicIcfg [2024-11-12 12:38:32,006 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:38:32,008 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:38:32,008 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:38:32,008 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:38:32,009 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:38:18" (3/4) ... [2024-11-12 12:38:32,011 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 12:38:32,014 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-12 12:38:32,014 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-12 12:38:32,015 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-12 12:38:32,015 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-12 12:38:32,015 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2024-11-12 12:38:32,015 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2024-11-12 12:38:32,019 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-12 12:38:32,020 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 12:38:32,020 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 12:38:32,020 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 12:38:32,110 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:38:32,111 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 12:38:32,111 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:38:32,111 INFO L158 Benchmark]: Toolchain (without parser) took 14372.76ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 82.5MB in the beginning and 1.1GB in the end (delta: -980.3MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. [2024-11-12 12:38:32,112 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 113.2MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:38:32,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.32ms. Allocated memory is still 151.0MB. Free memory was 82.5MB in the beginning and 68.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 12:38:32,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.54ms. Allocated memory is still 151.0MB. Free memory was 68.1MB in the beginning and 65.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:38:32,112 INFO L158 Benchmark]: Boogie Preprocessor took 51.14ms. Allocated memory is still 151.0MB. Free memory was 65.4MB in the beginning and 63.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:38:32,113 INFO L158 Benchmark]: RCFGBuilder took 702.07ms. Allocated memory is still 151.0MB. Free memory was 63.5MB in the beginning and 104.2MB in the end (delta: -40.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 12:38:32,113 INFO L158 Benchmark]: TraceAbstraction took 13105.24ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 103.6MB in the beginning and 1.1GB in the end (delta: -964.5MB). Peak memory consumption was 460.5MB. Max. memory is 16.1GB. [2024-11-12 12:38:32,114 INFO L158 Benchmark]: Witness Printer took 102.74ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 12:38:32,115 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.20ms. Allocated memory is still 113.2MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.32ms. Allocated memory is still 151.0MB. Free memory was 82.5MB in the beginning and 68.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.54ms. Allocated memory is still 151.0MB. Free memory was 68.1MB in the beginning and 65.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.14ms. Allocated memory is still 151.0MB. Free memory was 65.4MB in the beginning and 63.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 702.07ms. Allocated memory is still 151.0MB. Free memory was 63.5MB in the beginning and 104.2MB in the end (delta: -40.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13105.24ms. Allocated memory was 151.0MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 103.6MB in the beginning and 1.1GB in the end (delta: -964.5MB). Peak memory consumption was 460.5MB. Max. memory is 16.1GB. * Witness Printer took 102.74ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 151]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: 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, 613 locations, 50 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.9s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 576 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1278 IncrementalHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 103 mSDtfsCounter, 1278 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=799occurred in iteration=0, InterpolantAutomatonStates: 72, 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.9s InterpolantComputationTime, 2988 NumberOfCodeBlocks, 2988 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2964 ConstructedInterpolants, 0 QuantifiedInterpolants, 3012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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 24 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-12 12:38:32,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE