./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.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/popl20-more-queue-add-2-nl.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 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:39:53,341 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:39:53,400 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:39:53,403 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:39:53,404 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:39:53,421 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:39:53,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:39:53,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:39:53,422 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:39:53,422 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:39:53,423 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:39:53,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:39:53,423 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:39:53,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:39:53,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:39:53,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:39:53,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:39:53,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:39:53,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:39:53,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:39:53,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:39:53,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:39:53,427 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:39:53,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:39:53,427 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:39:53,427 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:39:53,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:39:53,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:39:53,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:39:53,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:39:53,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:39:53,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:39:53,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:39:53,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:39:53,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:39:53,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:39:53,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:39:53,429 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:39:53,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:39:53,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:39:53,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:39:53,435 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 -> 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d [2024-11-12 12:39:53,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:39:53,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:39:53,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:39:53,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:39:53,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:39:53,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2024-11-12 12:39:54,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:39:54,970 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:39:54,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2024-11-12 12:39:54,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930614ab1/2a7945442a4b40479bb0fa12df65ff4f/FLAG9461a2738 [2024-11-12 12:39:54,996 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930614ab1/2a7945442a4b40479bb0fa12df65ff4f [2024-11-12 12:39:54,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:39:54,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:39:55,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:39:55,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:39:55,004 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:39:55,005 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:39:54" (1/1) ... [2024-11-12 12:39:55,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc93fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:55, skipping insertion in model container [2024-11-12 12:39:55,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:39:54" (1/1) ... [2024-11-12 12:39:55,027 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:39:55,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:39:55,206 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:39:55,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:39:55,248 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:39:55,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:55 WrapperNode [2024-11-12 12:39:55,249 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:39:55,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:39:55,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:39:55,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:39:55,255 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:39:55" (1/1) ... [2024-11-12 12:39:55,273 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:39:55" (1/1) ... [2024-11-12 12:39:55,304 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 329 [2024-11-12 12:39:55,305 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:39:55,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:39:55,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:39:55,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:39:55,315 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:55" (1/1) ... [2024-11-12 12:39:55,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:55" (1/1) ... [2024-11-12 12:39:55,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:55" (1/1) ... [2024-11-12 12:39:55,323 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:55" (1/1) ... [2024-11-12 12:39:55,337 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:55" (1/1) ... [2024-11-12 12:39:55,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:55" (1/1) ... [2024-11-12 12:39:55,341 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:55" (1/1) ... [2024-11-12 12:39:55,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:55" (1/1) ... [2024-11-12 12:39:55,344 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:39:55,345 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:39:55,345 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:39:55,345 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:39:55,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:55" (1/1) ... [2024-11-12 12:39:55,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:39:55,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:39:55,376 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:39:55,379 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:39:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:39:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 12:39:55,421 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 12:39:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 12:39:55,421 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 12:39:55,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:39:55,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:39:55,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 12:39:55,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 12:39:55,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:39:55,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:39:55,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:39:55,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:39:55,424 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:39:55,526 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:39:55,528 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:39:55,945 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:39:55,945 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:39:56,197 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:39:56,197 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-12 12:39:56,197 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:39:56 BoogieIcfgContainer [2024-11-12 12:39:56,197 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:39:56,199 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:39:56,199 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:39:56,202 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:39:56,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:39:54" (1/3) ... [2024-11-12 12:39:56,203 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a1e872d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:39:56, skipping insertion in model container [2024-11-12 12:39:56,203 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:39:55" (2/3) ... [2024-11-12 12:39:56,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a1e872d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:39:56, skipping insertion in model container [2024-11-12 12:39:56,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:39:56" (3/3) ... [2024-11-12 12:39:56,205 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2024-11-12 12:39:56,218 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:39:56,218 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2024-11-12 12:39:56,218 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:39:56,285 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 12:39:56,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 283 transitions, 580 flow [2024-11-12 12:39:56,459 INFO L124 PetriNetUnfolderBase]: 12/281 cut-off events. [2024-11-12 12:39:56,459 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 12:39:56,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 281 events. 12/281 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 463 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 198. Up to 3 conditions per place. [2024-11-12 12:39:56,468 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 283 transitions, 580 flow [2024-11-12 12:39:56,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 261 transitions, 534 flow [2024-11-12 12:39:56,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:39:56,491 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;@4983f55e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:39:56,491 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-11-12 12:39:56,497 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:39:56,498 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-12 12:39:56,498 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:39:56,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:56,498 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] [2024-11-12 12:39:56,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:56,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:56,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1679605482, now seen corresponding path program 1 times [2024-11-12 12:39:56,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:56,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014379473] [2024-11-12 12:39:56,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:56,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:56,642 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:39:56,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:56,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014379473] [2024-11-12 12:39:56,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014379473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:56,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:56,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:56,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158627226] [2024-11-12 12:39:56,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:56,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:56,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:56,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:56,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:56,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 283 [2024-11-12 12:39:56,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 261 transitions, 534 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 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:39:56,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:56,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 283 [2024-11-12 12:39:56,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:56,818 INFO L124 PetriNetUnfolderBase]: 21/395 cut-off events. [2024-11-12 12:39:56,818 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-11-12 12:39:56,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 395 events. 21/395 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1220 event pairs, 14 based on Foata normal form. 14/350 useless extension candidates. Maximal degree in co-relation 287. Up to 42 conditions per place. [2024-11-12 12:39:56,822 INFO L140 encePairwiseOnDemand]: 247/283 looper letters, 13 selfloop transitions, 2 changer transitions 3/227 dead transitions. [2024-11-12 12:39:56,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 227 transitions, 496 flow [2024-11-12 12:39:56,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2024-11-12 12:39:56,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8739693757361602 [2024-11-12 12:39:56,841 INFO L175 Difference]: Start difference. First operand has 258 places, 261 transitions, 534 flow. Second operand 3 states and 742 transitions. [2024-11-12 12:39:56,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 227 transitions, 496 flow [2024-11-12 12:39:56,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 227 transitions, 488 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 12:39:56,849 INFO L231 Difference]: Finished difference. Result has 229 places, 224 transitions, 456 flow [2024-11-12 12:39:56,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=229, PETRI_TRANSITIONS=224} [2024-11-12 12:39:56,854 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -29 predicate places. [2024-11-12 12:39:56,854 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 224 transitions, 456 flow [2024-11-12 12:39:56,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 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:39:56,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:56,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] [2024-11-12 12:39:56,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:39:56,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:56,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:56,857 INFO L85 PathProgramCache]: Analyzing trace with hash 819081452, now seen corresponding path program 1 times [2024-11-12 12:39:56,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:56,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965160433] [2024-11-12 12:39:56,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:56,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:56,902 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:39:56,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:56,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965160433] [2024-11-12 12:39:56,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965160433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:56,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:56,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:56,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195295157] [2024-11-12 12:39:56,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:56,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:56,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:56,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:56,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:56,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 283 [2024-11-12 12:39:56,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 224 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 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:39:56,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:56,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 283 [2024-11-12 12:39:56,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:56,976 INFO L124 PetriNetUnfolderBase]: 12/307 cut-off events. [2024-11-12 12:39:56,976 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 12:39:56,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 307 events. 12/307 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 736 event pairs, 7 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 316. Up to 30 conditions per place. [2024-11-12 12:39:56,979 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 13 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2024-11-12 12:39:56,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 223 transitions, 484 flow [2024-11-12 12:39:56,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions. [2024-11-12 12:39:56,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8351001177856302 [2024-11-12 12:39:56,982 INFO L175 Difference]: Start difference. First operand has 229 places, 224 transitions, 456 flow. Second operand 3 states and 709 transitions. [2024-11-12 12:39:56,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 223 transitions, 484 flow [2024-11-12 12:39:56,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 223 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:39:56,989 INFO L231 Difference]: Finished difference. Result has 225 places, 223 transitions, 454 flow [2024-11-12 12:39:56,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=225, PETRI_TRANSITIONS=223} [2024-11-12 12:39:56,990 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -33 predicate places. [2024-11-12 12:39:56,990 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 223 transitions, 454 flow [2024-11-12 12:39:56,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 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:39:56,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:56,990 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] [2024-11-12 12:39:56,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:39:56,991 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:56,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash 513969531, now seen corresponding path program 1 times [2024-11-12 12:39:56,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:56,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661603608] [2024-11-12 12:39:56,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:56,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:57,050 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:39:57,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:57,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661603608] [2024-11-12 12:39:57,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661603608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:57,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:57,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:57,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751033242] [2024-11-12 12:39:57,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:57,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:57,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:57,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:57,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:57,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 283 [2024-11-12 12:39:57,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 223 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 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:39:57,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:57,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 283 [2024-11-12 12:39:57,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:57,122 INFO L124 PetriNetUnfolderBase]: 11/331 cut-off events. [2024-11-12 12:39:57,122 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-12 12:39:57,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 331 events. 11/331 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 686 event pairs, 5 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 324. Up to 23 conditions per place. [2024-11-12 12:39:57,124 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 11 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-11-12 12:39:57,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 478 flow [2024-11-12 12:39:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-11-12 12:39:57,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.839811542991755 [2024-11-12 12:39:57,126 INFO L175 Difference]: Start difference. First operand has 225 places, 223 transitions, 454 flow. Second operand 3 states and 713 transitions. [2024-11-12 12:39:57,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 478 flow [2024-11-12 12:39:57,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 222 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:39:57,130 INFO L231 Difference]: Finished difference. Result has 224 places, 222 transitions, 452 flow [2024-11-12 12:39:57,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=224, PETRI_TRANSITIONS=222} [2024-11-12 12:39:57,132 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -34 predicate places. [2024-11-12 12:39:57,132 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 222 transitions, 452 flow [2024-11-12 12:39:57,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 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:39:57,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:57,133 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] [2024-11-12 12:39:57,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:39:57,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:57,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:57,134 INFO L85 PathProgramCache]: Analyzing trace with hash -710149956, now seen corresponding path program 1 times [2024-11-12 12:39:57,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:57,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480546658] [2024-11-12 12:39:57,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:57,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:57,186 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:39:57,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:57,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480546658] [2024-11-12 12:39:57,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480546658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:57,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:57,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:57,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4073349] [2024-11-12 12:39:57,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:57,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:57,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:57,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:57,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:57,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 283 [2024-11-12 12:39:57,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 222 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 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:39:57,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:57,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 283 [2024-11-12 12:39:57,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:57,248 INFO L124 PetriNetUnfolderBase]: 11/330 cut-off events. [2024-11-12 12:39:57,249 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-12 12:39:57,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 330 events. 11/330 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 685 event pairs, 5 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 315. Up to 23 conditions per place. [2024-11-12 12:39:57,250 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 11 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2024-11-12 12:39:57,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 221 transitions, 476 flow [2024-11-12 12:39:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-11-12 12:39:57,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.839811542991755 [2024-11-12 12:39:57,253 INFO L175 Difference]: Start difference. First operand has 224 places, 222 transitions, 452 flow. Second operand 3 states and 713 transitions. [2024-11-12 12:39:57,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 221 transitions, 476 flow [2024-11-12 12:39:57,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 221 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:39:57,255 INFO L231 Difference]: Finished difference. Result has 223 places, 221 transitions, 450 flow [2024-11-12 12:39:57,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=223, PETRI_TRANSITIONS=221} [2024-11-12 12:39:57,257 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -35 predicate places. [2024-11-12 12:39:57,257 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 221 transitions, 450 flow [2024-11-12 12:39:57,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 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:39:57,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:57,258 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] [2024-11-12 12:39:57,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:39:57,259 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:57,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1158118004, now seen corresponding path program 1 times [2024-11-12 12:39:57,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:57,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731880128] [2024-11-12 12:39:57,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:57,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:57,295 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:39:57,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:57,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731880128] [2024-11-12 12:39:57,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731880128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:57,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:57,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:57,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234129825] [2024-11-12 12:39:57,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:57,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:57,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:57,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:57,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:57,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 283 [2024-11-12 12:39:57,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 221 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 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:39:57,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:57,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 283 [2024-11-12 12:39:57,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:57,346 INFO L124 PetriNetUnfolderBase]: 11/335 cut-off events. [2024-11-12 12:39:57,346 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-12 12:39:57,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 335 events. 11/335 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 720 event pairs, 2 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 312. Up to 14 conditions per place. [2024-11-12 12:39:57,348 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 12 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2024-11-12 12:39:57,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 224 transitions, 485 flow [2024-11-12 12:39:57,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-11-12 12:39:57,350 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8551236749116607 [2024-11-12 12:39:57,350 INFO L175 Difference]: Start difference. First operand has 223 places, 221 transitions, 450 flow. Second operand 3 states and 726 transitions. [2024-11-12 12:39:57,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 224 transitions, 485 flow [2024-11-12 12:39:57,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 224 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:39:57,353 INFO L231 Difference]: Finished difference. Result has 223 places, 221 transitions, 454 flow [2024-11-12 12:39:57,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=223, PETRI_TRANSITIONS=221} [2024-11-12 12:39:57,353 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -35 predicate places. [2024-11-12 12:39:57,354 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 221 transitions, 454 flow [2024-11-12 12:39:57,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 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:39:57,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:57,354 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] [2024-11-12 12:39:57,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:39:57,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:57,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:57,357 INFO L85 PathProgramCache]: Analyzing trace with hash -628586001, now seen corresponding path program 1 times [2024-11-12 12:39:57,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:57,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938908267] [2024-11-12 12:39:57,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:57,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:57,402 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:39:57,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:57,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938908267] [2024-11-12 12:39:57,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938908267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:57,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:57,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:57,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891974179] [2024-11-12 12:39:57,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:57,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:57,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:57,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:57,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:57,412 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 283 [2024-11-12 12:39:57,413 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 221 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 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:39:57,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:57,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 283 [2024-11-12 12:39:57,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:57,462 INFO L124 PetriNetUnfolderBase]: 11/334 cut-off events. [2024-11-12 12:39:57,463 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2024-11-12 12:39:57,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 334 events. 11/334 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 719 event pairs, 5 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 171. Up to 25 conditions per place. [2024-11-12 12:39:57,464 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 11 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2024-11-12 12:39:57,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 220 transitions, 478 flow [2024-11-12 12:39:57,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2024-11-12 12:39:57,466 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8421672555948174 [2024-11-12 12:39:57,466 INFO L175 Difference]: Start difference. First operand has 223 places, 221 transitions, 454 flow. Second operand 3 states and 715 transitions. [2024-11-12 12:39:57,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 220 transitions, 478 flow [2024-11-12 12:39:57,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 220 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:39:57,470 INFO L231 Difference]: Finished difference. Result has 223 places, 220 transitions, 454 flow [2024-11-12 12:39:57,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=223, PETRI_TRANSITIONS=220} [2024-11-12 12:39:57,472 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -35 predicate places. [2024-11-12 12:39:57,472 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 220 transitions, 454 flow [2024-11-12 12:39:57,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 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:39:57,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:57,473 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] [2024-11-12 12:39:57,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:39:57,473 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:57,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:57,474 INFO L85 PathProgramCache]: Analyzing trace with hash -147244050, now seen corresponding path program 1 times [2024-11-12 12:39:57,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:57,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616021594] [2024-11-12 12:39:57,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:57,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:57,516 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:39:57,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:57,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616021594] [2024-11-12 12:39:57,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616021594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:57,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:57,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:57,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802284936] [2024-11-12 12:39:57,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:57,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:57,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:57,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:57,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:57,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 283 [2024-11-12 12:39:57,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 220 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 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:39:57,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:57,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 283 [2024-11-12 12:39:57,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:57,570 INFO L124 PetriNetUnfolderBase]: 11/333 cut-off events. [2024-11-12 12:39:57,570 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-12 12:39:57,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 333 events. 11/333 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 717 event pairs, 5 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 311. Up to 23 conditions per place. [2024-11-12 12:39:57,572 INFO L140 encePairwiseOnDemand]: 281/283 looper letters, 10 selfloop transitions, 1 changer transitions 0/219 dead transitions. [2024-11-12 12:39:57,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 219 transitions, 474 flow [2024-11-12 12:39:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:57,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2024-11-12 12:39:57,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.850412249705536 [2024-11-12 12:39:57,575 INFO L175 Difference]: Start difference. First operand has 223 places, 220 transitions, 454 flow. Second operand 3 states and 722 transitions. [2024-11-12 12:39:57,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 219 transitions, 474 flow [2024-11-12 12:39:57,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 219 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:39:57,579 INFO L231 Difference]: Finished difference. Result has 222 places, 219 transitions, 450 flow [2024-11-12 12:39:57,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=222, PETRI_TRANSITIONS=219} [2024-11-12 12:39:57,580 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -36 predicate places. [2024-11-12 12:39:57,580 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 219 transitions, 450 flow [2024-11-12 12:39:57,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 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:39:57,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:57,581 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] [2024-11-12 12:39:57,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:39:57,581 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:57,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:57,583 INFO L85 PathProgramCache]: Analyzing trace with hash -918052658, now seen corresponding path program 1 times [2024-11-12 12:39:57,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:57,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646764624] [2024-11-12 12:39:57,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:57,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:58,035 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:39:58,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:58,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646764624] [2024-11-12 12:39:58,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646764624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:58,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:58,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:39:58,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107425710] [2024-11-12 12:39:58,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:58,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:39:58,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:58,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:39:58,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:39:58,104 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 283 [2024-11-12 12:39:58,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 219 transitions, 450 flow. Second operand has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 0 states have call successors, (0), 0 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:39:58,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:58,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 283 [2024-11-12 12:39:58,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:58,156 INFO L124 PetriNetUnfolderBase]: 11/332 cut-off events. [2024-11-12 12:39:58,156 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-12 12:39:58,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 332 events. 11/332 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 719 event pairs, 5 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 320. Up to 30 conditions per place. [2024-11-12 12:39:58,159 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 16 selfloop transitions, 5 changer transitions 0/218 dead transitions. [2024-11-12 12:39:58,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 218 transitions, 490 flow [2024-11-12 12:39:58,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:39:58,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:39:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1383 transitions. [2024-11-12 12:39:58,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8144876325088339 [2024-11-12 12:39:58,162 INFO L175 Difference]: Start difference. First operand has 222 places, 219 transitions, 450 flow. Second operand 6 states and 1383 transitions. [2024-11-12 12:39:58,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 218 transitions, 490 flow [2024-11-12 12:39:58,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 218 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:39:58,164 INFO L231 Difference]: Finished difference. Result has 225 places, 218 transitions, 457 flow [2024-11-12 12:39:58,164 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=457, PETRI_PLACES=225, PETRI_TRANSITIONS=218} [2024-11-12 12:39:58,165 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -33 predicate places. [2024-11-12 12:39:58,165 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 218 transitions, 457 flow [2024-11-12 12:39:58,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 0 states have call successors, (0), 0 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:39:58,166 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:58,166 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] [2024-11-12 12:39:58,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:39:58,166 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:58,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:58,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1002850852, now seen corresponding path program 1 times [2024-11-12 12:39:58,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:58,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984862512] [2024-11-12 12:39:58,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:58,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:58,209 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:39:58,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:58,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984862512] [2024-11-12 12:39:58,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984862512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:58,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:58,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:58,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252896671] [2024-11-12 12:39:58,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:58,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:58,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:58,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:58,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:58,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 283 [2024-11-12 12:39:58,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 218 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 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:39:58,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:58,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 283 [2024-11-12 12:39:58,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:58,257 INFO L124 PetriNetUnfolderBase]: 11/331 cut-off events. [2024-11-12 12:39:58,257 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-12 12:39:58,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 331 events. 11/331 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 715 event pairs, 5 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 361. Up to 25 conditions per place. [2024-11-12 12:39:58,259 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 11 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2024-11-12 12:39:58,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 217 transitions, 481 flow [2024-11-12 12:39:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2024-11-12 12:39:58,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8421672555948174 [2024-11-12 12:39:58,260 INFO L175 Difference]: Start difference. First operand has 225 places, 218 transitions, 457 flow. Second operand 3 states and 715 transitions. [2024-11-12 12:39:58,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 217 transitions, 481 flow [2024-11-12 12:39:58,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 217 transitions, 471 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:39:58,265 INFO L231 Difference]: Finished difference. Result has 221 places, 217 transitions, 449 flow [2024-11-12 12:39:58,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=449, PETRI_PLACES=221, PETRI_TRANSITIONS=217} [2024-11-12 12:39:58,266 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -37 predicate places. [2024-11-12 12:39:58,266 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 217 transitions, 449 flow [2024-11-12 12:39:58,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 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:39:58,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:58,266 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] [2024-11-12 12:39:58,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:39:58,267 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:58,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:58,267 INFO L85 PathProgramCache]: Analyzing trace with hash -13847569, now seen corresponding path program 1 times [2024-11-12 12:39:58,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:58,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748751406] [2024-11-12 12:39:58,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:58,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:58,306 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:39:58,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:58,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748751406] [2024-11-12 12:39:58,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748751406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:58,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:58,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:58,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994412761] [2024-11-12 12:39:58,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:58,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:58,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:58,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:58,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:58,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 283 [2024-11-12 12:39:58,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 217 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 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:39:58,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:58,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 283 [2024-11-12 12:39:58,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:58,353 INFO L124 PetriNetUnfolderBase]: 19/304 cut-off events. [2024-11-12 12:39:58,354 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-12 12:39:58,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 304 events. 19/304 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 730 event pairs, 9 based on Foata normal form. 1/263 useless extension candidates. Maximal degree in co-relation 304. Up to 38 conditions per place. [2024-11-12 12:39:58,355 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 12 selfloop transitions, 1 changer transitions 2/214 dead transitions. [2024-11-12 12:39:58,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 214 transitions, 471 flow [2024-11-12 12:39:58,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:58,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions. [2024-11-12 12:39:58,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8351001177856302 [2024-11-12 12:39:58,357 INFO L175 Difference]: Start difference. First operand has 221 places, 217 transitions, 449 flow. Second operand 3 states and 709 transitions. [2024-11-12 12:39:58,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 214 transitions, 471 flow [2024-11-12 12:39:58,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 214 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:39:58,359 INFO L231 Difference]: Finished difference. Result has 218 places, 212 transitions, 437 flow [2024-11-12 12:39:58,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=218, PETRI_TRANSITIONS=212} [2024-11-12 12:39:58,361 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -40 predicate places. [2024-11-12 12:39:58,361 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 212 transitions, 437 flow [2024-11-12 12:39:58,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 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:39:58,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:58,362 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] [2024-11-12 12:39:58,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:39:58,362 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:58,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:58,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2038542540, now seen corresponding path program 1 times [2024-11-12 12:39:58,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:58,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181230674] [2024-11-12 12:39:58,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:58,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:58,401 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:39:58,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:58,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181230674] [2024-11-12 12:39:58,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181230674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:58,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:58,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:58,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113053144] [2024-11-12 12:39:58,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:58,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:58,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:58,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:58,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:58,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 283 [2024-11-12 12:39:58,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 212 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 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:39:58,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:58,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 283 [2024-11-12 12:39:58,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:58,464 INFO L124 PetriNetUnfolderBase]: 33/383 cut-off events. [2024-11-12 12:39:58,464 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2024-11-12 12:39:58,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 383 events. 33/383 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1219 event pairs, 9 based on Foata normal form. 1/337 useless extension candidates. Maximal degree in co-relation 419. Up to 38 conditions per place. [2024-11-12 12:39:58,466 INFO L140 encePairwiseOnDemand]: 275/283 looper letters, 14 selfloop transitions, 5 changer transitions 0/212 dead transitions. [2024-11-12 12:39:58,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 212 transitions, 480 flow [2024-11-12 12:39:58,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:58,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:58,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2024-11-12 12:39:58,468 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8362779740871613 [2024-11-12 12:39:58,468 INFO L175 Difference]: Start difference. First operand has 218 places, 212 transitions, 437 flow. Second operand 3 states and 710 transitions. [2024-11-12 12:39:58,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 212 transitions, 480 flow [2024-11-12 12:39:58,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 212 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:39:58,470 INFO L231 Difference]: Finished difference. Result has 214 places, 209 transitions, 440 flow [2024-11-12 12:39:58,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=214, PETRI_TRANSITIONS=209} [2024-11-12 12:39:58,471 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -44 predicate places. [2024-11-12 12:39:58,471 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 209 transitions, 440 flow [2024-11-12 12:39:58,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 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:39:58,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:58,472 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] [2024-11-12 12:39:58,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:39:58,472 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:58,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:58,473 INFO L85 PathProgramCache]: Analyzing trace with hash -534258377, now seen corresponding path program 1 times [2024-11-12 12:39:58,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:58,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825052139] [2024-11-12 12:39:58,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:58,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:58,505 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:39:58,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:58,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825052139] [2024-11-12 12:39:58,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825052139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:58,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:58,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:58,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117244685] [2024-11-12 12:39:58,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:58,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:58,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:58,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:58,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:58,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 283 [2024-11-12 12:39:58,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 209 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 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:39:58,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:58,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 283 [2024-11-12 12:39:58,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:58,586 INFO L124 PetriNetUnfolderBase]: 54/511 cut-off events. [2024-11-12 12:39:58,586 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-12 12:39:58,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664 conditions, 511 events. 54/511 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2048 event pairs, 10 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 599. Up to 87 conditions per place. [2024-11-12 12:39:58,589 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 19 selfloop transitions, 3 changer transitions 0/213 dead transitions. [2024-11-12 12:39:58,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 213 transitions, 495 flow [2024-11-12 12:39:58,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:58,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:58,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-11-12 12:39:58,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8445229681978799 [2024-11-12 12:39:58,591 INFO L175 Difference]: Start difference. First operand has 214 places, 209 transitions, 440 flow. Second operand 3 states and 717 transitions. [2024-11-12 12:39:58,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 213 transitions, 495 flow [2024-11-12 12:39:58,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 213 transitions, 485 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:39:58,594 INFO L231 Difference]: Finished difference. Result has 212 places, 209 transitions, 445 flow [2024-11-12 12:39:58,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=212, PETRI_TRANSITIONS=209} [2024-11-12 12:39:58,594 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -46 predicate places. [2024-11-12 12:39:58,595 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 209 transitions, 445 flow [2024-11-12 12:39:58,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 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:39:58,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:58,595 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] [2024-11-12 12:39:58,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:39:58,596 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:58,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:58,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2006488385, now seen corresponding path program 1 times [2024-11-12 12:39:58,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:58,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693390020] [2024-11-12 12:39:58,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:58,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:58,621 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:39:58,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:58,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693390020] [2024-11-12 12:39:58,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693390020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:58,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:58,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:58,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064863807] [2024-11-12 12:39:58,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:58,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:58,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:58,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:58,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:58,638 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 283 [2024-11-12 12:39:58,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 209 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 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:39:58,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:58,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 283 [2024-11-12 12:39:58,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:58,700 INFO L124 PetriNetUnfolderBase]: 67/500 cut-off events. [2024-11-12 12:39:58,700 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-11-12 12:39:58,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 500 events. 67/500 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2095 event pairs, 29 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 604. Up to 100 conditions per place. [2024-11-12 12:39:58,702 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 16 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-11-12 12:39:58,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 211 transitions, 486 flow [2024-11-12 12:39:58,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-11-12 12:39:58,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8445229681978799 [2024-11-12 12:39:58,704 INFO L175 Difference]: Start difference. First operand has 212 places, 209 transitions, 445 flow. Second operand 3 states and 717 transitions. [2024-11-12 12:39:58,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 211 transitions, 486 flow [2024-11-12 12:39:58,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 211 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 12:39:58,707 INFO L231 Difference]: Finished difference. Result has 213 places, 208 transitions, 447 flow [2024-11-12 12:39:58,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=213, PETRI_TRANSITIONS=208} [2024-11-12 12:39:58,708 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -45 predicate places. [2024-11-12 12:39:58,708 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 208 transitions, 447 flow [2024-11-12 12:39:58,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 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:39:58,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:58,709 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] [2024-11-12 12:39:58,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:39:58,709 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:58,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:58,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1543167716, now seen corresponding path program 1 times [2024-11-12 12:39:58,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:58,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276666797] [2024-11-12 12:39:58,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:58,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:58,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:39:58,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:58,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276666797] [2024-11-12 12:39:58,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276666797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:58,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:58,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:58,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232523027] [2024-11-12 12:39:58,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:58,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:58,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:58,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:58,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:58,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 283 [2024-11-12 12:39:58,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 208 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 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:39:58,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:58,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 283 [2024-11-12 12:39:58,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:58,810 INFO L124 PetriNetUnfolderBase]: 57/455 cut-off events. [2024-11-12 12:39:58,810 INFO L125 PetriNetUnfolderBase]: For 35/37 co-relation queries the response was YES. [2024-11-12 12:39:58,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 455 events. 57/455 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1722 event pairs, 23 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 574. Up to 81 conditions per place. [2024-11-12 12:39:58,813 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 17 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2024-11-12 12:39:58,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 210 transitions, 494 flow [2024-11-12 12:39:58,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-11-12 12:39:58,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8409893992932862 [2024-11-12 12:39:58,815 INFO L175 Difference]: Start difference. First operand has 213 places, 208 transitions, 447 flow. Second operand 3 states and 714 transitions. [2024-11-12 12:39:58,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 210 transitions, 494 flow [2024-11-12 12:39:58,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 210 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:39:58,818 INFO L231 Difference]: Finished difference. Result has 212 places, 207 transitions, 445 flow [2024-11-12 12:39:58,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=212, PETRI_TRANSITIONS=207} [2024-11-12 12:39:58,819 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -46 predicate places. [2024-11-12 12:39:58,819 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 207 transitions, 445 flow [2024-11-12 12:39:58,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 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:39:58,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:58,820 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] [2024-11-12 12:39:58,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:39:58,820 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:58,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:58,821 INFO L85 PathProgramCache]: Analyzing trace with hash 245581245, now seen corresponding path program 1 times [2024-11-12 12:39:58,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:58,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103253880] [2024-11-12 12:39:58,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:58,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:58,853 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:39:58,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:58,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103253880] [2024-11-12 12:39:58,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103253880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:58,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:58,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:58,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654560753] [2024-11-12 12:39:58,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:58,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:58,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:58,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:58,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:58,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 283 [2024-11-12 12:39:58,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 207 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 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:39:58,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:58,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 283 [2024-11-12 12:39:58,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:58,929 INFO L124 PetriNetUnfolderBase]: 57/452 cut-off events. [2024-11-12 12:39:58,929 INFO L125 PetriNetUnfolderBase]: For 38/43 co-relation queries the response was YES. [2024-11-12 12:39:58,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 452 events. 57/452 cut-off events. For 38/43 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1700 event pairs, 23 based on Foata normal form. 1/408 useless extension candidates. Maximal degree in co-relation 571. Up to 81 conditions per place. [2024-11-12 12:39:58,931 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 17 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2024-11-12 12:39:58,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 209 transitions, 492 flow [2024-11-12 12:39:58,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:58,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:58,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-11-12 12:39:58,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8409893992932862 [2024-11-12 12:39:58,933 INFO L175 Difference]: Start difference. First operand has 212 places, 207 transitions, 445 flow. Second operand 3 states and 714 transitions. [2024-11-12 12:39:58,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 209 transitions, 492 flow [2024-11-12 12:39:58,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 209 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:39:58,937 INFO L231 Difference]: Finished difference. Result has 211 places, 206 transitions, 443 flow [2024-11-12 12:39:58,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=211, PETRI_TRANSITIONS=206} [2024-11-12 12:39:58,938 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -47 predicate places. [2024-11-12 12:39:58,938 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 206 transitions, 443 flow [2024-11-12 12:39:58,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 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:39:58,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:58,939 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] [2024-11-12 12:39:58,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:39:58,939 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:58,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash 2033307138, now seen corresponding path program 1 times [2024-11-12 12:39:58,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:58,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067480099] [2024-11-12 12:39:58,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:58,972 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:39:58,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:58,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067480099] [2024-11-12 12:39:58,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067480099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:58,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:58,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:58,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824336938] [2024-11-12 12:39:58,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:58,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:58,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:58,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:58,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:58,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 283 [2024-11-12 12:39:58,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 206 transitions, 443 flow. Second operand has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 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:39:58,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:58,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 283 [2024-11-12 12:39:58,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:59,044 INFO L124 PetriNetUnfolderBase]: 62/482 cut-off events. [2024-11-12 12:39:59,045 INFO L125 PetriNetUnfolderBase]: For 23/24 co-relation queries the response was YES. [2024-11-12 12:39:59,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 482 events. 62/482 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1881 event pairs, 19 based on Foata normal form. 1/442 useless extension candidates. Maximal degree in co-relation 574. Up to 69 conditions per place. [2024-11-12 12:39:59,048 INFO L140 encePairwiseOnDemand]: 278/283 looper letters, 13 selfloop transitions, 2 changer transitions 4/207 dead transitions. [2024-11-12 12:39:59,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 207 transitions, 478 flow [2024-11-12 12:39:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2024-11-12 12:39:59,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433451118963486 [2024-11-12 12:39:59,050 INFO L175 Difference]: Start difference. First operand has 211 places, 206 transitions, 443 flow. Second operand 3 states and 716 transitions. [2024-11-12 12:39:59,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 207 transitions, 478 flow [2024-11-12 12:39:59,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 207 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:39:59,053 INFO L231 Difference]: Finished difference. Result has 209 places, 200 transitions, 431 flow [2024-11-12 12:39:59,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=209, PETRI_TRANSITIONS=200} [2024-11-12 12:39:59,054 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -49 predicate places. [2024-11-12 12:39:59,054 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 200 transitions, 431 flow [2024-11-12 12:39:59,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 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:39:59,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:59,055 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] [2024-11-12 12:39:59,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 12:39:59,055 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:59,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:59,056 INFO L85 PathProgramCache]: Analyzing trace with hash -774411579, now seen corresponding path program 1 times [2024-11-12 12:39:59,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:59,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890802220] [2024-11-12 12:39:59,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:59,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:59,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:59,085 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:39:59,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:59,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890802220] [2024-11-12 12:39:59,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890802220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:59,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:59,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:59,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863613187] [2024-11-12 12:39:59,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:59,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:59,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:59,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:59,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:59,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 283 [2024-11-12 12:39:59,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 200 transitions, 431 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 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:39:59,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:59,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 283 [2024-11-12 12:39:59,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:59,152 INFO L124 PetriNetUnfolderBase]: 82/489 cut-off events. [2024-11-12 12:39:59,152 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2024-11-12 12:39:59,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 489 events. 82/489 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1955 event pairs, 29 based on Foata normal form. 0/457 useless extension candidates. Maximal degree in co-relation 634. Up to 107 conditions per place. [2024-11-12 12:39:59,154 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 15 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2024-11-12 12:39:59,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 202 transitions, 470 flow [2024-11-12 12:39:59,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:59,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:59,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2024-11-12 12:39:59,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433451118963486 [2024-11-12 12:39:59,156 INFO L175 Difference]: Start difference. First operand has 209 places, 200 transitions, 431 flow. Second operand 3 states and 716 transitions. [2024-11-12 12:39:59,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 202 transitions, 470 flow [2024-11-12 12:39:59,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:39:59,158 INFO L231 Difference]: Finished difference. Result has 204 places, 199 transitions, 429 flow [2024-11-12 12:39:59,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=204, PETRI_TRANSITIONS=199} [2024-11-12 12:39:59,159 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -54 predicate places. [2024-11-12 12:39:59,159 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 199 transitions, 429 flow [2024-11-12 12:39:59,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 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:39:59,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:59,160 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] [2024-11-12 12:39:59,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 12:39:59,160 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:59,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:59,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2070120009, now seen corresponding path program 1 times [2024-11-12 12:39:59,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:59,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152676457] [2024-11-12 12:39:59,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:59,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:59,273 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:39:59,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:59,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152676457] [2024-11-12 12:39:59,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152676457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:59,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:59,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:39:59,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149121816] [2024-11-12 12:39:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:59,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:59,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:59,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:59,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:59,280 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 283 [2024-11-12 12:39:59,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 199 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 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:39:59,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:59,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 283 [2024-11-12 12:39:59,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:59,316 INFO L124 PetriNetUnfolderBase]: 24/384 cut-off events. [2024-11-12 12:39:59,316 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-12 12:39:59,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 384 events. 24/384 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1059 event pairs, 3 based on Foata normal form. 1/360 useless extension candidates. Maximal degree in co-relation 414. Up to 34 conditions per place. [2024-11-12 12:39:59,318 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 12 selfloop transitions, 3 changer transitions 0/202 dead transitions. [2024-11-12 12:39:59,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 202 transitions, 466 flow [2024-11-12 12:39:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-11-12 12:39:59,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8551236749116607 [2024-11-12 12:39:59,319 INFO L175 Difference]: Start difference. First operand has 204 places, 199 transitions, 429 flow. Second operand 3 states and 726 transitions. [2024-11-12 12:39:59,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 202 transitions, 466 flow [2024-11-12 12:39:59,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:39:59,322 INFO L231 Difference]: Finished difference. Result has 205 places, 201 transitions, 444 flow [2024-11-12 12:39:59,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=205, PETRI_TRANSITIONS=201} [2024-11-12 12:39:59,323 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -53 predicate places. [2024-11-12 12:39:59,323 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 201 transitions, 444 flow [2024-11-12 12:39:59,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 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:39:59,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:59,323 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] [2024-11-12 12:39:59,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 12:39:59,324 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:59,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:59,324 INFO L85 PathProgramCache]: Analyzing trace with hash 298511383, now seen corresponding path program 1 times [2024-11-12 12:39:59,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:59,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099438974] [2024-11-12 12:39:59,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:59,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:59,356 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:39:59,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:59,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099438974] [2024-11-12 12:39:59,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099438974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:59,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:59,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:59,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596450632] [2024-11-12 12:39:59,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:59,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:59,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:59,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:59,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:59,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 283 [2024-11-12 12:39:59,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 201 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 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:39:59,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:59,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 283 [2024-11-12 12:39:59,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:59,411 INFO L124 PetriNetUnfolderBase]: 37/397 cut-off events. [2024-11-12 12:39:59,411 INFO L125 PetriNetUnfolderBase]: For 52/59 co-relation queries the response was YES. [2024-11-12 12:39:59,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 540 conditions, 397 events. 37/397 cut-off events. For 52/59 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1273 event pairs, 8 based on Foata normal form. 1/381 useless extension candidates. Maximal degree in co-relation 473. Up to 41 conditions per place. [2024-11-12 12:39:59,413 INFO L140 encePairwiseOnDemand]: 278/283 looper letters, 13 selfloop transitions, 2 changer transitions 4/202 dead transitions. [2024-11-12 12:39:59,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 202 transitions, 485 flow [2024-11-12 12:39:59,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2024-11-12 12:39:59,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457008244994111 [2024-11-12 12:39:59,415 INFO L175 Difference]: Start difference. First operand has 205 places, 201 transitions, 444 flow. Second operand 3 states and 718 transitions. [2024-11-12 12:39:59,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 202 transitions, 485 flow [2024-11-12 12:39:59,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 482 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:39:59,418 INFO L231 Difference]: Finished difference. Result has 204 places, 195 transitions, 432 flow [2024-11-12 12:39:59,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=204, PETRI_TRANSITIONS=195} [2024-11-12 12:39:59,418 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -54 predicate places. [2024-11-12 12:39:59,418 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 195 transitions, 432 flow [2024-11-12 12:39:59,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 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:39:59,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:39:59,419 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] [2024-11-12 12:39:59,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-12 12:39:59,419 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-12 12:39:59,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:39:59,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1705391268, now seen corresponding path program 1 times [2024-11-12 12:39:59,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:39:59,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181353297] [2024-11-12 12:39:59,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:39:59,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:39:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:39:59,453 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:39:59,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:39:59,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181353297] [2024-11-12 12:39:59,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181353297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:39:59,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:39:59,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:39:59,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138905277] [2024-11-12 12:39:59,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:39:59,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:39:59,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:39:59,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:39:59,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:39:59,465 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 283 [2024-11-12 12:39:59,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 195 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 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:39:59,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:39:59,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 283 [2024-11-12 12:39:59,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:39:59,519 INFO L124 PetriNetUnfolderBase]: 40/391 cut-off events. [2024-11-12 12:39:59,520 INFO L125 PetriNetUnfolderBase]: For 60/67 co-relation queries the response was YES. [2024-11-12 12:39:59,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 391 events. 40/391 cut-off events. For 60/67 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1217 event pairs, 12 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 486. Up to 61 conditions per place. [2024-11-12 12:39:59,521 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 0 selfloop transitions, 0 changer transitions 197/197 dead transitions. [2024-11-12 12:39:59,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 197 transitions, 475 flow [2024-11-12 12:39:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:39:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:39:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-11-12 12:39:59,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8445229681978799 [2024-11-12 12:39:59,523 INFO L175 Difference]: Start difference. First operand has 204 places, 195 transitions, 432 flow. Second operand 3 states and 717 transitions. [2024-11-12 12:39:59,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 197 transitions, 475 flow [2024-11-12 12:39:59,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 197 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:39:59,525 INFO L231 Difference]: Finished difference. Result has 199 places, 0 transitions, 0 flow [2024-11-12 12:39:59,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=199, PETRI_TRANSITIONS=0} [2024-11-12 12:39:59,526 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -59 predicate places. [2024-11-12 12:39:59,526 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 0 transitions, 0 flow [2024-11-12 12:39:59,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 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:39:59,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2024-11-12 12:39:59,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2024-11-12 12:39:59,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2024-11-12 12:39:59,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2024-11-12 12:39:59,529 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2024-11-12 12:39:59,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2024-11-12 12:39:59,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2024-11-12 12:39:59,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2024-11-12 12:39:59,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2024-11-12 12:39:59,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2024-11-12 12:39:59,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2024-11-12 12:39:59,530 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2024-11-12 12:39:59,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2024-11-12 12:39:59,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2024-11-12 12:39:59,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2024-11-12 12:39:59,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2024-11-12 12:39:59,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2024-11-12 12:39:59,531 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2024-11-12 12:39:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2024-11-12 12:39:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2024-11-12 12:39:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2024-11-12 12:39:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2024-11-12 12:39:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2024-11-12 12:39:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2024-11-12 12:39:59,532 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2024-11-12 12:39:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2024-11-12 12:39:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2024-11-12 12:39:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2024-11-12 12:39:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2024-11-12 12:39:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2024-11-12 12:39:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2024-11-12 12:39:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2024-11-12 12:39:59,533 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2024-11-12 12:39:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2024-11-12 12:39:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2024-11-12 12:39:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2024-11-12 12:39:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2024-11-12 12:39:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2024-11-12 12:39:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2024-11-12 12:39:59,534 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2024-11-12 12:39:59,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2024-11-12 12:39:59,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2024-11-12 12:39:59,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2024-11-12 12:39:59,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2024-11-12 12:39:59,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2024-11-12 12:39:59,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2024-11-12 12:39:59,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2024-11-12 12:39:59,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2024-11-12 12:39:59,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2024-11-12 12:39:59,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2024-11-12 12:39:59,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2024-11-12 12:39:59,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2024-11-12 12:39:59,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2024-11-12 12:39:59,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 94 remaining) [2024-11-12 12:39:59,536 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2024-11-12 12:39:59,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (38 of 94 remaining) [2024-11-12 12:39:59,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2024-11-12 12:39:59,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2024-11-12 12:39:59,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2024-11-12 12:39:59,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2024-11-12 12:39:59,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2024-11-12 12:39:59,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2024-11-12 12:39:59,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2024-11-12 12:39:59,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2024-11-12 12:39:59,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2024-11-12 12:39:59,537 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2024-11-12 12:39:59,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2024-11-12 12:39:59,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2024-11-12 12:39:59,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2024-11-12 12:39:59,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2024-11-12 12:39:59,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2024-11-12 12:39:59,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2024-11-12 12:39:59,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2024-11-12 12:39:59,538 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2024-11-12 12:39:59,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2024-11-12 12:39:59,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2024-11-12 12:39:59,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2024-11-12 12:39:59,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2024-11-12 12:39:59,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2024-11-12 12:39:59,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2024-11-12 12:39:59,539 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2024-11-12 12:39:59,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2024-11-12 12:39:59,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2024-11-12 12:39:59,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2024-11-12 12:39:59,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2024-11-12 12:39:59,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2024-11-12 12:39:59,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2024-11-12 12:39:59,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2024-11-12 12:39:59,540 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2024-11-12 12:39:59,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2024-11-12 12:39:59,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2024-11-12 12:39:59,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2024-11-12 12:39:59,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2024-11-12 12:39:59,541 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2024-11-12 12:39:59,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-12 12:39:59,542 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] [2024-11-12 12:39:59,546 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 12:39:59,547 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:39:59,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:39:59 BasicIcfg [2024-11-12 12:39:59,551 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:39:59,551 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:39:59,551 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:39:59,551 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:39:59,552 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:39:56" (3/4) ... [2024-11-12 12:39:59,553 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 12:39:59,555 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-12 12:39:59,555 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-12 12:39:59,559 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-12 12:39:59,559 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 12:39:59,559 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 12:39:59,559 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 12:39:59,634 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:39:59,634 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 12:39:59,634 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:39:59,635 INFO L158 Benchmark]: Toolchain (without parser) took 4636.00ms. Allocated memory was 134.2MB in the beginning and 274.7MB in the end (delta: 140.5MB). Free memory was 65.2MB in the beginning and 214.4MB in the end (delta: -149.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:39:59,635 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 134.2MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:39:59,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.78ms. Allocated memory is still 134.2MB. Free memory was 64.9MB in the beginning and 50.5MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 12:39:59,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.28ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 50.5MB in the beginning and 150.0MB in the end (delta: -99.5MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2024-11-12 12:39:59,636 INFO L158 Benchmark]: Boogie Preprocessor took 39.17ms. Allocated memory is still 180.4MB. Free memory was 150.0MB in the beginning and 147.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:39:59,636 INFO L158 Benchmark]: RCFGBuilder took 852.28ms. Allocated memory is still 180.4MB. Free memory was 147.9MB in the beginning and 67.1MB in the end (delta: 80.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. [2024-11-12 12:39:59,636 INFO L158 Benchmark]: TraceAbstraction took 3351.77ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 67.1MB in the beginning and 220.7MB in the end (delta: -153.6MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2024-11-12 12:39:59,636 INFO L158 Benchmark]: Witness Printer took 83.58ms. Allocated memory is still 274.7MB. Free memory was 220.7MB in the beginning and 214.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 12:39:59,640 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.10ms. Allocated memory is still 134.2MB. Free memory is still 93.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.78ms. Allocated memory is still 134.2MB. Free memory was 64.9MB in the beginning and 50.5MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.28ms. Allocated memory was 134.2MB in the beginning and 180.4MB in the end (delta: 46.1MB). Free memory was 50.5MB in the beginning and 150.0MB in the end (delta: -99.5MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.17ms. Allocated memory is still 180.4MB. Free memory was 150.0MB in the beginning and 147.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 852.28ms. Allocated memory is still 180.4MB. Free memory was 147.9MB in the beginning and 67.1MB in the end (delta: 80.7MB). Peak memory consumption was 79.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3351.77ms. Allocated memory was 180.4MB in the beginning and 274.7MB in the end (delta: 94.4MB). Free memory was 67.1MB in the beginning and 220.7MB in the end (delta: -153.6MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * Witness Printer took 83.58ms. Allocated memory is still 274.7MB. Free memory was 220.7MB in the beginning and 214.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: 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: 55]: 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: 55]: 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: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 374 locations, 94 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.2s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 419 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 650 IncrementalHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 78 mSDtfsCounter, 650 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=534occurred in iteration=0, InterpolantAutomatonStates: 63, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1799 NumberOfCodeBlocks, 1799 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1779 ConstructedInterpolants, 0 QuantifiedInterpolants, 2060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 53 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-12 12:39:59,666 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