./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-dot-product.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 39e90898aa78f5642c5c7d6f9df6b2e15e069a046a9465d5d61576c4b07f46b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:59:15,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:59:15,226 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:59:15,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:59:15,232 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:59:15,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:59:15,254 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:59:15,254 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:59:15,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:59:15,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:59:15,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:59:15,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:59:15,257 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:59:15,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:59:15,259 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:59:15,259 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:59:15,259 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:59:15,259 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:59:15,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:59:15,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:59:15,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:59:15,263 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:59:15,263 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:59:15,263 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:59:15,263 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:59:15,264 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:59:15,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:59:15,264 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:59:15,264 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:59:15,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:59:15,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:59:15,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:59:15,265 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:59:15,265 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:59:15,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:59:15,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:59:15,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:59:15,266 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:59:15,266 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:59:15,266 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:59:15,266 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:59:15,267 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 -> 39e90898aa78f5642c5c7d6f9df6b2e15e069a046a9465d5d61576c4b07f46b8 [2024-11-19 05:59:15,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:59:15,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:59:15,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:59:15,488 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:59:15,489 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:59:15,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c [2024-11-19 05:59:16,729 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:59:16,873 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:59:16,874 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c [2024-11-19 05:59:16,884 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfdac1018/374d6e5b61c94c5a881a58847032d499/FLAGdc1047ba4 [2024-11-19 05:59:16,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfdac1018/374d6e5b61c94c5a881a58847032d499 [2024-11-19 05:59:16,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:59:16,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:59:16,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:59:16,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:59:16,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:59:16,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:59:16" (1/1) ... [2024-11-19 05:59:16,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c418488 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:16, skipping insertion in model container [2024-11-19 05:59:16,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:59:16" (1/1) ... [2024-11-19 05:59:16,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:59:17,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:59:17,189 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:59:17,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:59:17,232 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:59:17,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:17 WrapperNode [2024-11-19 05:59:17,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:59:17,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:59:17,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:59:17,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:59:17,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:17" (1/1) ... [2024-11-19 05:59:17,252 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:17" (1/1) ... [2024-11-19 05:59:17,284 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 23, statements flattened = 421 [2024-11-19 05:59:17,284 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:59:17,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:59:17,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:59:17,285 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:59:17,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:17" (1/1) ... [2024-11-19 05:59:17,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:17" (1/1) ... [2024-11-19 05:59:17,306 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:17" (1/1) ... [2024-11-19 05:59:17,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:17" (1/1) ... [2024-11-19 05:59:17,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:17" (1/1) ... [2024-11-19 05:59:17,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:17" (1/1) ... [2024-11-19 05:59:17,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:17" (1/1) ... [2024-11-19 05:59:17,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:17" (1/1) ... [2024-11-19 05:59:17,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:59:17,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:59:17,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:59:17,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:59:17,344 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:17" (1/1) ... [2024-11-19 05:59:17,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:59:17,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:59:17,381 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-19 05:59:17,385 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-19 05:59:17,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:59:17,425 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:59:17,426 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:59:17,426 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:59:17,426 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:59:17,426 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:59:17,426 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:59:17,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:59:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:59:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 05:59:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 05:59:17,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:59:17,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:59:17,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:59:17,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:59:17,429 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:59:17,525 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:59:17,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:59:18,024 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:59:18,025 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:59:18,230 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:59:18,231 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-19 05:59:18,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:59:18 BoogieIcfgContainer [2024-11-19 05:59:18,232 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:59:18,234 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:59:18,234 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:59:18,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:59:18,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:59:16" (1/3) ... [2024-11-19 05:59:18,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a353c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:59:18, skipping insertion in model container [2024-11-19 05:59:18,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:17" (2/3) ... [2024-11-19 05:59:18,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a353c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:59:18, skipping insertion in model container [2024-11-19 05:59:18,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:59:18" (3/3) ... [2024-11-19 05:59:18,239 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product.wvr.c [2024-11-19 05:59:18,252 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:59:18,253 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2024-11-19 05:59:18,253 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:59:18,353 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:59:18,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 413 transitions, 847 flow [2024-11-19 05:59:18,511 INFO L124 PetriNetUnfolderBase]: 26/410 cut-off events. [2024-11-19 05:59:18,512 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 05:59:18,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 410 events. 26/410 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 814 event pairs, 0 based on Foata normal form. 0/339 useless extension candidates. Maximal degree in co-relation 322. Up to 2 conditions per place. [2024-11-19 05:59:18,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 397 places, 413 transitions, 847 flow [2024-11-19 05:59:18,532 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 378 places, 393 transitions, 804 flow [2024-11-19 05:59:18,541 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:59:18,545 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;@13b468ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:59:18,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2024-11-19 05:59:18,549 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:59:18,549 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-11-19 05:59:18,549 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:59:18,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:18,550 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-19 05:59:18,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:18,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:18,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1319536759, now seen corresponding path program 1 times [2024-11-19 05:59:18,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:18,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260458458] [2024-11-19 05:59:18,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:18,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:18,691 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-19 05:59:18,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:18,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260458458] [2024-11-19 05:59:18,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260458458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:18,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:18,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:18,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069568472] [2024-11-19 05:59:18,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:18,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:18,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:18,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:18,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:18,769 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 413 [2024-11-19 05:59:18,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 393 transitions, 804 flow. Second operand has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 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-19 05:59:18,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:18,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 413 [2024-11-19 05:59:18,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:18,985 INFO L124 PetriNetUnfolderBase]: 75/1119 cut-off events. [2024-11-19 05:59:18,986 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-19 05:59:18,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 1119 events. 75/1119 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5976 event pairs, 38 based on Foata normal form. 80/1016 useless extension candidates. Maximal degree in co-relation 712. Up to 92 conditions per place. [2024-11-19 05:59:18,998 INFO L140 encePairwiseOnDemand]: 382/413 looper letters, 16 selfloop transitions, 2 changer transitions 5/364 dead transitions. [2024-11-19 05:59:18,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 364 transitions, 782 flow [2024-11-19 05:59:19,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:19,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:19,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-11-19 05:59:19,018 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9168684422921711 [2024-11-19 05:59:19,021 INFO L175 Difference]: Start difference. First operand has 378 places, 393 transitions, 804 flow. Second operand 3 states and 1136 transitions. [2024-11-19 05:59:19,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 364 transitions, 782 flow [2024-11-19 05:59:19,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 364 transitions, 770 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 05:59:19,030 INFO L231 Difference]: Finished difference. Result has 361 places, 359 transitions, 728 flow [2024-11-19 05:59:19,033 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=734, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=361, PETRI_TRANSITIONS=359} [2024-11-19 05:59:19,036 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -17 predicate places. [2024-11-19 05:59:19,038 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 359 transitions, 728 flow [2024-11-19 05:59:19,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 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-19 05:59:19,039 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:19,039 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-19 05:59:19,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:59:19,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:19,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:19,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1832849193, now seen corresponding path program 1 times [2024-11-19 05:59:19,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:19,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124424135] [2024-11-19 05:59:19,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:19,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:19,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:19,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124424135] [2024-11-19 05:59:19,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124424135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:19,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:19,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:19,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526383746] [2024-11-19 05:59:19,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:19,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:19,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:19,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:19,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:19,134 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 413 [2024-11-19 05:59:19,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 359 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 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-19 05:59:19,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:19,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 413 [2024-11-19 05:59:19,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:19,283 INFO L124 PetriNetUnfolderBase]: 62/847 cut-off events. [2024-11-19 05:59:19,284 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:59:19,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 847 events. 62/847 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3734 event pairs, 34 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 916. Up to 85 conditions per place. [2024-11-19 05:59:19,289 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 16 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-11-19 05:59:19,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 762 flow [2024-11-19 05:59:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1108 transitions. [2024-11-19 05:59:19,293 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8942695722356739 [2024-11-19 05:59:19,293 INFO L175 Difference]: Start difference. First operand has 361 places, 359 transitions, 728 flow. Second operand 3 states and 1108 transitions. [2024-11-19 05:59:19,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 762 flow [2024-11-19 05:59:19,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 358 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:19,298 INFO L231 Difference]: Finished difference. Result has 355 places, 358 transitions, 726 flow [2024-11-19 05:59:19,299 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=355, PETRI_TRANSITIONS=358} [2024-11-19 05:59:19,300 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -23 predicate places. [2024-11-19 05:59:19,300 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 358 transitions, 726 flow [2024-11-19 05:59:19,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 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-19 05:59:19,300 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:19,301 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-19 05:59:19,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:59:19,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:19,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:19,301 INFO L85 PathProgramCache]: Analyzing trace with hash -175215460, now seen corresponding path program 1 times [2024-11-19 05:59:19,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:19,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646112669] [2024-11-19 05:59:19,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:19,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:19,339 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-19 05:59:19,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:19,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646112669] [2024-11-19 05:59:19,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646112669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:19,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164741465] [2024-11-19 05:59:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:19,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:19,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:19,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 413 [2024-11-19 05:59:19,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 358 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 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-19 05:59:19,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:19,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 413 [2024-11-19 05:59:19,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:19,479 INFO L124 PetriNetUnfolderBase]: 85/1023 cut-off events. [2024-11-19 05:59:19,479 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 05:59:19,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 1023 events. 85/1023 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5429 event pairs, 56 based on Foata normal form. 0/867 useless extension candidates. Maximal degree in co-relation 1115. Up to 113 conditions per place. [2024-11-19 05:59:19,489 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 16 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-11-19 05:59:19,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 357 transitions, 760 flow [2024-11-19 05:59:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:19,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1108 transitions. [2024-11-19 05:59:19,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8942695722356739 [2024-11-19 05:59:19,492 INFO L175 Difference]: Start difference. First operand has 355 places, 358 transitions, 726 flow. Second operand 3 states and 1108 transitions. [2024-11-19 05:59:19,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 357 transitions, 760 flow [2024-11-19 05:59:19,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 357 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:19,496 INFO L231 Difference]: Finished difference. Result has 354 places, 357 transitions, 724 flow [2024-11-19 05:59:19,497 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=354, PETRI_TRANSITIONS=357} [2024-11-19 05:59:19,498 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -24 predicate places. [2024-11-19 05:59:19,498 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 357 transitions, 724 flow [2024-11-19 05:59:19,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 364.3333333333333) internal successors, (1093), 3 states have internal predecessors, (1093), 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-19 05:59:19,499 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:19,499 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] [2024-11-19 05:59:19,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:59:19,500 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:19,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:19,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2067091731, now seen corresponding path program 1 times [2024-11-19 05:59:19,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:19,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419459290] [2024-11-19 05:59:19,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:19,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:19,547 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-19 05:59:19,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:19,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419459290] [2024-11-19 05:59:19,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419459290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:19,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:19,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:19,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562926036] [2024-11-19 05:59:19,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:19,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:19,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:19,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:19,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:19,568 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 413 [2024-11-19 05:59:19,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 357 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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-19 05:59:19,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:19,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 413 [2024-11-19 05:59:19,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:19,694 INFO L124 PetriNetUnfolderBase]: 99/1075 cut-off events. [2024-11-19 05:59:19,694 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-19 05:59:19,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 1075 events. 99/1075 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5613 event pairs, 59 based on Foata normal form. 0/905 useless extension candidates. Maximal degree in co-relation 1181. Up to 135 conditions per place. [2024-11-19 05:59:19,705 INFO L140 encePairwiseOnDemand]: 408/413 looper letters, 17 selfloop transitions, 1 changer transitions 0/353 dead transitions. [2024-11-19 05:59:19,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 353 transitions, 752 flow [2024-11-19 05:59:19,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:19,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1105 transitions. [2024-11-19 05:59:19,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8918482647296206 [2024-11-19 05:59:19,708 INFO L175 Difference]: Start difference. First operand has 354 places, 357 transitions, 724 flow. Second operand 3 states and 1105 transitions. [2024-11-19 05:59:19,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 353 transitions, 752 flow [2024-11-19 05:59:19,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 353 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:19,713 INFO L231 Difference]: Finished difference. Result has 350 places, 353 transitions, 714 flow [2024-11-19 05:59:19,713 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=714, PETRI_PLACES=350, PETRI_TRANSITIONS=353} [2024-11-19 05:59:19,715 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -28 predicate places. [2024-11-19 05:59:19,715 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 353 transitions, 714 flow [2024-11-19 05:59:19,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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-19 05:59:19,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:19,716 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] [2024-11-19 05:59:19,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:59:19,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:19,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:19,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1560551370, now seen corresponding path program 1 times [2024-11-19 05:59:19,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:19,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074639087] [2024-11-19 05:59:19,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:19,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:19,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:20,185 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-19 05:59:20,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074639087] [2024-11-19 05:59:20,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074639087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:20,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:20,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:20,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150507394] [2024-11-19 05:59:20,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:20,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:20,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:20,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:20,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:20,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 413 [2024-11-19 05:59:20,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 353 transitions, 714 flow. Second operand has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 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-19 05:59:20,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:20,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 413 [2024-11-19 05:59:20,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:21,838 INFO L124 PetriNetUnfolderBase]: 2877/11745 cut-off events. [2024-11-19 05:59:21,839 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2024-11-19 05:59:21,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15902 conditions, 11745 events. 2877/11745 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 125370 event pairs, 2079 based on Foata normal form. 0/9821 useless extension candidates. Maximal degree in co-relation 15855. Up to 4033 conditions per place. [2024-11-19 05:59:21,903 INFO L140 encePairwiseOnDemand]: 401/413 looper letters, 49 selfloop transitions, 10 changer transitions 0/351 dead transitions. [2024-11-19 05:59:21,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 351 transitions, 828 flow [2024-11-19 05:59:21,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1993 transitions. [2024-11-19 05:59:21,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8042776432606941 [2024-11-19 05:59:21,907 INFO L175 Difference]: Start difference. First operand has 350 places, 353 transitions, 714 flow. Second operand 6 states and 1993 transitions. [2024-11-19 05:59:21,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 351 transitions, 828 flow [2024-11-19 05:59:21,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 351 transitions, 827 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:21,912 INFO L231 Difference]: Finished difference. Result has 352 places, 351 transitions, 729 flow [2024-11-19 05:59:21,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=729, PETRI_PLACES=352, PETRI_TRANSITIONS=351} [2024-11-19 05:59:21,913 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -26 predicate places. [2024-11-19 05:59:21,913 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 351 transitions, 729 flow [2024-11-19 05:59:21,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 323.5) internal successors, (1941), 6 states have internal predecessors, (1941), 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-19 05:59:21,914 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:21,914 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] [2024-11-19 05:59:21,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:59:21,914 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:21,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:21,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1755734855, now seen corresponding path program 1 times [2024-11-19 05:59:21,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:21,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739526135] [2024-11-19 05:59:21,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:21,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:21,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:21,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:21,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739526135] [2024-11-19 05:59:21,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739526135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:21,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:21,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:21,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116276508] [2024-11-19 05:59:21,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:21,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:21,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:21,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:21,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:21,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 413 [2024-11-19 05:59:21,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 351 transitions, 729 flow. Second operand has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 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-19 05:59:21,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:21,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 413 [2024-11-19 05:59:21,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:22,172 INFO L124 PetriNetUnfolderBase]: 212/1655 cut-off events. [2024-11-19 05:59:22,173 INFO L125 PetriNetUnfolderBase]: For 32/35 co-relation queries the response was YES. [2024-11-19 05:59:22,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1971 conditions, 1655 events. 212/1655 cut-off events. For 32/35 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10948 event pairs, 135 based on Foata normal form. 0/1417 useless extension candidates. Maximal degree in co-relation 1938. Up to 280 conditions per place. [2024-11-19 05:59:22,181 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 18 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2024-11-19 05:59:22,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 350 transitions, 767 flow [2024-11-19 05:59:22,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:22,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:22,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1104 transitions. [2024-11-19 05:59:22,183 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8910411622276029 [2024-11-19 05:59:22,184 INFO L175 Difference]: Start difference. First operand has 352 places, 351 transitions, 729 flow. Second operand 3 states and 1104 transitions. [2024-11-19 05:59:22,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 350 transitions, 767 flow [2024-11-19 05:59:22,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 350 transitions, 747 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:59:22,189 INFO L231 Difference]: Finished difference. Result has 348 places, 350 transitions, 711 flow [2024-11-19 05:59:22,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=348, PETRI_TRANSITIONS=350} [2024-11-19 05:59:22,190 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -30 predicate places. [2024-11-19 05:59:22,191 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 350 transitions, 711 flow [2024-11-19 05:59:22,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.3333333333333) internal successors, (1087), 3 states have internal predecessors, (1087), 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-19 05:59:22,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:22,191 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] [2024-11-19 05:59:22,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:59:22,192 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:22,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:22,193 INFO L85 PathProgramCache]: Analyzing trace with hash -452728092, now seen corresponding path program 1 times [2024-11-19 05:59:22,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:22,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797489821] [2024-11-19 05:59:22,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:22,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:22,226 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-19 05:59:22,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:22,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797489821] [2024-11-19 05:59:22,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797489821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:22,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:22,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:22,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547789690] [2024-11-19 05:59:22,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:22,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:22,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:22,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:22,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:22,243 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 413 [2024-11-19 05:59:22,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 350 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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-19 05:59:22,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:22,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 413 [2024-11-19 05:59:22,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:22,516 INFO L124 PetriNetUnfolderBase]: 267/2525 cut-off events. [2024-11-19 05:59:22,517 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:22,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 2525 events. 267/2525 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 19533 event pairs, 135 based on Foata normal form. 0/2143 useless extension candidates. Maximal degree in co-relation 2827. Up to 322 conditions per place. [2024-11-19 05:59:22,533 INFO L140 encePairwiseOnDemand]: 408/413 looper letters, 17 selfloop transitions, 1 changer transitions 0/346 dead transitions. [2024-11-19 05:59:22,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 346 transitions, 739 flow [2024-11-19 05:59:22,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:22,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1105 transitions. [2024-11-19 05:59:22,536 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8918482647296206 [2024-11-19 05:59:22,536 INFO L175 Difference]: Start difference. First operand has 348 places, 350 transitions, 711 flow. Second operand 3 states and 1105 transitions. [2024-11-19 05:59:22,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 346 transitions, 739 flow [2024-11-19 05:59:22,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 346 transitions, 735 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:22,540 INFO L231 Difference]: Finished difference. Result has 344 places, 346 transitions, 701 flow [2024-11-19 05:59:22,541 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=345, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=344, PETRI_TRANSITIONS=346} [2024-11-19 05:59:22,541 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -34 predicate places. [2024-11-19 05:59:22,541 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 346 transitions, 701 flow [2024-11-19 05:59:22,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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-19 05:59:22,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:22,542 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] [2024-11-19 05:59:22,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:59:22,543 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:22,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:22,543 INFO L85 PathProgramCache]: Analyzing trace with hash -471401314, now seen corresponding path program 1 times [2024-11-19 05:59:22,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:22,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85672528] [2024-11-19 05:59:22,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:22,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:22,580 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-19 05:59:22,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:22,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85672528] [2024-11-19 05:59:22,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85672528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:22,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:22,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:22,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853113775] [2024-11-19 05:59:22,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:22,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:22,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:22,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:22,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:22,593 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 413 [2024-11-19 05:59:22,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 346 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:22,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:22,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 413 [2024-11-19 05:59:22,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:22,650 INFO L124 PetriNetUnfolderBase]: 32/597 cut-off events. [2024-11-19 05:59:22,650 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:59:22,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 597 events. 32/597 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1965 event pairs, 15 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 602. Up to 40 conditions per place. [2024-11-19 05:59:22,655 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 12 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2024-11-19 05:59:22,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 345 transitions, 727 flow [2024-11-19 05:59:22,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:22,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1116 transitions. [2024-11-19 05:59:22,657 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9007263922518159 [2024-11-19 05:59:22,657 INFO L175 Difference]: Start difference. First operand has 344 places, 346 transitions, 701 flow. Second operand 3 states and 1116 transitions. [2024-11-19 05:59:22,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 345 transitions, 727 flow [2024-11-19 05:59:22,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 345 transitions, 726 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:22,661 INFO L231 Difference]: Finished difference. Result has 344 places, 345 transitions, 702 flow [2024-11-19 05:59:22,661 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=702, PETRI_PLACES=344, PETRI_TRANSITIONS=345} [2024-11-19 05:59:22,664 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -34 predicate places. [2024-11-19 05:59:22,664 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 345 transitions, 702 flow [2024-11-19 05:59:22,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:59:22,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:22,666 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] [2024-11-19 05:59:22,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:59:22,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:22,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:22,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1786266170, now seen corresponding path program 1 times [2024-11-19 05:59:22,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:22,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875215519] [2024-11-19 05:59:22,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:22,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:22,706 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-19 05:59:22,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:22,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875215519] [2024-11-19 05:59:22,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875215519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:22,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:22,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:22,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405207979] [2024-11-19 05:59:22,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:22,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:22,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:22,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:22,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:22,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 413 [2024-11-19 05:59:22,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 345 transitions, 702 flow. Second operand has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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-19 05:59:22,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:22,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 413 [2024-11-19 05:59:22,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:22,869 INFO L124 PetriNetUnfolderBase]: 123/1366 cut-off events. [2024-11-19 05:59:22,869 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-19 05:59:22,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1535 conditions, 1366 events. 123/1366 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 8486 event pairs, 71 based on Foata normal form. 0/1189 useless extension candidates. Maximal degree in co-relation 1487. Up to 150 conditions per place. [2024-11-19 05:59:22,877 INFO L140 encePairwiseOnDemand]: 408/413 looper letters, 17 selfloop transitions, 1 changer transitions 0/341 dead transitions. [2024-11-19 05:59:22,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 341 transitions, 730 flow [2024-11-19 05:59:22,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1105 transitions. [2024-11-19 05:59:22,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8918482647296206 [2024-11-19 05:59:22,880 INFO L175 Difference]: Start difference. First operand has 344 places, 345 transitions, 702 flow. Second operand 3 states and 1105 transitions. [2024-11-19 05:59:22,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 341 transitions, 730 flow [2024-11-19 05:59:22,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 341 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:22,884 INFO L231 Difference]: Finished difference. Result has 340 places, 341 transitions, 692 flow [2024-11-19 05:59:22,885 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=340, PETRI_TRANSITIONS=341} [2024-11-19 05:59:22,885 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -38 predicate places. [2024-11-19 05:59:22,885 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 341 transitions, 692 flow [2024-11-19 05:59:22,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 362.0) internal successors, (1086), 3 states have internal predecessors, (1086), 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-19 05:59:22,886 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:22,886 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] [2024-11-19 05:59:22,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:59:22,887 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:22,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:22,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1702865575, now seen corresponding path program 1 times [2024-11-19 05:59:22,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:22,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974298251] [2024-11-19 05:59:22,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:22,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:22,921 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-19 05:59:22,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:22,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974298251] [2024-11-19 05:59:22,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974298251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:22,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:22,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:22,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175776468] [2024-11-19 05:59:22,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:22,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:22,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:22,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:22,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:22,944 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 413 [2024-11-19 05:59:22,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 341 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 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-19 05:59:22,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:22,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 413 [2024-11-19 05:59:22,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:23,429 INFO L124 PetriNetUnfolderBase]: 771/4413 cut-off events. [2024-11-19 05:59:23,429 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-11-19 05:59:23,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5495 conditions, 4413 events. 771/4413 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 39575 event pairs, 325 based on Foata normal form. 0/3896 useless extension candidates. Maximal degree in co-relation 5448. Up to 1026 conditions per place. [2024-11-19 05:59:23,463 INFO L140 encePairwiseOnDemand]: 404/413 looper letters, 27 selfloop transitions, 3 changer transitions 0/343 dead transitions. [2024-11-19 05:59:23,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 343 transitions, 761 flow [2024-11-19 05:59:23,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:23,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:23,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2024-11-19 05:59:23,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8886198547215496 [2024-11-19 05:59:23,466 INFO L175 Difference]: Start difference. First operand has 340 places, 341 transitions, 692 flow. Second operand 3 states and 1101 transitions. [2024-11-19 05:59:23,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 343 transitions, 761 flow [2024-11-19 05:59:23,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 343 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:23,473 INFO L231 Difference]: Finished difference. Result has 336 places, 338 transitions, 700 flow [2024-11-19 05:59:23,473 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=700, PETRI_PLACES=336, PETRI_TRANSITIONS=338} [2024-11-19 05:59:23,474 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -42 predicate places. [2024-11-19 05:59:23,474 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 338 transitions, 700 flow [2024-11-19 05:59:23,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 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-19 05:59:23,475 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:23,475 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] [2024-11-19 05:59:23,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:59:23,476 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:23,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:23,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1384370475, now seen corresponding path program 1 times [2024-11-19 05:59:23,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:23,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205407586] [2024-11-19 05:59:23,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:23,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:23,619 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-19 05:59:23,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:23,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205407586] [2024-11-19 05:59:23,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205407586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:23,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:23,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 05:59:23,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175564844] [2024-11-19 05:59:23,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:23,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 05:59:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:23,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 05:59:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 05:59:23,810 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 413 [2024-11-19 05:59:23,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 338 transitions, 700 flow. Second operand has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 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-19 05:59:23,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:23,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 413 [2024-11-19 05:59:23,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:24,091 INFO L124 PetriNetUnfolderBase]: 217/2201 cut-off events. [2024-11-19 05:59:24,091 INFO L125 PetriNetUnfolderBase]: For 21/48 co-relation queries the response was YES. [2024-11-19 05:59:24,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2611 conditions, 2201 events. 217/2201 cut-off events. For 21/48 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 15465 event pairs, 79 based on Foata normal form. 9/2002 useless extension candidates. Maximal degree in co-relation 2562. Up to 188 conditions per place. [2024-11-19 05:59:24,108 INFO L140 encePairwiseOnDemand]: 400/413 looper letters, 47 selfloop transitions, 14 changer transitions 0/366 dead transitions. [2024-11-19 05:59:24,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 366 transitions, 886 flow [2024-11-19 05:59:24,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 05:59:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 05:59:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3562 transitions. [2024-11-19 05:59:24,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8624697336561743 [2024-11-19 05:59:24,114 INFO L175 Difference]: Start difference. First operand has 336 places, 338 transitions, 700 flow. Second operand 10 states and 3562 transitions. [2024-11-19 05:59:24,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 366 transitions, 886 flow [2024-11-19 05:59:24,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 366 transitions, 886 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:59:24,118 INFO L231 Difference]: Finished difference. Result has 349 places, 345 transitions, 766 flow [2024-11-19 05:59:24,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=700, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=766, PETRI_PLACES=349, PETRI_TRANSITIONS=345} [2024-11-19 05:59:24,119 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -29 predicate places. [2024-11-19 05:59:24,119 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 345 transitions, 766 flow [2024-11-19 05:59:24,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 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-19 05:59:24,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:24,121 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:24,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:59:24,121 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:24,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:24,122 INFO L85 PathProgramCache]: Analyzing trace with hash -507042241, now seen corresponding path program 1 times [2024-11-19 05:59:24,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:24,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231159735] [2024-11-19 05:59:24,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:24,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:24,195 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-19 05:59:24,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:24,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231159735] [2024-11-19 05:59:24,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231159735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:24,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:24,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:24,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691209343] [2024-11-19 05:59:24,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:24,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 05:59:24,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:24,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 05:59:24,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 05:59:24,241 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 413 [2024-11-19 05:59:24,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 345 transitions, 766 flow. Second operand has 5 states, 5 states have (on average 363.0) internal successors, (1815), 5 states have internal predecessors, (1815), 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-19 05:59:24,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:24,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 413 [2024-11-19 05:59:24,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:24,547 INFO L124 PetriNetUnfolderBase]: 337/2694 cut-off events. [2024-11-19 05:59:24,548 INFO L125 PetriNetUnfolderBase]: For 101/147 co-relation queries the response was YES. [2024-11-19 05:59:24,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3347 conditions, 2694 events. 337/2694 cut-off events. For 101/147 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 19098 event pairs, 129 based on Foata normal form. 18/2423 useless extension candidates. Maximal degree in co-relation 3289. Up to 327 conditions per place. [2024-11-19 05:59:24,575 INFO L140 encePairwiseOnDemand]: 407/413 looper letters, 31 selfloop transitions, 5 changer transitions 0/360 dead transitions. [2024-11-19 05:59:24,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 360 transitions, 876 flow [2024-11-19 05:59:24,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 05:59:24,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 05:59:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1842 transitions. [2024-11-19 05:59:24,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8920096852300242 [2024-11-19 05:59:24,580 INFO L175 Difference]: Start difference. First operand has 349 places, 345 transitions, 766 flow. Second operand 5 states and 1842 transitions. [2024-11-19 05:59:24,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 360 transitions, 876 flow [2024-11-19 05:59:24,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 360 transitions, 872 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:24,587 INFO L231 Difference]: Finished difference. Result has 354 places, 347 transitions, 787 flow [2024-11-19 05:59:24,587 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=787, PETRI_PLACES=354, PETRI_TRANSITIONS=347} [2024-11-19 05:59:24,588 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -24 predicate places. [2024-11-19 05:59:24,588 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 347 transitions, 787 flow [2024-11-19 05:59:24,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 363.0) internal successors, (1815), 5 states have internal predecessors, (1815), 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-19 05:59:24,589 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:24,589 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:24,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:59:24,590 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:24,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:24,590 INFO L85 PathProgramCache]: Analyzing trace with hash -119987171, now seen corresponding path program 1 times [2024-11-19 05:59:24,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:24,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115970214] [2024-11-19 05:59:24,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:24,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:24,947 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-19 05:59:24,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:24,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115970214] [2024-11-19 05:59:24,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115970214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:24,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:24,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:24,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108139821] [2024-11-19 05:59:24,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:24,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:24,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:24,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:24,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:25,243 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 413 [2024-11-19 05:59:25,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 347 transitions, 787 flow. Second operand has 6 states, 6 states have (on average 350.6666666666667) internal successors, (2104), 6 states have internal predecessors, (2104), 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-19 05:59:25,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:25,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 413 [2024-11-19 05:59:25,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:25,587 INFO L124 PetriNetUnfolderBase]: 511/2768 cut-off events. [2024-11-19 05:59:25,587 INFO L125 PetriNetUnfolderBase]: For 302/356 co-relation queries the response was YES. [2024-11-19 05:59:25,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3872 conditions, 2768 events. 511/2768 cut-off events. For 302/356 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 21129 event pairs, 110 based on Foata normal form. 4/2460 useless extension candidates. Maximal degree in co-relation 3815. Up to 332 conditions per place. [2024-11-19 05:59:25,613 INFO L140 encePairwiseOnDemand]: 406/413 looper letters, 45 selfloop transitions, 5 changer transitions 0/361 dead transitions. [2024-11-19 05:59:25,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 361 transitions, 923 flow [2024-11-19 05:59:25,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2144 transitions. [2024-11-19 05:59:25,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8652138821630347 [2024-11-19 05:59:25,616 INFO L175 Difference]: Start difference. First operand has 354 places, 347 transitions, 787 flow. Second operand 6 states and 2144 transitions. [2024-11-19 05:59:25,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 361 transitions, 923 flow [2024-11-19 05:59:25,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 361 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:25,622 INFO L231 Difference]: Finished difference. Result has 355 places, 345 transitions, 788 flow [2024-11-19 05:59:25,622 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=788, PETRI_PLACES=355, PETRI_TRANSITIONS=345} [2024-11-19 05:59:25,623 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -23 predicate places. [2024-11-19 05:59:25,623 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 345 transitions, 788 flow [2024-11-19 05:59:25,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 350.6666666666667) internal successors, (2104), 6 states have internal predecessors, (2104), 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-19 05:59:25,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:25,624 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:25,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:59:25,625 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:25,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:25,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1809963800, now seen corresponding path program 1 times [2024-11-19 05:59:25,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:25,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467809455] [2024-11-19 05:59:25,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:25,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:25,945 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-19 05:59:25,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:25,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467809455] [2024-11-19 05:59:25,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467809455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:25,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:25,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:25,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456220304] [2024-11-19 05:59:25,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:25,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:25,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:25,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:25,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:26,179 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 413 [2024-11-19 05:59:26,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 345 transitions, 788 flow. Second operand has 6 states, 6 states have (on average 350.8333333333333) internal successors, (2105), 6 states have internal predecessors, (2105), 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-19 05:59:26,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:26,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 413 [2024-11-19 05:59:26,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:26,519 INFO L124 PetriNetUnfolderBase]: 651/2941 cut-off events. [2024-11-19 05:59:26,519 INFO L125 PetriNetUnfolderBase]: For 311/432 co-relation queries the response was YES. [2024-11-19 05:59:26,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4165 conditions, 2941 events. 651/2941 cut-off events. For 311/432 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 22531 event pairs, 87 based on Foata normal form. 0/2675 useless extension candidates. Maximal degree in co-relation 4108. Up to 496 conditions per place. [2024-11-19 05:59:26,545 INFO L140 encePairwiseOnDemand]: 406/413 looper letters, 43 selfloop transitions, 5 changer transitions 0/359 dead transitions. [2024-11-19 05:59:26,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 359 transitions, 920 flow [2024-11-19 05:59:26,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:26,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2144 transitions. [2024-11-19 05:59:26,548 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8652138821630347 [2024-11-19 05:59:26,548 INFO L175 Difference]: Start difference. First operand has 355 places, 345 transitions, 788 flow. Second operand 6 states and 2144 transitions. [2024-11-19 05:59:26,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 359 transitions, 920 flow [2024-11-19 05:59:26,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 359 transitions, 910 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:59:26,553 INFO L231 Difference]: Finished difference. Result has 353 places, 343 transitions, 784 flow [2024-11-19 05:59:26,553 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=784, PETRI_PLACES=353, PETRI_TRANSITIONS=343} [2024-11-19 05:59:26,554 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -25 predicate places. [2024-11-19 05:59:26,554 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 343 transitions, 784 flow [2024-11-19 05:59:26,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 350.8333333333333) internal successors, (2105), 6 states have internal predecessors, (2105), 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-19 05:59:26,555 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:26,555 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:26,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:59:26,555 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:26,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:26,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1740639321, now seen corresponding path program 1 times [2024-11-19 05:59:26,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:26,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186895556] [2024-11-19 05:59:26,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:26,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 05:59:26,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:26,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186895556] [2024-11-19 05:59:26,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186895556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:26,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:26,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:26,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633405808] [2024-11-19 05:59:26,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:26,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:26,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:26,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:26,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:27,069 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 413 [2024-11-19 05:59:27,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 343 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 351.1666666666667) internal successors, (2107), 6 states have internal predecessors, (2107), 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-19 05:59:27,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:27,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 413 [2024-11-19 05:59:27,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:27,419 INFO L124 PetriNetUnfolderBase]: 350/2338 cut-off events. [2024-11-19 05:59:27,419 INFO L125 PetriNetUnfolderBase]: For 140/219 co-relation queries the response was YES. [2024-11-19 05:59:27,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3369 conditions, 2338 events. 350/2338 cut-off events. For 140/219 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 18278 event pairs, 91 based on Foata normal form. 12/2189 useless extension candidates. Maximal degree in co-relation 3312. Up to 278 conditions per place. [2024-11-19 05:59:27,433 INFO L140 encePairwiseOnDemand]: 406/413 looper letters, 45 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2024-11-19 05:59:27,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 357 transitions, 920 flow [2024-11-19 05:59:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2144 transitions. [2024-11-19 05:59:27,438 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8652138821630347 [2024-11-19 05:59:27,438 INFO L175 Difference]: Start difference. First operand has 353 places, 343 transitions, 784 flow. Second operand 6 states and 2144 transitions. [2024-11-19 05:59:27,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 357 transitions, 920 flow [2024-11-19 05:59:27,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 357 transitions, 910 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:59:27,443 INFO L231 Difference]: Finished difference. Result has 351 places, 341 transitions, 780 flow [2024-11-19 05:59:27,443 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=780, PETRI_PLACES=351, PETRI_TRANSITIONS=341} [2024-11-19 05:59:27,444 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -27 predicate places. [2024-11-19 05:59:27,444 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 341 transitions, 780 flow [2024-11-19 05:59:27,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 351.1666666666667) internal successors, (2107), 6 states have internal predecessors, (2107), 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-19 05:59:27,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:27,445 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:27,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:59:27,445 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:27,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:27,445 INFO L85 PathProgramCache]: Analyzing trace with hash -801679105, now seen corresponding path program 1 times [2024-11-19 05:59:27,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:27,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197758516] [2024-11-19 05:59:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:27,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:27,489 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-19 05:59:27,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:27,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197758516] [2024-11-19 05:59:27,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197758516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:27,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:27,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:27,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437219768] [2024-11-19 05:59:27,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:27,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:27,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:27,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:27,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:27,494 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 413 [2024-11-19 05:59:27,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 341 transitions, 780 flow. Second operand has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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-19 05:59:27,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:27,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 413 [2024-11-19 05:59:27,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:27,707 INFO L124 PetriNetUnfolderBase]: 128/1639 cut-off events. [2024-11-19 05:59:27,707 INFO L125 PetriNetUnfolderBase]: For 43/68 co-relation queries the response was YES. [2024-11-19 05:59:27,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2010 conditions, 1639 events. 128/1639 cut-off events. For 43/68 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 9939 event pairs, 38 based on Foata normal form. 0/1536 useless extension candidates. Maximal degree in co-relation 1954. Up to 149 conditions per place. [2024-11-19 05:59:27,720 INFO L140 encePairwiseOnDemand]: 411/413 looper letters, 10 selfloop transitions, 1 changer transitions 0/340 dead transitions. [2024-11-19 05:59:27,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 340 transitions, 800 flow [2024-11-19 05:59:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:27,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:27,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1125 transitions. [2024-11-19 05:59:27,722 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9079903147699758 [2024-11-19 05:59:27,723 INFO L175 Difference]: Start difference. First operand has 351 places, 341 transitions, 780 flow. Second operand 3 states and 1125 transitions. [2024-11-19 05:59:27,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 340 transitions, 800 flow [2024-11-19 05:59:27,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 340 transitions, 790 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:59:27,727 INFO L231 Difference]: Finished difference. Result has 347 places, 340 transitions, 770 flow [2024-11-19 05:59:27,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=770, PETRI_PLACES=347, PETRI_TRANSITIONS=340} [2024-11-19 05:59:27,727 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -31 predicate places. [2024-11-19 05:59:27,728 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 340 transitions, 770 flow [2024-11-19 05:59:27,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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-19 05:59:27,728 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:27,728 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:27,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:59:27,729 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 75 more)] === [2024-11-19 05:59:27,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:27,729 INFO L85 PathProgramCache]: Analyzing trace with hash 2009689025, now seen corresponding path program 1 times [2024-11-19 05:59:27,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:27,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293167023] [2024-11-19 05:59:27,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:27,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:27,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:59:27,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:27,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293167023] [2024-11-19 05:59:27,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293167023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:27,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:27,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:27,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976084325] [2024-11-19 05:59:27,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:27,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:27,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:27,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:27,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:27,765 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 413 [2024-11-19 05:59:27,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 340 transitions, 770 flow. Second operand has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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-19 05:59:27,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:27,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 413 [2024-11-19 05:59:27,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:27,918 INFO L124 PetriNetUnfolderBase]: 128/1631 cut-off events. [2024-11-19 05:59:27,918 INFO L125 PetriNetUnfolderBase]: For 43/68 co-relation queries the response was YES. [2024-11-19 05:59:27,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1967 conditions, 1631 events. 128/1631 cut-off events. For 43/68 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 9844 event pairs, 38 based on Foata normal form. 8/1536 useless extension candidates. Maximal degree in co-relation 1917. Up to 149 conditions per place. [2024-11-19 05:59:27,928 INFO L140 encePairwiseOnDemand]: 411/413 looper letters, 0 selfloop transitions, 0 changer transitions 339/339 dead transitions. [2024-11-19 05:59:27,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 339 transitions, 788 flow [2024-11-19 05:59:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:27,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:27,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1124 transitions. [2024-11-19 05:59:27,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9071832122679581 [2024-11-19 05:59:27,931 INFO L175 Difference]: Start difference. First operand has 347 places, 340 transitions, 770 flow. Second operand 3 states and 1124 transitions. [2024-11-19 05:59:27,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 339 transitions, 788 flow [2024-11-19 05:59:27,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 339 transitions, 787 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:27,935 INFO L231 Difference]: Finished difference. Result has 347 places, 0 transitions, 0 flow [2024-11-19 05:59:27,936 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=413, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=347, PETRI_TRANSITIONS=0} [2024-11-19 05:59:27,936 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -31 predicate places. [2024-11-19 05:59:27,936 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 0 transitions, 0 flow [2024-11-19 05:59:27,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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-19 05:59:27,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (78 of 79 remaining) [2024-11-19 05:59:27,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2024-11-19 05:59:27,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2024-11-19 05:59:27,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2024-11-19 05:59:27,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2024-11-19 05:59:27,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2024-11-19 05:59:27,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2024-11-19 05:59:27,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2024-11-19 05:59:27,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2024-11-19 05:59:27,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2024-11-19 05:59:27,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2024-11-19 05:59:27,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2024-11-19 05:59:27,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2024-11-19 05:59:27,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2024-11-19 05:59:27,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2024-11-19 05:59:27,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2024-11-19 05:59:27,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2024-11-19 05:59:27,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2024-11-19 05:59:27,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2024-11-19 05:59:27,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2024-11-19 05:59:27,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2024-11-19 05:59:27,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2024-11-19 05:59:27,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2024-11-19 05:59:27,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2024-11-19 05:59:27,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2024-11-19 05:59:27,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2024-11-19 05:59:27,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2024-11-19 05:59:27,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2024-11-19 05:59:27,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2024-11-19 05:59:27,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2024-11-19 05:59:27,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 79 remaining) [2024-11-19 05:59:27,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 79 remaining) [2024-11-19 05:59:27,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 79 remaining) [2024-11-19 05:59:27,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2024-11-19 05:59:27,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2024-11-19 05:59:27,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2024-11-19 05:59:27,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2024-11-19 05:59:27,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2024-11-19 05:59:27,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2024-11-19 05:59:27,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2024-11-19 05:59:27,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2024-11-19 05:59:27,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2024-11-19 05:59:27,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2024-11-19 05:59:27,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2024-11-19 05:59:27,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2024-11-19 05:59:27,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2024-11-19 05:59:27,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2024-11-19 05:59:27,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2024-11-19 05:59:27,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:59:27,945 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:27,950 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:59:27,950 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:59:27,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:59:27 BasicIcfg [2024-11-19 05:59:27,954 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:59:27,955 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:59:27,955 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:59:27,955 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:59:27,956 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:59:18" (3/4) ... [2024-11-19 05:59:27,957 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:59:27,959 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:59:27,959 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:59:27,959 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 05:59:27,965 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-11-19 05:59:27,965 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:59:27,965 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-19 05:59:27,966 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:59:28,040 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:59:28,040 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:59:28,040 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:59:28,041 INFO L158 Benchmark]: Toolchain (without parser) took 11142.63ms. Allocated memory was 172.0MB in the beginning and 1.2GB in the end (delta: 985.7MB). Free memory was 116.5MB in the beginning and 614.7MB in the end (delta: -498.1MB). Peak memory consumption was 487.2MB. Max. memory is 16.1GB. [2024-11-19 05:59:28,041 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:59:28,041 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.11ms. Allocated memory is still 172.0MB. Free memory was 116.5MB in the beginning and 137.7MB in the end (delta: -21.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 05:59:28,041 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.73ms. Allocated memory is still 172.0MB. Free memory was 137.7MB in the beginning and 134.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:59:28,041 INFO L158 Benchmark]: Boogie Preprocessor took 57.95ms. Allocated memory is still 172.0MB. Free memory was 134.3MB in the beginning and 130.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:59:28,041 INFO L158 Benchmark]: RCFGBuilder took 888.50ms. Allocated memory was 172.0MB in the beginning and 237.0MB in the end (delta: 65.0MB). Free memory was 130.8MB in the beginning and 197.3MB in the end (delta: -66.5MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. [2024-11-19 05:59:28,041 INFO L158 Benchmark]: TraceAbstraction took 9720.72ms. Allocated memory was 237.0MB in the beginning and 1.2GB in the end (delta: 920.6MB). Free memory was 196.2MB in the beginning and 621.0MB in the end (delta: -424.7MB). Peak memory consumption was 495.9MB. Max. memory is 16.1GB. [2024-11-19 05:59:28,042 INFO L158 Benchmark]: Witness Printer took 85.18ms. Allocated memory is still 1.2GB. Free memory was 621.0MB in the beginning and 614.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 05:59:28,043 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.15ms. Allocated memory is still 100.7MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.11ms. Allocated memory is still 172.0MB. Free memory was 116.5MB in the beginning and 137.7MB in the end (delta: -21.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.73ms. Allocated memory is still 172.0MB. Free memory was 137.7MB in the beginning and 134.3MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.95ms. Allocated memory is still 172.0MB. Free memory was 134.3MB in the beginning and 130.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 888.50ms. Allocated memory was 172.0MB in the beginning and 237.0MB in the end (delta: 65.0MB). Free memory was 130.8MB in the beginning and 197.3MB in the end (delta: -66.5MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. * TraceAbstraction took 9720.72ms. Allocated memory was 237.0MB in the beginning and 1.2GB in the end (delta: 920.6MB). Free memory was 196.2MB in the beginning and 621.0MB in the end (delta: -424.7MB). Peak memory consumption was 495.9MB. Max. memory is 16.1GB. * Witness Printer took 85.18ms. Allocated memory is still 1.2GB. Free memory was 621.0MB in the beginning and 614.7MB 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: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: 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: 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: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: 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: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: 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: 118]: 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: 118]: 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: 96]: 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: 106]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: 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 7 procedures, 565 locations, 79 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: 9.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1462 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 838 mSDsluCounter, 547 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 447 mSDsCounter, 386 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2375 IncrementalHoareTripleChecker+Invalid, 2761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 386 mSolverCounterUnsat, 100 mSDtfsCounter, 2375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=804occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1796 NumberOfCodeBlocks, 1796 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1779 ConstructedInterpolants, 0 QuantifiedInterpolants, 2551 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 1/1 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 45 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:59:28,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE