./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/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.dd.update-z3-fca748b-m [2024-11-20 13:55:51,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 13:55:51,938 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-20 13:55:51,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 13:55:51,945 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 13:55:51,978 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 13:55:51,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 13:55:51,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 13:55:51,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 13:55:51,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 13:55:51,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 13:55:51,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 13:55:51,982 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 13:55:51,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 13:55:51,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 13:55:51,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 13:55:51,983 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 13:55:51,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 13:55:51,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 13:55:51,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 13:55:51,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 13:55:51,989 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 13:55:51,989 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-20 13:55:51,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 13:55:51,990 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 13:55:51,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 13:55:51,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 13:55:51,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 13:55:51,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 13:55:51,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 13:55:51,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 13:55:51,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:55:51,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 13:55:51,993 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 13:55:51,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 13:55:51,993 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 13:55:51,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 13:55:51,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 13:55:51,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 13:55:51,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 13:55:51,995 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 13:55:51,995 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-20 13:55:52,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 13:55:52,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 13:55:52,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 13:55:52,306 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 13:55:52,307 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 13:55:52,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2024-11-20 13:55:53,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 13:55:53,882 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 13:55:53,883 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2024-11-20 13:55:53,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/247661e15/90a6f534570e4f409a2b134b37182444/FLAG56b66b523 [2024-11-20 13:55:53,902 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/247661e15/90a6f534570e4f409a2b134b37182444 [2024-11-20 13:55:53,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 13:55:53,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 13:55:53,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 13:55:53,907 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 13:55:53,911 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 13:55:53,912 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:55:53" (1/1) ... [2024-11-20 13:55:53,912 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a973ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:53, skipping insertion in model container [2024-11-20 13:55:53,913 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:55:53" (1/1) ... [2024-11-20 13:55:53,933 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 13:55:54,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:55:54,216 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 13:55:54,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:55:54,266 INFO L204 MainTranslator]: Completed translation [2024-11-20 13:55:54,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:54 WrapperNode [2024-11-20 13:55:54,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 13:55:54,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 13:55:54,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 13:55:54,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 13:55:54,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:54" (1/1) ... [2024-11-20 13:55:54,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:54" (1/1) ... [2024-11-20 13:55:54,312 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 329 [2024-11-20 13:55:54,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 13:55:54,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 13:55:54,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 13:55:54,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 13:55:54,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:54" (1/1) ... [2024-11-20 13:55:54,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:54" (1/1) ... [2024-11-20 13:55:54,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:54" (1/1) ... [2024-11-20 13:55:54,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:54" (1/1) ... [2024-11-20 13:55:54,354 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:54" (1/1) ... [2024-11-20 13:55:54,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:54" (1/1) ... [2024-11-20 13:55:54,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:54" (1/1) ... [2024-11-20 13:55:54,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:54" (1/1) ... [2024-11-20 13:55:54,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 13:55:54,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 13:55:54,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 13:55:54,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 13:55:54,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:54" (1/1) ... [2024-11-20 13:55:54,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:55:54,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:55:54,414 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-20 13:55:54,419 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-20 13:55:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 13:55:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-20 13:55:54,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-20 13:55:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-20 13:55:54,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-20 13:55:54,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 13:55:54,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 13:55:54,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 13:55:54,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 13:55:54,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 13:55:54,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 13:55:54,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 13:55:54,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-20 13:55:54,474 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 13:55:54,604 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 13:55:54,607 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 13:55:55,253 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 13:55:55,253 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 13:55:55,577 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 13:55:55,579 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-20 13:55:55,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:55:55 BoogieIcfgContainer [2024-11-20 13:55:55,579 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 13:55:55,582 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 13:55:55,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 13:55:55,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 13:55:55,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:55:53" (1/3) ... [2024-11-20 13:55:55,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e474b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:55:55, skipping insertion in model container [2024-11-20 13:55:55,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:55:54" (2/3) ... [2024-11-20 13:55:55,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e474b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:55:55, skipping insertion in model container [2024-11-20 13:55:55,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:55:55" (3/3) ... [2024-11-20 13:55:55,589 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2024-11-20 13:55:55,606 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 13:55:55,606 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2024-11-20 13:55:55,606 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 13:55:55,720 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-20 13:55:55,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 283 transitions, 580 flow [2024-11-20 13:55:55,887 INFO L124 PetriNetUnfolderBase]: 12/281 cut-off events. [2024-11-20 13:55:55,887 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 13:55:55,895 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-20 13:55:55,896 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 283 transitions, 580 flow [2024-11-20 13:55:55,904 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 261 transitions, 534 flow [2024-11-20 13:55:55,917 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 13:55:55,924 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;@5ccd6899, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 13:55:55,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-11-20 13:55:55,933 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 13:55:55,933 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-20 13:55:55,933 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:55:55,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:55,934 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:55,935 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-20 13:55:55,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:55,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1679605482, now seen corresponding path program 1 times [2024-11-20 13:55:55,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:55,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236139031] [2024-11-20 13:55:55,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:55,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:56,132 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-20 13:55:56,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:56,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236139031] [2024-11-20 13:55:56,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236139031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:56,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:56,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:56,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649031364] [2024-11-20 13:55:56,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:56,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:56,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:56,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:56,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:56,216 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 283 [2024-11-20 13:55:56,220 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-20 13:55:56,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:56,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 283 [2024-11-20 13:55:56,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:56,363 INFO L124 PetriNetUnfolderBase]: 21/395 cut-off events. [2024-11-20 13:55:56,364 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-11-20 13:55:56,366 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-20 13:55:56,369 INFO L140 encePairwiseOnDemand]: 247/283 looper letters, 13 selfloop transitions, 2 changer transitions 3/227 dead transitions. [2024-11-20 13:55:56,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 227 transitions, 496 flow [2024-11-20 13:55:56,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:56,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2024-11-20 13:55:56,388 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8739693757361602 [2024-11-20 13:55:56,390 INFO L175 Difference]: Start difference. First operand has 258 places, 261 transitions, 534 flow. Second operand 3 states and 742 transitions. [2024-11-20 13:55:56,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 227 transitions, 496 flow [2024-11-20 13:55:56,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 227 transitions, 488 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-20 13:55:56,402 INFO L231 Difference]: Finished difference. Result has 229 places, 224 transitions, 456 flow [2024-11-20 13:55:56,406 INFO L260 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-20 13:55:56,410 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -29 predicate places. [2024-11-20 13:55:56,413 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 224 transitions, 456 flow [2024-11-20 13:55:56,413 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-20 13:55:56,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:56,414 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:56,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 13:55:56,415 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-20 13:55:56,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:56,416 INFO L85 PathProgramCache]: Analyzing trace with hash 819081452, now seen corresponding path program 1 times [2024-11-20 13:55:56,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:56,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665338791] [2024-11-20 13:55:56,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:56,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:56,482 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-20 13:55:56,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:56,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665338791] [2024-11-20 13:55:56,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665338791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:56,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:56,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:56,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863114098] [2024-11-20 13:55:56,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:56,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:56,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:56,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:56,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:56,510 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 283 [2024-11-20 13:55:56,512 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-20 13:55:56,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:56,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 283 [2024-11-20 13:55:56,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:56,577 INFO L124 PetriNetUnfolderBase]: 12/307 cut-off events. [2024-11-20 13:55:56,578 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-20 13:55:56,580 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-20 13:55:56,583 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 13 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2024-11-20 13:55:56,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 223 transitions, 484 flow [2024-11-20 13:55:56,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:56,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions. [2024-11-20 13:55:56,590 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8351001177856302 [2024-11-20 13:55:56,591 INFO L175 Difference]: Start difference. First operand has 229 places, 224 transitions, 456 flow. Second operand 3 states and 709 transitions. [2024-11-20 13:55:56,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 223 transitions, 484 flow [2024-11-20 13:55:56,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 223 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:56,598 INFO L231 Difference]: Finished difference. Result has 225 places, 223 transitions, 454 flow [2024-11-20 13:55:56,600 INFO L260 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-20 13:55:56,601 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -33 predicate places. [2024-11-20 13:55:56,601 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 223 transitions, 454 flow [2024-11-20 13:55:56,602 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-20 13:55:56,602 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:56,602 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:56,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 13:55:56,603 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-20 13:55:56,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:56,604 INFO L85 PathProgramCache]: Analyzing trace with hash 513969531, now seen corresponding path program 1 times [2024-11-20 13:55:56,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:56,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863273385] [2024-11-20 13:55:56,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:56,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:56,671 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-20 13:55:56,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:56,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863273385] [2024-11-20 13:55:56,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863273385] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:56,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:56,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:56,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37399017] [2024-11-20 13:55:56,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:56,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:56,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:56,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:56,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:56,691 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 283 [2024-11-20 13:55:56,692 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-20 13:55:56,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:56,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 283 [2024-11-20 13:55:56,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:56,791 INFO L124 PetriNetUnfolderBase]: 11/331 cut-off events. [2024-11-20 13:55:56,792 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-20 13:55:56,794 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-20 13:55:56,796 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 11 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-11-20 13:55:56,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 478 flow [2024-11-20 13:55:56,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:56,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-11-20 13:55:56,799 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.839811542991755 [2024-11-20 13:55:56,799 INFO L175 Difference]: Start difference. First operand has 225 places, 223 transitions, 454 flow. Second operand 3 states and 713 transitions. [2024-11-20 13:55:56,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 478 flow [2024-11-20 13:55:56,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 222 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:56,805 INFO L231 Difference]: Finished difference. Result has 224 places, 222 transitions, 452 flow [2024-11-20 13:55:56,806 INFO L260 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-20 13:55:56,807 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -34 predicate places. [2024-11-20 13:55:56,808 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 222 transitions, 452 flow [2024-11-20 13:55:56,809 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-20 13:55:56,809 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:56,809 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:56,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 13:55:56,810 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-20 13:55:56,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:56,811 INFO L85 PathProgramCache]: Analyzing trace with hash -710149956, now seen corresponding path program 1 times [2024-11-20 13:55:56,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:56,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402840240] [2024-11-20 13:55:56,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:56,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:56,868 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-20 13:55:56,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:56,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402840240] [2024-11-20 13:55:56,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402840240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:56,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:56,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:56,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348839556] [2024-11-20 13:55:56,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:56,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:56,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:56,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:56,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:56,888 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 283 [2024-11-20 13:55:56,890 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-20 13:55:56,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:56,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 283 [2024-11-20 13:55:56,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:56,956 INFO L124 PetriNetUnfolderBase]: 11/330 cut-off events. [2024-11-20 13:55:56,956 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-20 13:55:56,958 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-20 13:55:56,959 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 11 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2024-11-20 13:55:56,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 221 transitions, 476 flow [2024-11-20 13:55:56,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:56,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:56,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2024-11-20 13:55:56,962 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.839811542991755 [2024-11-20 13:55:56,962 INFO L175 Difference]: Start difference. First operand has 224 places, 222 transitions, 452 flow. Second operand 3 states and 713 transitions. [2024-11-20 13:55:56,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 221 transitions, 476 flow [2024-11-20 13:55:56,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 221 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:56,966 INFO L231 Difference]: Finished difference. Result has 223 places, 221 transitions, 450 flow [2024-11-20 13:55:56,967 INFO L260 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-20 13:55:56,967 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -35 predicate places. [2024-11-20 13:55:56,968 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 221 transitions, 450 flow [2024-11-20 13:55:56,968 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-20 13:55:56,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:56,969 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:56,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 13:55:56,969 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-20 13:55:56,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:56,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1158118004, now seen corresponding path program 1 times [2024-11-20 13:55:56,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:56,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427146080] [2024-11-20 13:55:56,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:56,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:57,008 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-20 13:55:57,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:57,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427146080] [2024-11-20 13:55:57,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427146080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:57,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:57,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:57,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116049515] [2024-11-20 13:55:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:57,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:57,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:57,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:57,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:57,026 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 283 [2024-11-20 13:55:57,027 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-20 13:55:57,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:57,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 283 [2024-11-20 13:55:57,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:57,103 INFO L124 PetriNetUnfolderBase]: 11/335 cut-off events. [2024-11-20 13:55:57,103 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-20 13:55:57,104 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-20 13:55:57,106 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 12 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2024-11-20 13:55:57,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 224 transitions, 485 flow [2024-11-20 13:55:57,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-11-20 13:55:57,108 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8551236749116607 [2024-11-20 13:55:57,108 INFO L175 Difference]: Start difference. First operand has 223 places, 221 transitions, 450 flow. Second operand 3 states and 726 transitions. [2024-11-20 13:55:57,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 224 transitions, 485 flow [2024-11-20 13:55:57,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 224 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:57,113 INFO L231 Difference]: Finished difference. Result has 223 places, 221 transitions, 454 flow [2024-11-20 13:55:57,114 INFO L260 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-20 13:55:57,114 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -35 predicate places. [2024-11-20 13:55:57,114 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 221 transitions, 454 flow [2024-11-20 13:55:57,115 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-20 13:55:57,115 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:57,116 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:57,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 13:55:57,116 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-20 13:55:57,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash -628586001, now seen corresponding path program 1 times [2024-11-20 13:55:57,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:57,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8969679] [2024-11-20 13:55:57,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:57,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:57,175 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-20 13:55:57,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:57,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8969679] [2024-11-20 13:55:57,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8969679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:57,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:57,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596004019] [2024-11-20 13:55:57,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:57,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:57,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:57,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:57,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:57,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 283 [2024-11-20 13:55:57,197 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-20 13:55:57,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:57,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 283 [2024-11-20 13:55:57,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:57,262 INFO L124 PetriNetUnfolderBase]: 11/334 cut-off events. [2024-11-20 13:55:57,263 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2024-11-20 13:55:57,264 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-20 13:55:57,265 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 11 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2024-11-20 13:55:57,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 220 transitions, 478 flow [2024-11-20 13:55:57,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:57,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2024-11-20 13:55:57,268 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8421672555948174 [2024-11-20 13:55:57,269 INFO L175 Difference]: Start difference. First operand has 223 places, 221 transitions, 454 flow. Second operand 3 states and 715 transitions. [2024-11-20 13:55:57,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 220 transitions, 478 flow [2024-11-20 13:55:57,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 220 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:55:57,273 INFO L231 Difference]: Finished difference. Result has 223 places, 220 transitions, 454 flow [2024-11-20 13:55:57,274 INFO L260 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-20 13:55:57,274 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -35 predicate places. [2024-11-20 13:55:57,275 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 220 transitions, 454 flow [2024-11-20 13:55:57,275 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-20 13:55:57,275 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:57,276 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:57,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 13:55:57,276 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-20 13:55:57,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash -147244050, now seen corresponding path program 1 times [2024-11-20 13:55:57,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:57,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331480029] [2024-11-20 13:55:57,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:57,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:57,334 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-20 13:55:57,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:57,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331480029] [2024-11-20 13:55:57,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331480029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:57,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:57,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:57,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63509933] [2024-11-20 13:55:57,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:57,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:57,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:57,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:57,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:57,346 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 283 [2024-11-20 13:55:57,348 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-20 13:55:57,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:57,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 283 [2024-11-20 13:55:57,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:57,408 INFO L124 PetriNetUnfolderBase]: 11/333 cut-off events. [2024-11-20 13:55:57,409 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-20 13:55:57,410 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-20 13:55:57,411 INFO L140 encePairwiseOnDemand]: 281/283 looper letters, 10 selfloop transitions, 1 changer transitions 0/219 dead transitions. [2024-11-20 13:55:57,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 219 transitions, 474 flow [2024-11-20 13:55:57,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2024-11-20 13:55:57,414 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.850412249705536 [2024-11-20 13:55:57,414 INFO L175 Difference]: Start difference. First operand has 223 places, 220 transitions, 454 flow. Second operand 3 states and 722 transitions. [2024-11-20 13:55:57,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 219 transitions, 474 flow [2024-11-20 13:55:57,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 219 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:57,418 INFO L231 Difference]: Finished difference. Result has 222 places, 219 transitions, 450 flow [2024-11-20 13:55:57,419 INFO L260 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-20 13:55:57,420 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -36 predicate places. [2024-11-20 13:55:57,420 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 219 transitions, 450 flow [2024-11-20 13:55:57,421 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-20 13:55:57,421 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:57,422 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:57,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 13:55:57,422 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-20 13:55:57,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:57,423 INFO L85 PathProgramCache]: Analyzing trace with hash -918052658, now seen corresponding path program 1 times [2024-11-20 13:55:57,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:57,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366706534] [2024-11-20 13:55:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:57,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:58,060 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-20 13:55:58,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:58,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366706534] [2024-11-20 13:55:58,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366706534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:58,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:58,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:55:58,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264128404] [2024-11-20 13:55:58,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:58,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:55:58,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:58,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:55:58,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:55:58,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 283 [2024-11-20 13:55:58,164 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-20 13:55:58,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:58,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 283 [2024-11-20 13:55:58,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:58,235 INFO L124 PetriNetUnfolderBase]: 11/332 cut-off events. [2024-11-20 13:55:58,235 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-20 13:55:58,236 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-20 13:55:58,238 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 16 selfloop transitions, 5 changer transitions 0/218 dead transitions. [2024-11-20 13:55:58,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 218 transitions, 490 flow [2024-11-20 13:55:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:55:58,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:55:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1383 transitions. [2024-11-20 13:55:58,243 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8144876325088339 [2024-11-20 13:55:58,243 INFO L175 Difference]: Start difference. First operand has 222 places, 219 transitions, 450 flow. Second operand 6 states and 1383 transitions. [2024-11-20 13:55:58,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 218 transitions, 490 flow [2024-11-20 13:55:58,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 218 transitions, 489 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:55:58,247 INFO L231 Difference]: Finished difference. Result has 225 places, 218 transitions, 457 flow [2024-11-20 13:55:58,248 INFO L260 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-20 13:55:58,250 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -33 predicate places. [2024-11-20 13:55:58,250 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 218 transitions, 457 flow [2024-11-20 13:55:58,252 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-20 13:55:58,252 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:58,252 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:58,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 13:55:58,253 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-20 13:55:58,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1002850852, now seen corresponding path program 1 times [2024-11-20 13:55:58,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:58,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476138940] [2024-11-20 13:55:58,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:58,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:58,304 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-20 13:55:58,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:58,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476138940] [2024-11-20 13:55:58,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476138940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:58,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:58,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:58,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242999031] [2024-11-20 13:55:58,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:58,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:58,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:58,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:58,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:58,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 283 [2024-11-20 13:55:58,318 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-20 13:55:58,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:58,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 283 [2024-11-20 13:55:58,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:58,366 INFO L124 PetriNetUnfolderBase]: 11/331 cut-off events. [2024-11-20 13:55:58,367 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-20 13:55:58,368 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-20 13:55:58,369 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 11 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2024-11-20 13:55:58,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 217 transitions, 481 flow [2024-11-20 13:55:58,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:58,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2024-11-20 13:55:58,371 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8421672555948174 [2024-11-20 13:55:58,371 INFO L175 Difference]: Start difference. First operand has 225 places, 218 transitions, 457 flow. Second operand 3 states and 715 transitions. [2024-11-20 13:55:58,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 217 transitions, 481 flow [2024-11-20 13:55:58,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 217 transitions, 471 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-20 13:55:58,375 INFO L231 Difference]: Finished difference. Result has 221 places, 217 transitions, 449 flow [2024-11-20 13:55:58,375 INFO L260 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-20 13:55:58,376 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -37 predicate places. [2024-11-20 13:55:58,376 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 217 transitions, 449 flow [2024-11-20 13:55:58,377 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-20 13:55:58,377 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:58,377 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:58,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 13:55:58,377 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-20 13:55:58,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:58,378 INFO L85 PathProgramCache]: Analyzing trace with hash -13847569, now seen corresponding path program 1 times [2024-11-20 13:55:58,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:58,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890455986] [2024-11-20 13:55:58,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:58,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:58,407 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-20 13:55:58,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:58,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890455986] [2024-11-20 13:55:58,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890455986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:58,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:58,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:58,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057703985] [2024-11-20 13:55:58,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:58,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:58,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:58,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:58,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:58,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 283 [2024-11-20 13:55:58,425 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-20 13:55:58,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:58,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 283 [2024-11-20 13:55:58,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:58,465 INFO L124 PetriNetUnfolderBase]: 19/304 cut-off events. [2024-11-20 13:55:58,466 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-20 13:55:58,467 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-20 13:55:58,468 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 12 selfloop transitions, 1 changer transitions 2/214 dead transitions. [2024-11-20 13:55:58,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 214 transitions, 471 flow [2024-11-20 13:55:58,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions. [2024-11-20 13:55:58,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8351001177856302 [2024-11-20 13:55:58,470 INFO L175 Difference]: Start difference. First operand has 221 places, 217 transitions, 449 flow. Second operand 3 states and 709 transitions. [2024-11-20 13:55:58,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 214 transitions, 471 flow [2024-11-20 13:55:58,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 214 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:58,474 INFO L231 Difference]: Finished difference. Result has 218 places, 212 transitions, 437 flow [2024-11-20 13:55:58,475 INFO L260 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-20 13:55:58,475 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -40 predicate places. [2024-11-20 13:55:58,475 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 212 transitions, 437 flow [2024-11-20 13:55:58,476 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-20 13:55:58,476 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:58,476 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:58,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 13:55:58,477 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-20 13:55:58,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:58,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2038542540, now seen corresponding path program 1 times [2024-11-20 13:55:58,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:58,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623499072] [2024-11-20 13:55:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:58,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:58,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-20 13:55:58,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:58,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623499072] [2024-11-20 13:55:58,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623499072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:58,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:58,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:58,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936417872] [2024-11-20 13:55:58,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:58,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:58,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:58,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:58,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:58,538 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 283 [2024-11-20 13:55:58,539 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-20 13:55:58,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:58,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 283 [2024-11-20 13:55:58,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:58,610 INFO L124 PetriNetUnfolderBase]: 33/383 cut-off events. [2024-11-20 13:55:58,610 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2024-11-20 13:55:58,611 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-20 13:55:58,612 INFO L140 encePairwiseOnDemand]: 275/283 looper letters, 14 selfloop transitions, 5 changer transitions 0/212 dead transitions. [2024-11-20 13:55:58,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 212 transitions, 480 flow [2024-11-20 13:55:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2024-11-20 13:55:58,615 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8362779740871613 [2024-11-20 13:55:58,615 INFO L175 Difference]: Start difference. First operand has 218 places, 212 transitions, 437 flow. Second operand 3 states and 710 transitions. [2024-11-20 13:55:58,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 212 transitions, 480 flow [2024-11-20 13:55:58,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 212 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:55:58,618 INFO L231 Difference]: Finished difference. Result has 214 places, 209 transitions, 440 flow [2024-11-20 13:55:58,619 INFO L260 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-20 13:55:58,619 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -44 predicate places. [2024-11-20 13:55:58,619 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 209 transitions, 440 flow [2024-11-20 13:55:58,620 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-20 13:55:58,620 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:58,620 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:58,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 13:55:58,621 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-20 13:55:58,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:58,621 INFO L85 PathProgramCache]: Analyzing trace with hash -534258377, now seen corresponding path program 1 times [2024-11-20 13:55:58,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:58,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889762179] [2024-11-20 13:55:58,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:58,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:58,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:58,658 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-20 13:55:58,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:58,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889762179] [2024-11-20 13:55:58,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889762179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:58,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:58,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:58,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726457159] [2024-11-20 13:55:58,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:58,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:58,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:58,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:58,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:58,674 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 283 [2024-11-20 13:55:58,676 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-20 13:55:58,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:58,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 283 [2024-11-20 13:55:58,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:58,746 INFO L124 PetriNetUnfolderBase]: 54/511 cut-off events. [2024-11-20 13:55:58,746 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-20 13:55:58,747 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-20 13:55:58,749 INFO L140 encePairwiseOnDemand]: 277/283 looper letters, 19 selfloop transitions, 3 changer transitions 0/213 dead transitions. [2024-11-20 13:55:58,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 213 transitions, 495 flow [2024-11-20 13:55:58,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:58,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-11-20 13:55:58,751 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8445229681978799 [2024-11-20 13:55:58,751 INFO L175 Difference]: Start difference. First operand has 214 places, 209 transitions, 440 flow. Second operand 3 states and 717 transitions. [2024-11-20 13:55:58,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 213 transitions, 495 flow [2024-11-20 13:55:58,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 213 transitions, 485 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:58,755 INFO L231 Difference]: Finished difference. Result has 212 places, 209 transitions, 445 flow [2024-11-20 13:55:58,756 INFO L260 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-20 13:55:58,756 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -46 predicate places. [2024-11-20 13:55:58,756 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 209 transitions, 445 flow [2024-11-20 13:55:58,757 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-20 13:55:58,757 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:58,757 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:58,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 13:55:58,758 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-20 13:55:58,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:58,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2006488385, now seen corresponding path program 1 times [2024-11-20 13:55:58,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:58,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865349855] [2024-11-20 13:55:58,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:58,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:58,790 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-20 13:55:58,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:58,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865349855] [2024-11-20 13:55:58,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865349855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:58,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:58,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:58,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236270343] [2024-11-20 13:55:58,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:58,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:58,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:58,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:58,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:58,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 283 [2024-11-20 13:55:58,815 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-20 13:55:58,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:58,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 283 [2024-11-20 13:55:58,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:58,891 INFO L124 PetriNetUnfolderBase]: 67/500 cut-off events. [2024-11-20 13:55:58,892 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-11-20 13:55:58,894 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-20 13:55:58,896 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 16 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-11-20 13:55:58,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 211 transitions, 486 flow [2024-11-20 13:55:58,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-11-20 13:55:58,898 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8445229681978799 [2024-11-20 13:55:58,898 INFO L175 Difference]: Start difference. First operand has 212 places, 209 transitions, 445 flow. Second operand 3 states and 717 transitions. [2024-11-20 13:55:58,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 211 transitions, 486 flow [2024-11-20 13:55:58,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 211 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:55:58,902 INFO L231 Difference]: Finished difference. Result has 213 places, 208 transitions, 447 flow [2024-11-20 13:55:58,902 INFO L260 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-20 13:55:58,903 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -45 predicate places. [2024-11-20 13:55:58,903 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 208 transitions, 447 flow [2024-11-20 13:55:58,904 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-20 13:55:58,904 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:58,904 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:58,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 13:55:58,904 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-20 13:55:58,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:58,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1543167716, now seen corresponding path program 1 times [2024-11-20 13:55:58,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:58,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935299471] [2024-11-20 13:55:58,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:58,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:55:58,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:58,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935299471] [2024-11-20 13:55:58,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935299471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:58,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:58,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:58,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403440173] [2024-11-20 13:55:58,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:58,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:58,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:58,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:58,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:58,971 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 283 [2024-11-20 13:55:58,972 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-20 13:55:58,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:58,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 283 [2024-11-20 13:55:58,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:59,059 INFO L124 PetriNetUnfolderBase]: 57/455 cut-off events. [2024-11-20 13:55:59,059 INFO L125 PetriNetUnfolderBase]: For 35/37 co-relation queries the response was YES. [2024-11-20 13:55:59,060 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-20 13:55:59,062 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 17 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2024-11-20 13:55:59,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 210 transitions, 494 flow [2024-11-20 13:55:59,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:59,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:59,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-11-20 13:55:59,065 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8409893992932862 [2024-11-20 13:55:59,065 INFO L175 Difference]: Start difference. First operand has 213 places, 208 transitions, 447 flow. Second operand 3 states and 714 transitions. [2024-11-20 13:55:59,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 210 transitions, 494 flow [2024-11-20 13:55:59,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 210 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:59,069 INFO L231 Difference]: Finished difference. Result has 212 places, 207 transitions, 445 flow [2024-11-20 13:55:59,069 INFO L260 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-20 13:55:59,070 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -46 predicate places. [2024-11-20 13:55:59,070 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 207 transitions, 445 flow [2024-11-20 13:55:59,070 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-20 13:55:59,070 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:59,071 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:59,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 13:55:59,071 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-20 13:55:59,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:59,071 INFO L85 PathProgramCache]: Analyzing trace with hash 245581245, now seen corresponding path program 1 times [2024-11-20 13:55:59,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:59,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262193099] [2024-11-20 13:55:59,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:59,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:59,108 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-20 13:55:59,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:59,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262193099] [2024-11-20 13:55:59,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262193099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:59,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:59,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:59,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729387086] [2024-11-20 13:55:59,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:59,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:59,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:59,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:59,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:59,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 283 [2024-11-20 13:55:59,136 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-20 13:55:59,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:59,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 283 [2024-11-20 13:55:59,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:59,205 INFO L124 PetriNetUnfolderBase]: 57/452 cut-off events. [2024-11-20 13:55:59,205 INFO L125 PetriNetUnfolderBase]: For 38/43 co-relation queries the response was YES. [2024-11-20 13:55:59,206 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-20 13:55:59,208 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 17 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2024-11-20 13:55:59,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 209 transitions, 492 flow [2024-11-20 13:55:59,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2024-11-20 13:55:59,210 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8409893992932862 [2024-11-20 13:55:59,210 INFO L175 Difference]: Start difference. First operand has 212 places, 207 transitions, 445 flow. Second operand 3 states and 714 transitions. [2024-11-20 13:55:59,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 209 transitions, 492 flow [2024-11-20 13:55:59,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 209 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:59,214 INFO L231 Difference]: Finished difference. Result has 211 places, 206 transitions, 443 flow [2024-11-20 13:55:59,215 INFO L260 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-20 13:55:59,215 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -47 predicate places. [2024-11-20 13:55:59,216 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 206 transitions, 443 flow [2024-11-20 13:55:59,216 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-20 13:55:59,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:59,216 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:59,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 13:55:59,217 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-20 13:55:59,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:59,217 INFO L85 PathProgramCache]: Analyzing trace with hash 2033307138, now seen corresponding path program 1 times [2024-11-20 13:55:59,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:59,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716248302] [2024-11-20 13:55:59,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:59,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:59,259 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-20 13:55:59,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:59,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716248302] [2024-11-20 13:55:59,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716248302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:59,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:59,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:59,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168278650] [2024-11-20 13:55:59,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:59,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:59,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:59,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:59,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:59,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 283 [2024-11-20 13:55:59,278 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-20 13:55:59,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:59,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 283 [2024-11-20 13:55:59,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:59,353 INFO L124 PetriNetUnfolderBase]: 62/482 cut-off events. [2024-11-20 13:55:59,353 INFO L125 PetriNetUnfolderBase]: For 23/24 co-relation queries the response was YES. [2024-11-20 13:55:59,354 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-20 13:55:59,356 INFO L140 encePairwiseOnDemand]: 278/283 looper letters, 13 selfloop transitions, 2 changer transitions 4/207 dead transitions. [2024-11-20 13:55:59,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 207 transitions, 478 flow [2024-11-20 13:55:59,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2024-11-20 13:55:59,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8433451118963486 [2024-11-20 13:55:59,359 INFO L175 Difference]: Start difference. First operand has 211 places, 206 transitions, 443 flow. Second operand 3 states and 716 transitions. [2024-11-20 13:55:59,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 207 transitions, 478 flow [2024-11-20 13:55:59,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 207 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:59,363 INFO L231 Difference]: Finished difference. Result has 209 places, 200 transitions, 431 flow [2024-11-20 13:55:59,363 INFO L260 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-20 13:55:59,363 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -49 predicate places. [2024-11-20 13:55:59,364 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 200 transitions, 431 flow [2024-11-20 13:55:59,364 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-20 13:55:59,364 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:59,365 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:59,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 13:55:59,365 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-20 13:55:59,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:59,366 INFO L85 PathProgramCache]: Analyzing trace with hash -774411579, now seen corresponding path program 1 times [2024-11-20 13:55:59,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:59,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79068485] [2024-11-20 13:55:59,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:59,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 13:55:59,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:59,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79068485] [2024-11-20 13:55:59,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79068485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:59,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:59,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:59,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401285316] [2024-11-20 13:55:59,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:59,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:59,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:59,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:59,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:59,427 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 283 [2024-11-20 13:55:59,428 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-20 13:55:59,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:59,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 283 [2024-11-20 13:55:59,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:59,534 INFO L124 PetriNetUnfolderBase]: 82/489 cut-off events. [2024-11-20 13:55:59,534 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2024-11-20 13:55:59,536 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-20 13:55:59,537 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 15 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2024-11-20 13:55:59,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 202 transitions, 470 flow [2024-11-20 13:55:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:59,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:59,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2024-11-20 13:55:59,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8433451118963486 [2024-11-20 13:55:59,540 INFO L175 Difference]: Start difference. First operand has 209 places, 200 transitions, 431 flow. Second operand 3 states and 716 transitions. [2024-11-20 13:55:59,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 202 transitions, 470 flow [2024-11-20 13:55:59,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:59,544 INFO L231 Difference]: Finished difference. Result has 204 places, 199 transitions, 429 flow [2024-11-20 13:55:59,544 INFO L260 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-20 13:55:59,545 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -54 predicate places. [2024-11-20 13:55:59,545 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 199 transitions, 429 flow [2024-11-20 13:55:59,545 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-20 13:55:59,546 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:59,546 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:59,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 13:55:59,546 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-20 13:55:59,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:59,547 INFO L85 PathProgramCache]: Analyzing trace with hash 2070120009, now seen corresponding path program 1 times [2024-11-20 13:55:59,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:59,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547111805] [2024-11-20 13:55:59,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:59,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:59,699 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-20 13:55:59,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:59,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547111805] [2024-11-20 13:55:59,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547111805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:59,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:59,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 13:55:59,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028649755] [2024-11-20 13:55:59,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:59,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:59,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:59,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:59,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:59,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 283 [2024-11-20 13:55:59,708 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-20 13:55:59,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:59,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 283 [2024-11-20 13:55:59,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:59,756 INFO L124 PetriNetUnfolderBase]: 24/384 cut-off events. [2024-11-20 13:55:59,756 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-20 13:55:59,758 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-20 13:55:59,759 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 12 selfloop transitions, 3 changer transitions 0/202 dead transitions. [2024-11-20 13:55:59,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 202 transitions, 466 flow [2024-11-20 13:55:59,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:59,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2024-11-20 13:55:59,761 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8551236749116607 [2024-11-20 13:55:59,761 INFO L175 Difference]: Start difference. First operand has 204 places, 199 transitions, 429 flow. Second operand 3 states and 726 transitions. [2024-11-20 13:55:59,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 202 transitions, 466 flow [2024-11-20 13:55:59,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:55:59,766 INFO L231 Difference]: Finished difference. Result has 205 places, 201 transitions, 444 flow [2024-11-20 13:55:59,766 INFO L260 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-20 13:55:59,767 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -53 predicate places. [2024-11-20 13:55:59,767 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 201 transitions, 444 flow [2024-11-20 13:55:59,768 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-20 13:55:59,768 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:59,768 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:55:59,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 13:55:59,768 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-20 13:55:59,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:59,769 INFO L85 PathProgramCache]: Analyzing trace with hash 298511383, now seen corresponding path program 1 times [2024-11-20 13:55:59,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:59,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936545315] [2024-11-20 13:55:59,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:59,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:59,815 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-20 13:55:59,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:59,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936545315] [2024-11-20 13:55:59,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936545315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:59,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:59,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:59,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603518538] [2024-11-20 13:55:59,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:59,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:59,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:59,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:59,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:59,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 283 [2024-11-20 13:55:59,828 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-20 13:55:59,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:59,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 283 [2024-11-20 13:55:59,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:55:59,888 INFO L124 PetriNetUnfolderBase]: 37/397 cut-off events. [2024-11-20 13:55:59,888 INFO L125 PetriNetUnfolderBase]: For 52/59 co-relation queries the response was YES. [2024-11-20 13:55:59,889 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-20 13:55:59,890 INFO L140 encePairwiseOnDemand]: 278/283 looper letters, 13 selfloop transitions, 2 changer transitions 4/202 dead transitions. [2024-11-20 13:55:59,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 202 transitions, 485 flow [2024-11-20 13:55:59,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:55:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:55:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2024-11-20 13:55:59,892 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8457008244994111 [2024-11-20 13:55:59,892 INFO L175 Difference]: Start difference. First operand has 205 places, 201 transitions, 444 flow. Second operand 3 states and 718 transitions. [2024-11-20 13:55:59,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 202 transitions, 485 flow [2024-11-20 13:55:59,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 482 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:55:59,896 INFO L231 Difference]: Finished difference. Result has 204 places, 195 transitions, 432 flow [2024-11-20 13:55:59,897 INFO L260 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-20 13:55:59,897 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -54 predicate places. [2024-11-20 13:55:59,898 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 195 transitions, 432 flow [2024-11-20 13:55:59,898 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-20 13:55:59,898 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:55:59,898 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:55:59,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 13:55:59,899 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-20 13:55:59,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:55:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1705391268, now seen corresponding path program 1 times [2024-11-20 13:55:59,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:55:59,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075105858] [2024-11-20 13:55:59,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:55:59,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:55:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:55:59,983 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-20 13:55:59,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:55:59,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075105858] [2024-11-20 13:55:59,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075105858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:55:59,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:55:59,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:55:59,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748234712] [2024-11-20 13:55:59,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:55:59,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:55:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:55:59,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:55:59,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:55:59,998 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 283 [2024-11-20 13:55:59,999 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-20 13:55:59,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:55:59,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 283 [2024-11-20 13:55:59,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:56:00,054 INFO L124 PetriNetUnfolderBase]: 40/391 cut-off events. [2024-11-20 13:56:00,054 INFO L125 PetriNetUnfolderBase]: For 60/67 co-relation queries the response was YES. [2024-11-20 13:56:00,056 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-20 13:56:00,056 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 0 selfloop transitions, 0 changer transitions 197/197 dead transitions. [2024-11-20 13:56:00,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 197 transitions, 475 flow [2024-11-20 13:56:00,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:56:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:56:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2024-11-20 13:56:00,058 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8445229681978799 [2024-11-20 13:56:00,058 INFO L175 Difference]: Start difference. First operand has 204 places, 195 transitions, 432 flow. Second operand 3 states and 717 transitions. [2024-11-20 13:56:00,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 197 transitions, 475 flow [2024-11-20 13:56:00,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 197 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:56:00,061 INFO L231 Difference]: Finished difference. Result has 199 places, 0 transitions, 0 flow [2024-11-20 13:56:00,061 INFO L260 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-20 13:56:00,062 INFO L277 CegarLoopForPetriNet]: 258 programPoint places, -59 predicate places. [2024-11-20 13:56:00,062 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 0 transitions, 0 flow [2024-11-20 13:56:00,063 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-20 13:56:00,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2024-11-20 13:56:00,065 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2024-11-20 13:56:00,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2024-11-20 13:56:00,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2024-11-20 13:56:00,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2024-11-20 13:56:00,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2024-11-20 13:56:00,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2024-11-20 13:56:00,066 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2024-11-20 13:56:00,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2024-11-20 13:56:00,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2024-11-20 13:56:00,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2024-11-20 13:56:00,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2024-11-20 13:56:00,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2024-11-20 13:56:00,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2024-11-20 13:56:00,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2024-11-20 13:56:00,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2024-11-20 13:56:00,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2024-11-20 13:56:00,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2024-11-20 13:56:00,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2024-11-20 13:56:00,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2024-11-20 13:56:00,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2024-11-20 13:56:00,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2024-11-20 13:56:00,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2024-11-20 13:56:00,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2024-11-20 13:56:00,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2024-11-20 13:56:00,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2024-11-20 13:56:00,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2024-11-20 13:56:00,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2024-11-20 13:56:00,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2024-11-20 13:56:00,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2024-11-20 13:56:00,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2024-11-20 13:56:00,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2024-11-20 13:56:00,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2024-11-20 13:56:00,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2024-11-20 13:56:00,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2024-11-20 13:56:00,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2024-11-20 13:56:00,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2024-11-20 13:56:00,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2024-11-20 13:56:00,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2024-11-20 13:56:00,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2024-11-20 13:56:00,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2024-11-20 13:56:00,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2024-11-20 13:56:00,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2024-11-20 13:56:00,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2024-11-20 13:56:00,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2024-11-20 13:56:00,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2024-11-20 13:56:00,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2024-11-20 13:56:00,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2024-11-20 13:56:00,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2024-11-20 13:56:00,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2024-11-20 13:56:00,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2024-11-20 13:56:00,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2024-11-20 13:56:00,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2024-11-20 13:56:00,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 94 remaining) [2024-11-20 13:56:00,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2024-11-20 13:56:00,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (38 of 94 remaining) [2024-11-20 13:56:00,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2024-11-20 13:56:00,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2024-11-20 13:56:00,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2024-11-20 13:56:00,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2024-11-20 13:56:00,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2024-11-20 13:56:00,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2024-11-20 13:56:00,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2024-11-20 13:56:00,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2024-11-20 13:56:00,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2024-11-20 13:56:00,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2024-11-20 13:56:00,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2024-11-20 13:56:00,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2024-11-20 13:56:00,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2024-11-20 13:56:00,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2024-11-20 13:56:00,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2024-11-20 13:56:00,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2024-11-20 13:56:00,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2024-11-20 13:56:00,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2024-11-20 13:56:00,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2024-11-20 13:56:00,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2024-11-20 13:56:00,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2024-11-20 13:56:00,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2024-11-20 13:56:00,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2024-11-20 13:56:00,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2024-11-20 13:56:00,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2024-11-20 13:56:00,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2024-11-20 13:56:00,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2024-11-20 13:56:00,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2024-11-20 13:56:00,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2024-11-20 13:56:00,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2024-11-20 13:56:00,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2024-11-20 13:56:00,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2024-11-20 13:56:00,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2024-11-20 13:56:00,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2024-11-20 13:56:00,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2024-11-20 13:56:00,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2024-11-20 13:56:00,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2024-11-20 13:56:00,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2024-11-20 13:56:00,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 13:56:00,079 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:56:00,085 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 13:56:00,085 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 13:56:00,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:56:00 BasicIcfg [2024-11-20 13:56:00,091 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 13:56:00,091 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 13:56:00,091 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 13:56:00,091 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 13:56:00,092 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:55:55" (3/4) ... [2024-11-20 13:56:00,094 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 13:56:00,097 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-20 13:56:00,097 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-20 13:56:00,102 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-20 13:56:00,103 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-20 13:56:00,103 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-20 13:56:00,104 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-20 13:56:00,193 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 13:56:00,194 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 13:56:00,194 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 13:56:00,195 INFO L158 Benchmark]: Toolchain (without parser) took 6289.34ms. Allocated memory was 146.8MB in the beginning and 310.4MB in the end (delta: 163.6MB). Free memory was 95.8MB in the beginning and 218.5MB in the end (delta: -122.7MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2024-11-20 13:56:00,195 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 13:56:00,195 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.46ms. Allocated memory is still 146.8MB. Free memory was 95.4MB in the beginning and 81.1MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 13:56:00,195 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.50ms. Allocated memory is still 146.8MB. Free memory was 80.8MB in the beginning and 78.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 13:56:00,198 INFO L158 Benchmark]: Boogie Preprocessor took 56.97ms. Allocated memory is still 146.8MB. Free memory was 78.2MB in the beginning and 75.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 13:56:00,198 INFO L158 Benchmark]: RCFGBuilder took 1207.83ms. Allocated memory was 146.8MB in the beginning and 182.5MB in the end (delta: 35.7MB). Free memory was 75.8MB in the beginning and 83.7MB in the end (delta: -7.9MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2024-11-20 13:56:00,199 INFO L158 Benchmark]: TraceAbstraction took 4508.55ms. Allocated memory was 182.5MB in the beginning and 310.4MB in the end (delta: 127.9MB). Free memory was 82.6MB in the beginning and 224.8MB in the end (delta: -142.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 13:56:00,200 INFO L158 Benchmark]: Witness Printer took 102.97ms. Allocated memory is still 310.4MB. Free memory was 224.8MB in the beginning and 218.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 13:56:00,204 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 146.8MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.46ms. Allocated memory is still 146.8MB. Free memory was 95.4MB in the beginning and 81.1MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.50ms. Allocated memory is still 146.8MB. Free memory was 80.8MB in the beginning and 78.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.97ms. Allocated memory is still 146.8MB. Free memory was 78.2MB in the beginning and 75.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1207.83ms. Allocated memory was 146.8MB in the beginning and 182.5MB in the end (delta: 35.7MB). Free memory was 75.8MB in the beginning and 83.7MB in the end (delta: -7.9MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4508.55ms. Allocated memory was 182.5MB in the beginning and 310.4MB in the end (delta: 127.9MB). Free memory was 82.6MB in the beginning and 224.8MB in the end (delta: -142.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 102.97ms. Allocated memory is still 310.4MB. Free memory was 224.8MB in the beginning and 218.5MB 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: 4.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 419 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.7s 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.2s SatisfiabilityAnalysisTime, 1.3s 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-20 13:56:00,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE