./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 17:16:19,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:16:19,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:16:19,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:16:19,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:16:19,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:16:19,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:16:19,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:16:19,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:16:19,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:16:19,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:16:19,420 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:16:19,421 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:16:19,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:16:19,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:16:19,424 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:16:19,424 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:16:19,424 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:16:19,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:16:19,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:16:19,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:16:19,429 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:16:19,429 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:16:19,429 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:16:19,430 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:16:19,430 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:16:19,430 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:16:19,430 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:16:19,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:16:19,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:16:19,431 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:16:19,431 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:16:19,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:16:19,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:16:19,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:16:19,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:16:19,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:16:19,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:16:19,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:16:19,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:16:19,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:16:19,435 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/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-clean/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-10-11 17:16:19,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:16:19,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:16:19,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:16:19,744 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:16:19,744 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:16:19,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c [2024-10-11 17:16:21,196 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:16:21,436 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:16:21,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-dot-product.wvr.c [2024-10-11 17:16:21,444 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/abe38ce65/4c871e69d239436b83ba0e9b4290d0c7/FLAG13f71e411 [2024-10-11 17:16:21,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/abe38ce65/4c871e69d239436b83ba0e9b4290d0c7 [2024-10-11 17:16:21,806 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:16:21,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:16:21,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:16:21,809 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:16:21,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:16:21,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:16:21" (1/1) ... [2024-10-11 17:16:21,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22909c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:21, skipping insertion in model container [2024-10-11 17:16:21,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:16:21" (1/1) ... [2024-10-11 17:16:21,855 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:16:22,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:16:22,123 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:16:22,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:16:22,192 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:16:22,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22 WrapperNode [2024-10-11 17:16:22,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:16:22,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:16:22,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:16:22,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:16:22,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,258 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 23, statements flattened = 421 [2024-10-11 17:16:22,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:16:22,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:16:22,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:16:22,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:16:22,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,280 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,313 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,334 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:16:22,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:16:22,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:16:22,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:16:22,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (1/1) ... [2024-10-11 17:16:22,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:16:22,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:16:22,371 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:16:22,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:16:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:16:22,423 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:16:22,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:16:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:16:22,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:16:22,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:16:22,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:16:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:16:22,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:16:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:16:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:16:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:16:22,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:16:22,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:16:22,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:16:22,430 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:16:22,574 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:16:22,578 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:16:23,273 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:16:23,273 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:16:23,564 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:16:23,568 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-11 17:16:23,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:16:23 BoogieIcfgContainer [2024-10-11 17:16:23,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:16:23,571 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:16:23,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:16:23,574 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:16:23,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:16:21" (1/3) ... [2024-10-11 17:16:23,575 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6a8031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:16:23, skipping insertion in model container [2024-10-11 17:16:23,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:22" (2/3) ... [2024-10-11 17:16:23,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6a8031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:16:23, skipping insertion in model container [2024-10-11 17:16:23,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:16:23" (3/3) ... [2024-10-11 17:16:23,578 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product.wvr.c [2024-10-11 17:16:23,595 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:16:23,595 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2024-10-11 17:16:23,595 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:16:23,721 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:16:23,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 397 places, 413 transitions, 847 flow [2024-10-11 17:16:23,919 INFO L124 PetriNetUnfolderBase]: 26/410 cut-off events. [2024-10-11 17:16:23,919 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:16:23,933 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-10-11 17:16:23,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 397 places, 413 transitions, 847 flow [2024-10-11 17:16:23,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 378 places, 393 transitions, 804 flow [2024-10-11 17:16:23,959 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:16:23,967 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;@45c86bee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:16:23,968 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2024-10-11 17:16:23,972 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:16:23,973 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-10-11 17:16:23,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:16:23,973 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:23,974 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-10-11 17:16:23,974 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-10-11 17:16:23,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:23,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1319536759, now seen corresponding path program 1 times [2024-10-11 17:16:23,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:23,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447426551] [2024-10-11 17:16:23,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:23,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:24,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:24,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:24,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447426551] [2024-10-11 17:16:24,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447426551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:24,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:24,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:24,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209843262] [2024-10-11 17:16:24,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:24,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:24,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:24,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:24,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:24,299 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 413 [2024-10-11 17:16:24,306 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-10-11 17:16:24,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:24,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 413 [2024-10-11 17:16:24,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:24,681 INFO L124 PetriNetUnfolderBase]: 75/1119 cut-off events. [2024-10-11 17:16:24,681 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-11 17:16:24,703 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-10-11 17:16:24,711 INFO L140 encePairwiseOnDemand]: 382/413 looper letters, 16 selfloop transitions, 2 changer transitions 5/364 dead transitions. [2024-10-11 17:16:24,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 364 transitions, 782 flow [2024-10-11 17:16:24,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2024-10-11 17:16:24,733 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9168684422921711 [2024-10-11 17:16:24,737 INFO L175 Difference]: Start difference. First operand has 378 places, 393 transitions, 804 flow. Second operand 3 states and 1136 transitions. [2024-10-11 17:16:24,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 364 transitions, 782 flow [2024-10-11 17:16:24,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 364 transitions, 770 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:16:24,752 INFO L231 Difference]: Finished difference. Result has 361 places, 359 transitions, 728 flow [2024-10-11 17:16:24,755 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-10-11 17:16:24,758 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -17 predicate places. [2024-10-11 17:16:24,761 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 359 transitions, 728 flow [2024-10-11 17:16:24,762 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-10-11 17:16:24,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:24,763 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-10-11 17:16:24,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:16:24,764 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-10-11 17:16:24,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:24,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1832849193, now seen corresponding path program 1 times [2024-10-11 17:16:24,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:24,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591736792] [2024-10-11 17:16:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:24,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:24,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:24,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:24,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591736792] [2024-10-11 17:16:24,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591736792] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:24,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:24,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:24,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607017408] [2024-10-11 17:16:24,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:24,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:24,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:24,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:24,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:24,880 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 413 [2024-10-11 17:16:24,882 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-10-11 17:16:24,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:24,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 413 [2024-10-11 17:16:24,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:25,067 INFO L124 PetriNetUnfolderBase]: 62/847 cut-off events. [2024-10-11 17:16:25,069 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-10-11 17:16:25,076 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-10-11 17:16:25,081 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 16 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2024-10-11 17:16:25,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 358 transitions, 762 flow [2024-10-11 17:16:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1108 transitions. [2024-10-11 17:16:25,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8942695722356739 [2024-10-11 17:16:25,085 INFO L175 Difference]: Start difference. First operand has 361 places, 359 transitions, 728 flow. Second operand 3 states and 1108 transitions. [2024-10-11 17:16:25,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 358 transitions, 762 flow [2024-10-11 17:16:25,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 358 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:25,095 INFO L231 Difference]: Finished difference. Result has 355 places, 358 transitions, 726 flow [2024-10-11 17:16:25,096 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-10-11 17:16:25,097 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -23 predicate places. [2024-10-11 17:16:25,097 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 358 transitions, 726 flow [2024-10-11 17:16:25,098 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-10-11 17:16:25,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:25,099 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-10-11 17:16:25,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:16:25,099 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-10-11 17:16:25,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash -175215460, now seen corresponding path program 1 times [2024-10-11 17:16:25,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:25,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544427925] [2024-10-11 17:16:25,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:25,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:25,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:25,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544427925] [2024-10-11 17:16:25,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544427925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:25,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:25,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:25,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603163951] [2024-10-11 17:16:25,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:25,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:25,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:25,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:25,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:25,216 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 363 out of 413 [2024-10-11 17:16:25,217 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-10-11 17:16:25,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:25,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 363 of 413 [2024-10-11 17:16:25,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:25,417 INFO L124 PetriNetUnfolderBase]: 85/1023 cut-off events. [2024-10-11 17:16:25,417 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-10-11 17:16:25,426 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-10-11 17:16:25,433 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 16 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2024-10-11 17:16:25,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 357 transitions, 760 flow [2024-10-11 17:16:25,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:25,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1108 transitions. [2024-10-11 17:16:25,436 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8942695722356739 [2024-10-11 17:16:25,436 INFO L175 Difference]: Start difference. First operand has 355 places, 358 transitions, 726 flow. Second operand 3 states and 1108 transitions. [2024-10-11 17:16:25,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 357 transitions, 760 flow [2024-10-11 17:16:25,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 357 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:25,443 INFO L231 Difference]: Finished difference. Result has 354 places, 357 transitions, 724 flow [2024-10-11 17:16:25,444 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-10-11 17:16:25,445 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -24 predicate places. [2024-10-11 17:16:25,445 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 357 transitions, 724 flow [2024-10-11 17:16:25,446 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-10-11 17:16:25,446 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:25,447 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-10-11 17:16:25,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:16:25,448 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-10-11 17:16:25,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:25,449 INFO L85 PathProgramCache]: Analyzing trace with hash 2067091731, now seen corresponding path program 1 times [2024-10-11 17:16:25,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:25,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120416819] [2024-10-11 17:16:25,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:25,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:25,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:25,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120416819] [2024-10-11 17:16:25,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120416819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:25,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:25,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:25,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067910852] [2024-10-11 17:16:25,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:25,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:25,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:25,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:25,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:25,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 413 [2024-10-11 17:16:25,536 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-10-11 17:16:25,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:25,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 413 [2024-10-11 17:16:25,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:25,755 INFO L124 PetriNetUnfolderBase]: 99/1075 cut-off events. [2024-10-11 17:16:25,755 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:16:25,762 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-10-11 17:16:25,767 INFO L140 encePairwiseOnDemand]: 408/413 looper letters, 17 selfloop transitions, 1 changer transitions 0/353 dead transitions. [2024-10-11 17:16:25,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 353 transitions, 752 flow [2024-10-11 17:16:25,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:25,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1105 transitions. [2024-10-11 17:16:25,770 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8918482647296206 [2024-10-11 17:16:25,770 INFO L175 Difference]: Start difference. First operand has 354 places, 357 transitions, 724 flow. Second operand 3 states and 1105 transitions. [2024-10-11 17:16:25,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 353 transitions, 752 flow [2024-10-11 17:16:25,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 353 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:25,776 INFO L231 Difference]: Finished difference. Result has 350 places, 353 transitions, 714 flow [2024-10-11 17:16:25,776 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-10-11 17:16:25,777 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -28 predicate places. [2024-10-11 17:16:25,777 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 353 transitions, 714 flow [2024-10-11 17:16:25,778 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-10-11 17:16:25,778 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:25,778 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-10-11 17:16:25,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:16:25,778 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-10-11 17:16:25,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:25,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1560551370, now seen corresponding path program 1 times [2024-10-11 17:16:25,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:25,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888723049] [2024-10-11 17:16:25,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:25,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:26,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:26,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888723049] [2024-10-11 17:16:26,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888723049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:26,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:26,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:16:26,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937929789] [2024-10-11 17:16:26,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:26,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:16:26,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:26,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:16:26,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:16:26,695 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 413 [2024-10-11 17:16:26,698 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-10-11 17:16:26,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:26,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 413 [2024-10-11 17:16:26,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:28,657 INFO L124 PetriNetUnfolderBase]: 2877/11745 cut-off events. [2024-10-11 17:16:28,658 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2024-10-11 17:16:28,710 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-10-11 17:16:28,780 INFO L140 encePairwiseOnDemand]: 401/413 looper letters, 49 selfloop transitions, 10 changer transitions 0/351 dead transitions. [2024-10-11 17:16:28,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 351 transitions, 828 flow [2024-10-11 17:16:28,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:16:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:16:28,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1993 transitions. [2024-10-11 17:16:28,863 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8042776432606941 [2024-10-11 17:16:28,863 INFO L175 Difference]: Start difference. First operand has 350 places, 353 transitions, 714 flow. Second operand 6 states and 1993 transitions. [2024-10-11 17:16:28,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 351 transitions, 828 flow [2024-10-11 17:16:28,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 351 transitions, 827 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:28,874 INFO L231 Difference]: Finished difference. Result has 352 places, 351 transitions, 729 flow [2024-10-11 17:16:28,875 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-10-11 17:16:28,876 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -26 predicate places. [2024-10-11 17:16:28,876 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 351 transitions, 729 flow [2024-10-11 17:16:28,877 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-10-11 17:16:28,878 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:28,878 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-10-11 17:16:28,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:16:28,878 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-10-11 17:16:28,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:28,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1755734855, now seen corresponding path program 1 times [2024-10-11 17:16:28,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:28,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278695986] [2024-10-11 17:16:28,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:28,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:28,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:28,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278695986] [2024-10-11 17:16:28,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278695986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:28,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:28,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:28,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288264971] [2024-10-11 17:16:28,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:28,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:28,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:28,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:28,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:28,972 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 413 [2024-10-11 17:16:28,974 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-10-11 17:16:28,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:28,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 413 [2024-10-11 17:16:28,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:29,200 INFO L124 PetriNetUnfolderBase]: 212/1655 cut-off events. [2024-10-11 17:16:29,201 INFO L125 PetriNetUnfolderBase]: For 32/35 co-relation queries the response was YES. [2024-10-11 17:16:29,213 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-10-11 17:16:29,220 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 18 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2024-10-11 17:16:29,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 350 transitions, 767 flow [2024-10-11 17:16:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:29,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1104 transitions. [2024-10-11 17:16:29,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8910411622276029 [2024-10-11 17:16:29,224 INFO L175 Difference]: Start difference. First operand has 352 places, 351 transitions, 729 flow. Second operand 3 states and 1104 transitions. [2024-10-11 17:16:29,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 350 transitions, 767 flow [2024-10-11 17:16:29,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 350 transitions, 747 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:16:29,229 INFO L231 Difference]: Finished difference. Result has 348 places, 350 transitions, 711 flow [2024-10-11 17:16:29,230 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-10-11 17:16:29,231 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -30 predicate places. [2024-10-11 17:16:29,231 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 350 transitions, 711 flow [2024-10-11 17:16:29,232 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-10-11 17:16:29,232 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:29,232 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-10-11 17:16:29,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:16:29,233 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-10-11 17:16:29,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:29,233 INFO L85 PathProgramCache]: Analyzing trace with hash -452728092, now seen corresponding path program 1 times [2024-10-11 17:16:29,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:29,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521041656] [2024-10-11 17:16:29,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:29,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:29,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:29,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521041656] [2024-10-11 17:16:29,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521041656] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:29,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:29,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:29,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526212752] [2024-10-11 17:16:29,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:29,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:29,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:29,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:29,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:29,294 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 413 [2024-10-11 17:16:29,296 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-10-11 17:16:29,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:29,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 413 [2024-10-11 17:16:29,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:29,645 INFO L124 PetriNetUnfolderBase]: 267/2525 cut-off events. [2024-10-11 17:16:29,646 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-10-11 17:16:29,665 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-10-11 17:16:29,674 INFO L140 encePairwiseOnDemand]: 408/413 looper letters, 17 selfloop transitions, 1 changer transitions 0/346 dead transitions. [2024-10-11 17:16:29,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 346 transitions, 739 flow [2024-10-11 17:16:29,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:29,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:29,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1105 transitions. [2024-10-11 17:16:29,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8918482647296206 [2024-10-11 17:16:29,677 INFO L175 Difference]: Start difference. First operand has 348 places, 350 transitions, 711 flow. Second operand 3 states and 1105 transitions. [2024-10-11 17:16:29,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 346 transitions, 739 flow [2024-10-11 17:16:29,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 346 transitions, 735 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:29,683 INFO L231 Difference]: Finished difference. Result has 344 places, 346 transitions, 701 flow [2024-10-11 17:16:29,683 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-10-11 17:16:29,684 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -34 predicate places. [2024-10-11 17:16:29,684 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 346 transitions, 701 flow [2024-10-11 17:16:29,685 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-10-11 17:16:29,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:29,686 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-10-11 17:16:29,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:16:29,686 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-10-11 17:16:29,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:29,686 INFO L85 PathProgramCache]: Analyzing trace with hash -471401314, now seen corresponding path program 1 times [2024-10-11 17:16:29,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:29,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297389698] [2024-10-11 17:16:29,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:29,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:29,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:29,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297389698] [2024-10-11 17:16:29,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297389698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:29,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:29,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:29,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948669109] [2024-10-11 17:16:29,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:29,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:29,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:29,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:29,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:29,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 413 [2024-10-11 17:16:29,753 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-10-11 17:16:29,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:29,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 413 [2024-10-11 17:16:29,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:29,855 INFO L124 PetriNetUnfolderBase]: 32/597 cut-off events. [2024-10-11 17:16:29,856 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:16:29,859 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-10-11 17:16:29,860 INFO L140 encePairwiseOnDemand]: 410/413 looper letters, 12 selfloop transitions, 2 changer transitions 0/345 dead transitions. [2024-10-11 17:16:29,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 345 transitions, 727 flow [2024-10-11 17:16:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1116 transitions. [2024-10-11 17:16:29,864 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9007263922518159 [2024-10-11 17:16:29,864 INFO L175 Difference]: Start difference. First operand has 344 places, 346 transitions, 701 flow. Second operand 3 states and 1116 transitions. [2024-10-11 17:16:29,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 345 transitions, 727 flow [2024-10-11 17:16:29,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 345 transitions, 726 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:29,869 INFO L231 Difference]: Finished difference. Result has 344 places, 345 transitions, 702 flow [2024-10-11 17:16:29,870 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-10-11 17:16:29,870 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -34 predicate places. [2024-10-11 17:16:29,871 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 345 transitions, 702 flow [2024-10-11 17:16:29,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:16:29,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:29,872 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-10-11 17:16:29,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:16:29,872 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-10-11 17:16:29,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1786266170, now seen corresponding path program 1 times [2024-10-11 17:16:29,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:29,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634641122] [2024-10-11 17:16:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:29,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:29,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:29,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634641122] [2024-10-11 17:16:29,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634641122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:29,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:29,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:29,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008559430] [2024-10-11 17:16:29,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:29,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:29,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:29,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:29,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:29,938 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 413 [2024-10-11 17:16:29,940 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-10-11 17:16:29,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:29,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 413 [2024-10-11 17:16:29,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:30,111 INFO L124 PetriNetUnfolderBase]: 123/1366 cut-off events. [2024-10-11 17:16:30,111 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-10-11 17:16:30,122 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-10-11 17:16:30,127 INFO L140 encePairwiseOnDemand]: 408/413 looper letters, 17 selfloop transitions, 1 changer transitions 0/341 dead transitions. [2024-10-11 17:16:30,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 341 transitions, 730 flow [2024-10-11 17:16:30,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:30,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:30,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1105 transitions. [2024-10-11 17:16:30,130 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8918482647296206 [2024-10-11 17:16:30,130 INFO L175 Difference]: Start difference. First operand has 344 places, 345 transitions, 702 flow. Second operand 3 states and 1105 transitions. [2024-10-11 17:16:30,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 341 transitions, 730 flow [2024-10-11 17:16:30,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 341 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:30,136 INFO L231 Difference]: Finished difference. Result has 340 places, 341 transitions, 692 flow [2024-10-11 17:16:30,136 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-10-11 17:16:30,138 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -38 predicate places. [2024-10-11 17:16:30,138 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 341 transitions, 692 flow [2024-10-11 17:16:30,139 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-10-11 17:16:30,139 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:30,140 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-10-11 17:16:30,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:16:30,141 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-10-11 17:16:30,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:30,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1702865575, now seen corresponding path program 1 times [2024-10-11 17:16:30,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:30,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977425395] [2024-10-11 17:16:30,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:30,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:30,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-10-11 17:16:30,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:30,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977425395] [2024-10-11 17:16:30,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977425395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:30,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:30,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:30,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335872239] [2024-10-11 17:16:30,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:30,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:30,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:30,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:30,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:30,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 413 [2024-10-11 17:16:30,228 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-10-11 17:16:30,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:30,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 413 [2024-10-11 17:16:30,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:30,895 INFO L124 PetriNetUnfolderBase]: 771/4413 cut-off events. [2024-10-11 17:16:30,895 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2024-10-11 17:16:30,922 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-10-11 17:16:30,941 INFO L140 encePairwiseOnDemand]: 404/413 looper letters, 27 selfloop transitions, 3 changer transitions 0/343 dead transitions. [2024-10-11 17:16:30,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 343 transitions, 761 flow [2024-10-11 17:16:30,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:30,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1101 transitions. [2024-10-11 17:16:30,945 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8886198547215496 [2024-10-11 17:16:30,945 INFO L175 Difference]: Start difference. First operand has 340 places, 341 transitions, 692 flow. Second operand 3 states and 1101 transitions. [2024-10-11 17:16:30,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 343 transitions, 761 flow [2024-10-11 17:16:30,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 343 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:30,956 INFO L231 Difference]: Finished difference. Result has 336 places, 338 transitions, 700 flow [2024-10-11 17:16:30,957 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-10-11 17:16:30,959 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -42 predicate places. [2024-10-11 17:16:30,959 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 338 transitions, 700 flow [2024-10-11 17:16:30,960 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-10-11 17:16:30,960 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:30,960 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-10-11 17:16:30,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:16:30,961 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-10-11 17:16:30,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1384370475, now seen corresponding path program 1 times [2024-10-11 17:16:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:30,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623041348] [2024-10-11 17:16:30,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:31,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:31,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:31,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623041348] [2024-10-11 17:16:31,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623041348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:31,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:31,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:16:31,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650270601] [2024-10-11 17:16:31,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:31,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:16:31,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:31,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:16:31,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:16:31,422 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 413 [2024-10-11 17:16:31,425 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-10-11 17:16:31,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:31,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 413 [2024-10-11 17:16:31,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:31,943 INFO L124 PetriNetUnfolderBase]: 217/2201 cut-off events. [2024-10-11 17:16:31,944 INFO L125 PetriNetUnfolderBase]: For 21/48 co-relation queries the response was YES. [2024-10-11 17:16:31,965 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-10-11 17:16:31,975 INFO L140 encePairwiseOnDemand]: 400/413 looper letters, 47 selfloop transitions, 14 changer transitions 0/366 dead transitions. [2024-10-11 17:16:31,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 366 transitions, 886 flow [2024-10-11 17:16:31,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:16:31,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 17:16:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3562 transitions. [2024-10-11 17:16:31,983 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8624697336561743 [2024-10-11 17:16:31,984 INFO L175 Difference]: Start difference. First operand has 336 places, 338 transitions, 700 flow. Second operand 10 states and 3562 transitions. [2024-10-11 17:16:31,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 366 transitions, 886 flow [2024-10-11 17:16:31,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 366 transitions, 886 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:16:31,991 INFO L231 Difference]: Finished difference. Result has 349 places, 345 transitions, 766 flow [2024-10-11 17:16:31,992 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-10-11 17:16:31,993 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -29 predicate places. [2024-10-11 17:16:31,993 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 345 transitions, 766 flow [2024-10-11 17:16:31,995 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-10-11 17:16:31,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:31,995 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-10-11 17:16:31,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:16:31,996 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-10-11 17:16:31,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:31,997 INFO L85 PathProgramCache]: Analyzing trace with hash -507042241, now seen corresponding path program 1 times [2024-10-11 17:16:31,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:31,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53211019] [2024-10-11 17:16:31,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:31,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:32,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:32,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53211019] [2024-10-11 17:16:32,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53211019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:32,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:32,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:16:32,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385005070] [2024-10-11 17:16:32,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:32,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:16:32,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:32,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:16:32,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:16:32,172 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 361 out of 413 [2024-10-11 17:16:32,174 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-10-11 17:16:32,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:32,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 361 of 413 [2024-10-11 17:16:32,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:32,498 INFO L124 PetriNetUnfolderBase]: 337/2694 cut-off events. [2024-10-11 17:16:32,498 INFO L125 PetriNetUnfolderBase]: For 101/147 co-relation queries the response was YES. [2024-10-11 17:16:32,512 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-10-11 17:16:32,520 INFO L140 encePairwiseOnDemand]: 407/413 looper letters, 31 selfloop transitions, 5 changer transitions 0/360 dead transitions. [2024-10-11 17:16:32,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 360 transitions, 876 flow [2024-10-11 17:16:32,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:16:32,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:16:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1842 transitions. [2024-10-11 17:16:32,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8920096852300242 [2024-10-11 17:16:32,525 INFO L175 Difference]: Start difference. First operand has 349 places, 345 transitions, 766 flow. Second operand 5 states and 1842 transitions. [2024-10-11 17:16:32,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 360 transitions, 876 flow [2024-10-11 17:16:32,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 360 transitions, 872 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:32,532 INFO L231 Difference]: Finished difference. Result has 354 places, 347 transitions, 787 flow [2024-10-11 17:16:32,532 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-10-11 17:16:32,533 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -24 predicate places. [2024-10-11 17:16:32,533 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 347 transitions, 787 flow [2024-10-11 17:16:32,534 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-10-11 17:16:32,534 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:32,534 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-10-11 17:16:32,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:16:32,535 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-10-11 17:16:32,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:32,535 INFO L85 PathProgramCache]: Analyzing trace with hash -119987171, now seen corresponding path program 1 times [2024-10-11 17:16:32,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:32,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886117698] [2024-10-11 17:16:32,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:32,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:32,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:32,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886117698] [2024-10-11 17:16:32,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886117698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:32,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:32,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:16:32,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451147794] [2024-10-11 17:16:32,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:32,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:16:32,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:32,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:16:32,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:16:33,351 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 413 [2024-10-11 17:16:33,354 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-10-11 17:16:33,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:33,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 413 [2024-10-11 17:16:33,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:33,852 INFO L124 PetriNetUnfolderBase]: 511/2768 cut-off events. [2024-10-11 17:16:33,852 INFO L125 PetriNetUnfolderBase]: For 302/356 co-relation queries the response was YES. [2024-10-11 17:16:33,866 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-10-11 17:16:33,874 INFO L140 encePairwiseOnDemand]: 406/413 looper letters, 45 selfloop transitions, 5 changer transitions 0/361 dead transitions. [2024-10-11 17:16:33,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 361 transitions, 923 flow [2024-10-11 17:16:33,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:16:33,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:16:33,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2144 transitions. [2024-10-11 17:16:33,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8652138821630347 [2024-10-11 17:16:33,880 INFO L175 Difference]: Start difference. First operand has 354 places, 347 transitions, 787 flow. Second operand 6 states and 2144 transitions. [2024-10-11 17:16:33,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 361 transitions, 923 flow [2024-10-11 17:16:33,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 361 transitions, 918 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:33,887 INFO L231 Difference]: Finished difference. Result has 355 places, 345 transitions, 788 flow [2024-10-11 17:16:33,888 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-10-11 17:16:33,888 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -23 predicate places. [2024-10-11 17:16:33,889 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 345 transitions, 788 flow [2024-10-11 17:16:33,890 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-10-11 17:16:33,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:33,890 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-10-11 17:16:33,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:16:33,891 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-10-11 17:16:33,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:33,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1809963800, now seen corresponding path program 1 times [2024-10-11 17:16:33,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:33,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259960917] [2024-10-11 17:16:33,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:33,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:34,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:34,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:34,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259960917] [2024-10-11 17:16:34,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259960917] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:34,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:34,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:16:34,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314304765] [2024-10-11 17:16:34,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:34,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:16:34,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:34,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:16:34,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:16:34,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 413 [2024-10-11 17:16:34,607 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-10-11 17:16:34,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:34,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 413 [2024-10-11 17:16:34,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:35,070 INFO L124 PetriNetUnfolderBase]: 651/2941 cut-off events. [2024-10-11 17:16:35,071 INFO L125 PetriNetUnfolderBase]: For 311/432 co-relation queries the response was YES. [2024-10-11 17:16:35,092 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-10-11 17:16:35,103 INFO L140 encePairwiseOnDemand]: 406/413 looper letters, 43 selfloop transitions, 5 changer transitions 0/359 dead transitions. [2024-10-11 17:16:35,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 359 transitions, 920 flow [2024-10-11 17:16:35,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:16:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:16:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2144 transitions. [2024-10-11 17:16:35,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8652138821630347 [2024-10-11 17:16:35,109 INFO L175 Difference]: Start difference. First operand has 355 places, 345 transitions, 788 flow. Second operand 6 states and 2144 transitions. [2024-10-11 17:16:35,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 359 transitions, 920 flow [2024-10-11 17:16:35,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 359 transitions, 910 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:16:35,115 INFO L231 Difference]: Finished difference. Result has 353 places, 343 transitions, 784 flow [2024-10-11 17:16:35,116 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-10-11 17:16:35,116 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -25 predicate places. [2024-10-11 17:16:35,117 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 343 transitions, 784 flow [2024-10-11 17:16:35,117 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-10-11 17:16:35,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:35,118 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-10-11 17:16:35,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:16:35,118 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-10-11 17:16:35,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:35,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1740639321, now seen corresponding path program 1 times [2024-10-11 17:16:35,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:35,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134651463] [2024-10-11 17:16:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:35,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:16:35,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:35,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134651463] [2024-10-11 17:16:35,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134651463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:35,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:35,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:16:35,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377990626] [2024-10-11 17:16:35,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:35,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:16:35,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:35,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:16:35,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:16:35,860 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 413 [2024-10-11 17:16:35,862 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-10-11 17:16:35,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:35,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 413 [2024-10-11 17:16:35,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:36,298 INFO L124 PetriNetUnfolderBase]: 350/2338 cut-off events. [2024-10-11 17:16:36,298 INFO L125 PetriNetUnfolderBase]: For 140/219 co-relation queries the response was YES. [2024-10-11 17:16:36,312 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-10-11 17:16:36,318 INFO L140 encePairwiseOnDemand]: 406/413 looper letters, 45 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2024-10-11 17:16:36,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 357 transitions, 920 flow [2024-10-11 17:16:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:16:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:16:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2144 transitions. [2024-10-11 17:16:36,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8652138821630347 [2024-10-11 17:16:36,324 INFO L175 Difference]: Start difference. First operand has 353 places, 343 transitions, 784 flow. Second operand 6 states and 2144 transitions. [2024-10-11 17:16:36,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 357 transitions, 920 flow [2024-10-11 17:16:36,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 357 transitions, 910 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:16:36,330 INFO L231 Difference]: Finished difference. Result has 351 places, 341 transitions, 780 flow [2024-10-11 17:16:36,331 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-10-11 17:16:36,332 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -27 predicate places. [2024-10-11 17:16:36,332 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 341 transitions, 780 flow [2024-10-11 17:16:36,333 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-10-11 17:16:36,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:36,333 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-10-11 17:16:36,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:16:36,333 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-10-11 17:16:36,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:36,334 INFO L85 PathProgramCache]: Analyzing trace with hash -801679105, now seen corresponding path program 1 times [2024-10-11 17:16:36,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:36,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630524083] [2024-10-11 17:16:36,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:36,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:36,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:36,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630524083] [2024-10-11 17:16:36,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630524083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:36,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:36,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:36,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026744939] [2024-10-11 17:16:36,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:36,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:36,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:36,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:36,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:36,386 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 413 [2024-10-11 17:16:36,387 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-10-11 17:16:36,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:36,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 413 [2024-10-11 17:16:36,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:36,644 INFO L124 PetriNetUnfolderBase]: 128/1639 cut-off events. [2024-10-11 17:16:36,644 INFO L125 PetriNetUnfolderBase]: For 43/68 co-relation queries the response was YES. [2024-10-11 17:16:36,652 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-10-11 17:16:36,656 INFO L140 encePairwiseOnDemand]: 411/413 looper letters, 10 selfloop transitions, 1 changer transitions 0/340 dead transitions. [2024-10-11 17:16:36,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 340 transitions, 800 flow [2024-10-11 17:16:36,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1125 transitions. [2024-10-11 17:16:36,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9079903147699758 [2024-10-11 17:16:36,660 INFO L175 Difference]: Start difference. First operand has 351 places, 341 transitions, 780 flow. Second operand 3 states and 1125 transitions. [2024-10-11 17:16:36,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 340 transitions, 800 flow [2024-10-11 17:16:36,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 340 transitions, 790 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:16:36,667 INFO L231 Difference]: Finished difference. Result has 347 places, 340 transitions, 770 flow [2024-10-11 17:16:36,667 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-10-11 17:16:36,668 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -31 predicate places. [2024-10-11 17:16:36,668 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 340 transitions, 770 flow [2024-10-11 17:16:36,669 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-10-11 17:16:36,669 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:36,669 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-10-11 17:16:36,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:16:36,670 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-10-11 17:16:36,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:36,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2009689025, now seen corresponding path program 1 times [2024-10-11 17:16:36,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:36,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459331127] [2024-10-11 17:16:36,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:36,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:36,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:36,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459331127] [2024-10-11 17:16:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459331127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:36,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:36,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:36,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034968074] [2024-10-11 17:16:36,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:36,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:36,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:36,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:36,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:36,730 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 413 [2024-10-11 17:16:36,731 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-10-11 17:16:36,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:36,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 413 [2024-10-11 17:16:36,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:37,045 INFO L124 PetriNetUnfolderBase]: 128/1631 cut-off events. [2024-10-11 17:16:37,045 INFO L125 PetriNetUnfolderBase]: For 43/68 co-relation queries the response was YES. [2024-10-11 17:16:37,059 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-10-11 17:16:37,060 INFO L140 encePairwiseOnDemand]: 411/413 looper letters, 0 selfloop transitions, 0 changer transitions 339/339 dead transitions. [2024-10-11 17:16:37,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 339 transitions, 788 flow [2024-10-11 17:16:37,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:37,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1124 transitions. [2024-10-11 17:16:37,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9071832122679581 [2024-10-11 17:16:37,064 INFO L175 Difference]: Start difference. First operand has 347 places, 340 transitions, 770 flow. Second operand 3 states and 1124 transitions. [2024-10-11 17:16:37,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 339 transitions, 788 flow [2024-10-11 17:16:37,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 339 transitions, 787 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:16:37,069 INFO L231 Difference]: Finished difference. Result has 347 places, 0 transitions, 0 flow [2024-10-11 17:16:37,070 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-10-11 17:16:37,070 INFO L277 CegarLoopForPetriNet]: 378 programPoint places, -31 predicate places. [2024-10-11 17:16:37,070 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 0 transitions, 0 flow [2024-10-11 17:16:37,071 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-10-11 17:16:37,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (78 of 79 remaining) [2024-10-11 17:16:37,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (77 of 79 remaining) [2024-10-11 17:16:37,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 79 remaining) [2024-10-11 17:16:37,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (75 of 79 remaining) [2024-10-11 17:16:37,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (74 of 79 remaining) [2024-10-11 17:16:37,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 79 remaining) [2024-10-11 17:16:37,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (72 of 79 remaining) [2024-10-11 17:16:37,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (71 of 79 remaining) [2024-10-11 17:16:37,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (70 of 79 remaining) [2024-10-11 17:16:37,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 79 remaining) [2024-10-11 17:16:37,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (68 of 79 remaining) [2024-10-11 17:16:37,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (67 of 79 remaining) [2024-10-11 17:16:37,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (66 of 79 remaining) [2024-10-11 17:16:37,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (65 of 79 remaining) [2024-10-11 17:16:37,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (64 of 79 remaining) [2024-10-11 17:16:37,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (63 of 79 remaining) [2024-10-11 17:16:37,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (62 of 79 remaining) [2024-10-11 17:16:37,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (61 of 79 remaining) [2024-10-11 17:16:37,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (60 of 79 remaining) [2024-10-11 17:16:37,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (59 of 79 remaining) [2024-10-11 17:16:37,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (58 of 79 remaining) [2024-10-11 17:16:37,076 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (57 of 79 remaining) [2024-10-11 17:16:37,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (56 of 79 remaining) [2024-10-11 17:16:37,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (55 of 79 remaining) [2024-10-11 17:16:37,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (54 of 79 remaining) [2024-10-11 17:16:37,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (53 of 79 remaining) [2024-10-11 17:16:37,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (52 of 79 remaining) [2024-10-11 17:16:37,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (51 of 79 remaining) [2024-10-11 17:16:37,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (50 of 79 remaining) [2024-10-11 17:16:37,077 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (49 of 79 remaining) [2024-10-11 17:16:37,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (48 of 79 remaining) [2024-10-11 17:16:37,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (47 of 79 remaining) [2024-10-11 17:16:37,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (46 of 79 remaining) [2024-10-11 17:16:37,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (45 of 79 remaining) [2024-10-11 17:16:37,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 79 remaining) [2024-10-11 17:16:37,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (43 of 79 remaining) [2024-10-11 17:16:37,078 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (42 of 79 remaining) [2024-10-11 17:16:37,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (41 of 79 remaining) [2024-10-11 17:16:37,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (40 of 79 remaining) [2024-10-11 17:16:37,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (39 of 79 remaining) [2024-10-11 17:16:37,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (38 of 79 remaining) [2024-10-11 17:16:37,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (37 of 79 remaining) [2024-10-11 17:16:37,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (36 of 79 remaining) [2024-10-11 17:16:37,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (35 of 79 remaining) [2024-10-11 17:16:37,079 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (34 of 79 remaining) [2024-10-11 17:16:37,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 79 remaining) [2024-10-11 17:16:37,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 79 remaining) [2024-10-11 17:16:37,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 79 remaining) [2024-10-11 17:16:37,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (30 of 79 remaining) [2024-10-11 17:16:37,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (29 of 79 remaining) [2024-10-11 17:16:37,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (28 of 79 remaining) [2024-10-11 17:16:37,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 79 remaining) [2024-10-11 17:16:37,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 79 remaining) [2024-10-11 17:16:37,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 79 remaining) [2024-10-11 17:16:37,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (24 of 79 remaining) [2024-10-11 17:16:37,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (23 of 79 remaining) [2024-10-11 17:16:37,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (22 of 79 remaining) [2024-10-11 17:16:37,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (21 of 79 remaining) [2024-10-11 17:16:37,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (20 of 79 remaining) [2024-10-11 17:16:37,081 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (19 of 79 remaining) [2024-10-11 17:16:37,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (18 of 79 remaining) [2024-10-11 17:16:37,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 79 remaining) [2024-10-11 17:16:37,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (16 of 79 remaining) [2024-10-11 17:16:37,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (15 of 79 remaining) [2024-10-11 17:16:37,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (14 of 79 remaining) [2024-10-11 17:16:37,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (13 of 79 remaining) [2024-10-11 17:16:37,082 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (12 of 79 remaining) [2024-10-11 17:16:37,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (11 of 79 remaining) [2024-10-11 17:16:37,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (10 of 79 remaining) [2024-10-11 17:16:37,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 79 remaining) [2024-10-11 17:16:37,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (8 of 79 remaining) [2024-10-11 17:16:37,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (7 of 79 remaining) [2024-10-11 17:16:37,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (6 of 79 remaining) [2024-10-11 17:16:37,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 79 remaining) [2024-10-11 17:16:37,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (4 of 79 remaining) [2024-10-11 17:16:37,083 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (3 of 79 remaining) [2024-10-11 17:16:37,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (2 of 79 remaining) [2024-10-11 17:16:37,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (1 of 79 remaining) [2024-10-11 17:16:37,084 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (0 of 79 remaining) [2024-10-11 17:16:37,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:16:37,084 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:16:37,091 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:16:37,091 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:16:37,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:16:37 BasicIcfg [2024-10-11 17:16:37,098 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:16:37,099 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:16:37,099 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:16:37,099 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:16:37,099 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:16:23" (3/4) ... [2024-10-11 17:16:37,101 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:16:37,104 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:16:37,104 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:16:37,104 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-11 17:16:37,110 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2024-10-11 17:16:37,111 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:16:37,111 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:16:37,111 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:16:37,221 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:16:37,221 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:16:37,222 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:16:37,222 INFO L158 Benchmark]: Toolchain (without parser) took 15415.13ms. Allocated memory was 176.2MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 140.0MB in the beginning and 884.6MB in the end (delta: -744.6MB). Peak memory consumption was 298.9MB. Max. memory is 16.1GB. [2024-10-11 17:16:37,222 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:16:37,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.65ms. Allocated memory is still 176.2MB. Free memory was 139.5MB in the beginning and 124.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:16:37,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.02ms. Allocated memory is still 176.2MB. Free memory was 124.4MB in the beginning and 120.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:16:37,223 INFO L158 Benchmark]: Boogie Preprocessor took 78.40ms. Allocated memory is still 176.2MB. Free memory was 120.3MB in the beginning and 117.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:16:37,223 INFO L158 Benchmark]: RCFGBuilder took 1230.04ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 117.1MB in the beginning and 170.7MB in the end (delta: -53.6MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2024-10-11 17:16:37,224 INFO L158 Benchmark]: TraceAbstraction took 13527.36ms. Allocated memory was 237.0MB in the beginning and 1.2GB in the end (delta: 981.5MB). Free memory was 169.6MB in the beginning and 890.9MB in the end (delta: -721.2MB). Peak memory consumption was 259.2MB. Max. memory is 16.1GB. [2024-10-11 17:16:37,227 INFO L158 Benchmark]: Witness Printer took 123.04ms. Allocated memory is still 1.2GB. Free memory was 890.9MB in the beginning and 884.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:16:37,228 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.17ms. Allocated memory is still 176.2MB. Free memory is still 139.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.65ms. Allocated memory is still 176.2MB. Free memory was 139.5MB in the beginning and 124.4MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.02ms. Allocated memory is still 176.2MB. Free memory was 124.4MB in the beginning and 120.3MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.40ms. Allocated memory is still 176.2MB. Free memory was 120.3MB in the beginning and 117.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1230.04ms. Allocated memory was 176.2MB in the beginning and 237.0MB in the end (delta: 60.8MB). Free memory was 117.1MB in the beginning and 170.7MB in the end (delta: -53.6MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13527.36ms. Allocated memory was 237.0MB in the beginning and 1.2GB in the end (delta: 981.5MB). Free memory was 169.6MB in the beginning and 890.9MB in the end (delta: -721.2MB). Peak memory consumption was 259.2MB. Max. memory is 16.1GB. * Witness Printer took 123.04ms. Allocated memory is still 1.2GB. Free memory was 890.9MB in the beginning and 884.6MB 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: 13.3s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1462 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 838 mSDsluCounter, 547 SdHoareTripleChecker+Invalid, 2.2s 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.3s 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s 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-10-11 17:16:37,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE