./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-simple-array-sum.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-simple-array-sum.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 e53c8de1752bcaae88365f4089aa38090949baac13984623f5e7e3707a7b4c63 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:17:20,877 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:17:20,947 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:17:20,952 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:17:20,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:17:20,970 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:17:20,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:17:20,971 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:17:20,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:17:20,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:17:20,972 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:17:20,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:17:20,973 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:17:20,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:17:20,974 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:17:20,974 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:17:20,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:17:20,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:17:20,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:17:20,975 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:17:20,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:17:20,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:17:20,976 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:17:20,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:17:20,977 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:17:20,977 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:17:20,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:17:20,978 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:17:20,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:17:20,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:17:20,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:17:20,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:17:20,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:17:20,979 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:17:20,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:17:20,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:17:20,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:17:20,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:17:20,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:17:20,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:17:20,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:17:20,983 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 -> e53c8de1752bcaae88365f4089aa38090949baac13984623f5e7e3707a7b4c63 [2024-10-11 17:17:21,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:17:21,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:17:21,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:17:21,296 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:17:21,297 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:17:21,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2024-10-11 17:17:22,671 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:17:22,855 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:17:22,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-simple-array-sum.wvr.c [2024-10-11 17:17:22,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/91998e596/9385c6cd1f5a4c49ba0f63dba51cabe7/FLAG114a507ce [2024-10-11 17:17:22,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/91998e596/9385c6cd1f5a4c49ba0f63dba51cabe7 [2024-10-11 17:17:22,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:17:22,883 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:17:22,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:17:22,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:17:22,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:17:22,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:17:22" (1/1) ... [2024-10-11 17:17:22,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51b3c18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:22, skipping insertion in model container [2024-10-11 17:17:22,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:17:22" (1/1) ... [2024-10-11 17:17:22,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:17:23,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:17:23,157 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:17:23,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:17:23,200 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:17:23,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:23 WrapperNode [2024-10-11 17:17:23,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:17:23,201 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:17:23,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:17:23,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:17:23,207 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:17:23" (1/1) ... [2024-10-11 17:17:23,216 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:17:23" (1/1) ... [2024-10-11 17:17:23,244 INFO L138 Inliner]: procedures = 25, calls = 29, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 147 [2024-10-11 17:17:23,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:17:23,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:17:23,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:17:23,245 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:17:23,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:23" (1/1) ... [2024-10-11 17:17:23,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:23" (1/1) ... [2024-10-11 17:17:23,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:23" (1/1) ... [2024-10-11 17:17:23,263 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:23" (1/1) ... [2024-10-11 17:17:23,274 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:23" (1/1) ... [2024-10-11 17:17:23,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:23" (1/1) ... [2024-10-11 17:17:23,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:23" (1/1) ... [2024-10-11 17:17:23,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:23" (1/1) ... [2024-10-11 17:17:23,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:17:23,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:17:23,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:17:23,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:17:23,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:23" (1/1) ... [2024-10-11 17:17:23,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:17:23,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:17:23,334 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:17:23,338 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:17:23,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:17:23,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:17:23,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:17:23,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:17:23,378 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:17:23,378 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:17:23,379 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:17:23,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:17:23,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:17:23,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:17:23,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:17:23,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:17:23,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:17:23,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:17:23,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:17:23,383 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:17:23,526 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:17:23,531 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:17:24,034 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:17:24,034 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:17:24,165 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:17:24,165 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 17:17:24,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:24 BoogieIcfgContainer [2024-10-11 17:17:24,166 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:17:24,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:17:24,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:17:24,173 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:17:24,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:17:22" (1/3) ... [2024-10-11 17:17:24,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8fd80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:17:24, skipping insertion in model container [2024-10-11 17:17:24,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:23" (2/3) ... [2024-10-11 17:17:24,175 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b8fd80a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:17:24, skipping insertion in model container [2024-10-11 17:17:24,175 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:24" (3/3) ... [2024-10-11 17:17:24,176 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-array-sum.wvr.c [2024-10-11 17:17:24,193 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:17:24,195 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2024-10-11 17:17:24,195 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:17:24,279 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:17:24,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 261 places, 267 transitions, 555 flow [2024-10-11 17:17:24,441 INFO L124 PetriNetUnfolderBase]: 16/264 cut-off events. [2024-10-11 17:17:24,442 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:17:24,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 264 events. 16/264 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 375 event pairs, 0 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 212. Up to 2 conditions per place. [2024-10-11 17:17:24,452 INFO L82 GeneralOperation]: Start removeDead. Operand has 261 places, 267 transitions, 555 flow [2024-10-11 17:17:24,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 242 places, 247 transitions, 512 flow [2024-10-11 17:17:24,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:17:24,485 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;@17657678, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:17:24,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-10-11 17:17:24,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:17:24,492 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2024-10-11 17:17:24,492 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:17:24,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:24,493 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] [2024-10-11 17:17:24,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:24,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:24,501 INFO L85 PathProgramCache]: Analyzing trace with hash 510647353, now seen corresponding path program 1 times [2024-10-11 17:17:24,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:24,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604842391] [2024-10-11 17:17:24,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:24,719 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:17:24,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:24,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604842391] [2024-10-11 17:17:24,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604842391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:24,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:24,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:24,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021108809] [2024-10-11 17:17:24,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:24,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:24,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:24,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:24,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:24,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 267 [2024-10-11 17:17:24,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 247 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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:17:24,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:24,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 267 [2024-10-11 17:17:24,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:25,180 INFO L124 PetriNetUnfolderBase]: 110/714 cut-off events. [2024-10-11 17:17:25,180 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-10-11 17:17:25,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 937 conditions, 714 events. 110/714 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3768 event pairs, 71 based on Foata normal form. 6/609 useless extension candidates. Maximal degree in co-relation 712. Up to 174 conditions per place. [2024-10-11 17:17:25,196 INFO L140 encePairwiseOnDemand]: 245/267 looper letters, 19 selfloop transitions, 2 changer transitions 4/227 dead transitions. [2024-10-11 17:17:25,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 227 transitions, 514 flow [2024-10-11 17:17:25,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:25,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2024-10-11 17:17:25,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8863920099875156 [2024-10-11 17:17:25,217 INFO L175 Difference]: Start difference. First operand has 242 places, 247 transitions, 512 flow. Second operand 3 states and 710 transitions. [2024-10-11 17:17:25,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 227 transitions, 514 flow [2024-10-11 17:17:25,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 227 transitions, 502 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:17:25,229 INFO L231 Difference]: Finished difference. Result has 227 places, 223 transitions, 456 flow [2024-10-11 17:17:25,231 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=227, PETRI_TRANSITIONS=223} [2024-10-11 17:17:25,237 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -15 predicate places. [2024-10-11 17:17:25,238 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 223 transitions, 456 flow [2024-10-11 17:17:25,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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:17:25,239 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:25,239 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] [2024-10-11 17:17:25,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:17:25,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:25,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1867613618, now seen corresponding path program 1 times [2024-10-11 17:17:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:25,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900110122] [2024-10-11 17:17:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:25,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:25,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:25,307 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:17:25,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:25,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900110122] [2024-10-11 17:17:25,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900110122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:25,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:25,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:25,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197892371] [2024-10-11 17:17:25,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:25,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:25,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:25,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:25,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:25,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 267 [2024-10-11 17:17:25,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 223 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 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:17:25,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:25,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 267 [2024-10-11 17:17:25,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:25,534 INFO L124 PetriNetUnfolderBase]: 262/953 cut-off events. [2024-10-11 17:17:25,536 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2024-10-11 17:17:25,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1343 conditions, 953 events. 262/953 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5407 event pairs, 164 based on Foata normal form. 1/826 useless extension candidates. Maximal degree in co-relation 1312. Up to 365 conditions per place. [2024-10-11 17:17:25,570 INFO L140 encePairwiseOnDemand]: 260/267 looper letters, 20 selfloop transitions, 1 changer transitions 2/217 dead transitions. [2024-10-11 17:17:25,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 217 transitions, 488 flow [2024-10-11 17:17:25,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 679 transitions. [2024-10-11 17:17:25,576 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8476903870162297 [2024-10-11 17:17:25,576 INFO L175 Difference]: Start difference. First operand has 227 places, 223 transitions, 456 flow. Second operand 3 states and 679 transitions. [2024-10-11 17:17:25,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 217 transitions, 488 flow [2024-10-11 17:17:25,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 217 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:25,583 INFO L231 Difference]: Finished difference. Result has 217 places, 215 transitions, 438 flow [2024-10-11 17:17:25,585 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=217, PETRI_TRANSITIONS=215} [2024-10-11 17:17:25,586 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -25 predicate places. [2024-10-11 17:17:25,587 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 215 transitions, 438 flow [2024-10-11 17:17:25,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 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:17:25,588 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:25,588 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:25,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:17:25,591 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:25,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:25,591 INFO L85 PathProgramCache]: Analyzing trace with hash -75217045, now seen corresponding path program 1 times [2024-10-11 17:17:25,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:25,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362834133] [2024-10-11 17:17:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:25,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:26,286 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:17:26,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:26,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362834133] [2024-10-11 17:17:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362834133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:26,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:26,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:26,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27399986] [2024-10-11 17:17:26,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:26,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:26,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:26,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:26,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:26,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 267 [2024-10-11 17:17:26,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 215 transitions, 438 flow. Second operand has 6 states, 6 states have (on average 205.5) internal successors, (1233), 6 states have internal predecessors, (1233), 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:17:26,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:26,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 267 [2024-10-11 17:17:26,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:26,725 INFO L124 PetriNetUnfolderBase]: 146/871 cut-off events. [2024-10-11 17:17:26,725 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-11 17:17:26,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 871 events. 146/871 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4903 event pairs, 92 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 1107. Up to 232 conditions per place. [2024-10-11 17:17:26,734 INFO L140 encePairwiseOnDemand]: 255/267 looper letters, 30 selfloop transitions, 10 changer transitions 0/213 dead transitions. [2024-10-11 17:17:26,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 213 transitions, 514 flow [2024-10-11 17:17:26,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1266 transitions. [2024-10-11 17:17:26,739 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7902621722846442 [2024-10-11 17:17:26,739 INFO L175 Difference]: Start difference. First operand has 217 places, 215 transitions, 438 flow. Second operand 6 states and 1266 transitions. [2024-10-11 17:17:26,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 213 transitions, 514 flow [2024-10-11 17:17:26,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 513 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:26,743 INFO L231 Difference]: Finished difference. Result has 217 places, 213 transitions, 453 flow [2024-10-11 17:17:26,744 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=217, PETRI_TRANSITIONS=213} [2024-10-11 17:17:26,745 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -25 predicate places. [2024-10-11 17:17:26,746 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 213 transitions, 453 flow [2024-10-11 17:17:26,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.5) internal successors, (1233), 6 states have internal predecessors, (1233), 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:17:26,747 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:26,747 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] [2024-10-11 17:17:26,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:17:26,748 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:26,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:26,749 INFO L85 PathProgramCache]: Analyzing trace with hash -518200873, now seen corresponding path program 1 times [2024-10-11 17:17:26,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:26,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524482751] [2024-10-11 17:17:26,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:26,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:26,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:26,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524482751] [2024-10-11 17:17:26,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524482751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:26,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:26,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:26,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964885355] [2024-10-11 17:17:26,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:26,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:26,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:26,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:26,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:26,808 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 267 [2024-10-11 17:17:26,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 213 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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:17:26,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:26,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 267 [2024-10-11 17:17:26,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:26,889 INFO L124 PetriNetUnfolderBase]: 59/395 cut-off events. [2024-10-11 17:17:26,889 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:17:26,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 395 events. 59/395 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1412 event pairs, 38 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 481. Up to 93 conditions per place. [2024-10-11 17:17:26,894 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 14 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2024-10-11 17:17:26,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 212 transitions, 483 flow [2024-10-11 17:17:26,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:26,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:26,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2024-10-11 17:17:26,897 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8751560549313359 [2024-10-11 17:17:26,897 INFO L175 Difference]: Start difference. First operand has 217 places, 213 transitions, 453 flow. Second operand 3 states and 701 transitions. [2024-10-11 17:17:26,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 212 transitions, 483 flow [2024-10-11 17:17:26,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 212 transitions, 463 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:17:26,902 INFO L231 Difference]: Finished difference. Result has 213 places, 212 transitions, 435 flow [2024-10-11 17:17:26,902 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=213, PETRI_TRANSITIONS=212} [2024-10-11 17:17:26,903 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -29 predicate places. [2024-10-11 17:17:26,903 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 212 transitions, 435 flow [2024-10-11 17:17:26,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.33333333333334) internal successors, (688), 3 states have internal predecessors, (688), 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:17:26,904 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:26,905 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] [2024-10-11 17:17:26,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:17:26,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:26,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:26,906 INFO L85 PathProgramCache]: Analyzing trace with hash 20922305, now seen corresponding path program 1 times [2024-10-11 17:17:26,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:26,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137401004] [2024-10-11 17:17:26,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:26,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:26,946 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:17:26,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:26,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137401004] [2024-10-11 17:17:26,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137401004] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:26,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:26,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:26,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111839644] [2024-10-11 17:17:26,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:26,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:26,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:26,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:26,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:26,957 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 267 [2024-10-11 17:17:26,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 212 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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:17:26,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:26,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 267 [2024-10-11 17:17:26,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:27,029 INFO L124 PetriNetUnfolderBase]: 35/296 cut-off events. [2024-10-11 17:17:27,029 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-11 17:17:27,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367 conditions, 296 events. 35/296 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 748 event pairs, 20 based on Foata normal form. 0/281 useless extension candidates. Maximal degree in co-relation 336. Up to 59 conditions per place. [2024-10-11 17:17:27,032 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 13 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-10-11 17:17:27,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 211 transitions, 463 flow [2024-10-11 17:17:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:27,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2024-10-11 17:17:27,035 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8776529338327091 [2024-10-11 17:17:27,035 INFO L175 Difference]: Start difference. First operand has 213 places, 212 transitions, 435 flow. Second operand 3 states and 703 transitions. [2024-10-11 17:17:27,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 211 transitions, 463 flow [2024-10-11 17:17:27,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 211 transitions, 459 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:27,039 INFO L231 Difference]: Finished difference. Result has 212 places, 211 transitions, 433 flow [2024-10-11 17:17:27,039 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=212, PETRI_TRANSITIONS=211} [2024-10-11 17:17:27,040 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -30 predicate places. [2024-10-11 17:17:27,040 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 211 transitions, 433 flow [2024-10-11 17:17:27,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 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:17:27,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:27,041 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] [2024-10-11 17:17:27,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:17:27,042 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:27,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:27,042 INFO L85 PathProgramCache]: Analyzing trace with hash -987699900, now seen corresponding path program 1 times [2024-10-11 17:17:27,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:27,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25416597] [2024-10-11 17:17:27,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:27,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:27,088 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:17:27,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:27,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25416597] [2024-10-11 17:17:27,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25416597] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:27,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:27,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:27,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386242949] [2024-10-11 17:17:27,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:27,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:27,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:27,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:27,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:27,103 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 267 [2024-10-11 17:17:27,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 211 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 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:17:27,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:27,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 267 [2024-10-11 17:17:27,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:27,218 INFO L124 PetriNetUnfolderBase]: 120/669 cut-off events. [2024-10-11 17:17:27,219 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-10-11 17:17:27,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 669 events. 120/669 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3254 event pairs, 38 based on Foata normal form. 1/605 useless extension candidates. Maximal degree in co-relation 842. Up to 100 conditions per place. [2024-10-11 17:17:27,224 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 17 selfloop transitions, 2 changer transitions 2/215 dead transitions. [2024-10-11 17:17:27,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 215 transitions, 483 flow [2024-10-11 17:17:27,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:27,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:27,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions. [2024-10-11 17:17:27,227 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.885143570536829 [2024-10-11 17:17:27,227 INFO L175 Difference]: Start difference. First operand has 212 places, 211 transitions, 433 flow. Second operand 3 states and 709 transitions. [2024-10-11 17:17:27,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 215 transitions, 483 flow [2024-10-11 17:17:27,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 215 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:27,232 INFO L231 Difference]: Finished difference. Result has 210 places, 207 transitions, 425 flow [2024-10-11 17:17:27,232 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=210, PETRI_TRANSITIONS=207} [2024-10-11 17:17:27,233 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -32 predicate places. [2024-10-11 17:17:27,233 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 207 transitions, 425 flow [2024-10-11 17:17:27,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 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:17:27,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:27,234 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] [2024-10-11 17:17:27,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:17:27,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:27,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash 8192390, now seen corresponding path program 1 times [2024-10-11 17:17:27,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:27,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003408163] [2024-10-11 17:17:27,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:27,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:27,289 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:17:27,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:27,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003408163] [2024-10-11 17:17:27,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003408163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:27,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:27,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:27,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511165955] [2024-10-11 17:17:27,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:27,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:27,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:27,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:27,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:27,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 267 [2024-10-11 17:17:27,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 207 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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:17:27,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:27,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 267 [2024-10-11 17:17:27,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:27,398 INFO L124 PetriNetUnfolderBase]: 104/641 cut-off events. [2024-10-11 17:17:27,399 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-10-11 17:17:27,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 641 events. 104/641 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3187 event pairs, 12 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 801. Up to 143 conditions per place. [2024-10-11 17:17:27,404 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 20 selfloop transitions, 2 changer transitions 0/215 dead transitions. [2024-10-11 17:17:27,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 215 transitions, 490 flow [2024-10-11 17:17:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-10-11 17:17:27,406 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8976279650436954 [2024-10-11 17:17:27,407 INFO L175 Difference]: Start difference. First operand has 210 places, 207 transitions, 425 flow. Second operand 3 states and 719 transitions. [2024-10-11 17:17:27,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 215 transitions, 490 flow [2024-10-11 17:17:27,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 215 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:27,411 INFO L231 Difference]: Finished difference. Result has 208 places, 208 transitions, 433 flow [2024-10-11 17:17:27,411 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=208, PETRI_TRANSITIONS=208} [2024-10-11 17:17:27,412 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -34 predicate places. [2024-10-11 17:17:27,412 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 208 transitions, 433 flow [2024-10-11 17:17:27,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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:17:27,413 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:27,413 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:17:27,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:17:27,414 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:27,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:27,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1371360790, now seen corresponding path program 1 times [2024-10-11 17:17:27,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:27,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363187178] [2024-10-11 17:17:27,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:27,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:27,571 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:17:27,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:27,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363187178] [2024-10-11 17:17:27,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363187178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:27,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:27,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:17:27,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602321256] [2024-10-11 17:17:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:27,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:17:27,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:27,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:17:27,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:17:27,826 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 267 [2024-10-11 17:17:27,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 208 transitions, 433 flow. Second operand has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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:17:27,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:27,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 267 [2024-10-11 17:17:27,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:28,174 INFO L124 PetriNetUnfolderBase]: 258/1319 cut-off events. [2024-10-11 17:17:28,174 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2024-10-11 17:17:28,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 1319 events. 258/1319 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 7489 event pairs, 150 based on Foata normal form. 13/1261 useless extension candidates. Maximal degree in co-relation 1917. Up to 274 conditions per place. [2024-10-11 17:17:28,184 INFO L140 encePairwiseOnDemand]: 246/267 looper letters, 46 selfloop transitions, 28 changer transitions 0/247 dead transitions. [2024-10-11 17:17:28,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 247 transitions, 677 flow [2024-10-11 17:17:28,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 17:17:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 17:17:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2192 transitions. [2024-10-11 17:17:28,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8209737827715355 [2024-10-11 17:17:28,190 INFO L175 Difference]: Start difference. First operand has 208 places, 208 transitions, 433 flow. Second operand 10 states and 2192 transitions. [2024-10-11 17:17:28,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 247 transitions, 677 flow [2024-10-11 17:17:28,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 247 transitions, 677 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:17:28,195 INFO L231 Difference]: Finished difference. Result has 221 places, 224 transitions, 562 flow [2024-10-11 17:17:28,196 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=562, PETRI_PLACES=221, PETRI_TRANSITIONS=224} [2024-10-11 17:17:28,196 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -21 predicate places. [2024-10-11 17:17:28,197 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 224 transitions, 562 flow [2024-10-11 17:17:28,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 215.0) internal successors, (1505), 7 states have internal predecessors, (1505), 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:17:28,198 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:28,198 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] [2024-10-11 17:17:28,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:17:28,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:28,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:28,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1479561612, now seen corresponding path program 1 times [2024-10-11 17:17:28,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:28,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539829941] [2024-10-11 17:17:28,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:28,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:17:28,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:28,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539829941] [2024-10-11 17:17:28,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539829941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:28,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:28,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:28,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864572978] [2024-10-11 17:17:28,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:28,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:28,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:28,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:28,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:28,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 267 [2024-10-11 17:17:28,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 224 transitions, 562 flow. Second operand has 6 states, 6 states have (on average 219.83333333333334) internal successors, (1319), 6 states have internal predecessors, (1319), 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:17:28,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:28,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 267 [2024-10-11 17:17:28,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:29,339 INFO L124 PetriNetUnfolderBase]: 408/1670 cut-off events. [2024-10-11 17:17:29,339 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2024-10-11 17:17:29,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2750 conditions, 1670 events. 408/1670 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 10595 event pairs, 176 based on Foata normal form. 0/1579 useless extension candidates. Maximal degree in co-relation 2711. Up to 517 conditions per place. [2024-10-11 17:17:29,353 INFO L140 encePairwiseOnDemand]: 259/267 looper letters, 51 selfloop transitions, 10 changer transitions 0/253 dead transitions. [2024-10-11 17:17:29,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 253 transitions, 758 flow [2024-10-11 17:17:29,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1361 transitions. [2024-10-11 17:17:29,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8495630461922596 [2024-10-11 17:17:29,357 INFO L175 Difference]: Start difference. First operand has 221 places, 224 transitions, 562 flow. Second operand 6 states and 1361 transitions. [2024-10-11 17:17:29,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 253 transitions, 758 flow [2024-10-11 17:17:29,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 253 transitions, 758 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:17:29,363 INFO L231 Difference]: Finished difference. Result has 231 places, 233 transitions, 642 flow [2024-10-11 17:17:29,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=642, PETRI_PLACES=231, PETRI_TRANSITIONS=233} [2024-10-11 17:17:29,364 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -11 predicate places. [2024-10-11 17:17:29,364 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 233 transitions, 642 flow [2024-10-11 17:17:29,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.83333333333334) internal successors, (1319), 6 states have internal predecessors, (1319), 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:17:29,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:29,365 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:29,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:17:29,366 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:29,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:29,366 INFO L85 PathProgramCache]: Analyzing trace with hash 828749171, now seen corresponding path program 1 times [2024-10-11 17:17:29,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:29,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042570890] [2024-10-11 17:17:29,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:29,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:29,411 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:17:29,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:29,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042570890] [2024-10-11 17:17:29,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042570890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:29,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:29,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:29,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093349399] [2024-10-11 17:17:29,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:29,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:29,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:29,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:29,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:29,418 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 267 [2024-10-11 17:17:29,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 233 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:29,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:29,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 267 [2024-10-11 17:17:29,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:29,574 INFO L124 PetriNetUnfolderBase]: 163/917 cut-off events. [2024-10-11 17:17:29,574 INFO L125 PetriNetUnfolderBase]: For 437/479 co-relation queries the response was YES. [2024-10-11 17:17:29,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1554 conditions, 917 events. 163/917 cut-off events. For 437/479 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4690 event pairs, 58 based on Foata normal form. 4/872 useless extension candidates. Maximal degree in co-relation 1511. Up to 221 conditions per place. [2024-10-11 17:17:29,582 INFO L140 encePairwiseOnDemand]: 265/267 looper letters, 14 selfloop transitions, 0 changer transitions 16/232 dead transitions. [2024-10-11 17:17:29,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 232 transitions, 672 flow [2024-10-11 17:17:29,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:29,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2024-10-11 17:17:29,584 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8876404494382022 [2024-10-11 17:17:29,584 INFO L175 Difference]: Start difference. First operand has 231 places, 233 transitions, 642 flow. Second operand 3 states and 711 transitions. [2024-10-11 17:17:29,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 232 transitions, 672 flow [2024-10-11 17:17:29,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 232 transitions, 664 flow, removed 4 selfloop flow, removed 0 redundant places. [2024-10-11 17:17:29,590 INFO L231 Difference]: Finished difference. Result has 232 places, 216 transitions, 556 flow [2024-10-11 17:17:29,591 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=232, PETRI_TRANSITIONS=216} [2024-10-11 17:17:29,591 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -10 predicate places. [2024-10-11 17:17:29,592 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 216 transitions, 556 flow [2024-10-11 17:17:29,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:29,592 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:29,593 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:17:29,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:17:29,593 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:29,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1005685385, now seen corresponding path program 1 times [2024-10-11 17:17:29,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:29,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713753152] [2024-10-11 17:17:29,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:29,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:17:29,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:29,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713753152] [2024-10-11 17:17:29,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713753152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:29,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:29,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:29,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103796887] [2024-10-11 17:17:29,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:29,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:29,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:29,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:29,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:29,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 267 [2024-10-11 17:17:29,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 216 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 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:17:29,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:29,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 267 [2024-10-11 17:17:29,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:29,928 INFO L124 PetriNetUnfolderBase]: 356/1390 cut-off events. [2024-10-11 17:17:29,929 INFO L125 PetriNetUnfolderBase]: For 478/482 co-relation queries the response was YES. [2024-10-11 17:17:29,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 1390 events. 356/1390 cut-off events. For 478/482 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 9230 event pairs, 152 based on Foata normal form. 0/1319 useless extension candidates. Maximal degree in co-relation 2441. Up to 391 conditions per place. [2024-10-11 17:17:29,940 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 24 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-10-11 17:17:29,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 630 flow [2024-10-11 17:17:29,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:29,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 708 transitions. [2024-10-11 17:17:29,943 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8838951310861424 [2024-10-11 17:17:29,943 INFO L175 Difference]: Start difference. First operand has 232 places, 216 transitions, 556 flow. Second operand 3 states and 708 transitions. [2024-10-11 17:17:29,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 630 flow [2024-10-11 17:17:29,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 222 transitions, 592 flow, removed 6 selfloop flow, removed 7 redundant places. [2024-10-11 17:17:29,948 INFO L231 Difference]: Finished difference. Result has 219 places, 215 transitions, 520 flow [2024-10-11 17:17:29,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=520, PETRI_PLACES=219, PETRI_TRANSITIONS=215} [2024-10-11 17:17:29,949 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, -23 predicate places. [2024-10-11 17:17:29,949 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 215 transitions, 520 flow [2024-10-11 17:17:29,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.66666666666666) internal successors, (692), 3 states have internal predecessors, (692), 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:17:29,950 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:29,950 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:17:29,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:17:29,951 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:29,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1866061374, now seen corresponding path program 1 times [2024-10-11 17:17:29,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:29,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633607258] [2024-10-11 17:17:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:29,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:30,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:17:30,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:30,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633607258] [2024-10-11 17:17:30,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633607258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:30,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:30,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 17:17:30,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074297788] [2024-10-11 17:17:30,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:30,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:17:30,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:30,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:17:30,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:17:31,807 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2024-10-11 17:17:31,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 215 transitions, 520 flow. Second operand has 15 states, 15 states have (on average 198.46666666666667) internal successors, (2977), 15 states have internal predecessors, (2977), 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:17:31,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:31,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2024-10-11 17:17:31,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:33,064 INFO L124 PetriNetUnfolderBase]: 975/3353 cut-off events. [2024-10-11 17:17:33,064 INFO L125 PetriNetUnfolderBase]: For 1066/1168 co-relation queries the response was YES. [2024-10-11 17:17:33,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6308 conditions, 3353 events. 975/3353 cut-off events. For 1066/1168 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 27959 event pairs, 221 based on Foata normal form. 52/3183 useless extension candidates. Maximal degree in co-relation 6297. Up to 583 conditions per place. [2024-10-11 17:17:33,099 INFO L140 encePairwiseOnDemand]: 241/267 looper letters, 81 selfloop transitions, 44 changer transitions 0/285 dead transitions. [2024-10-11 17:17:33,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 285 transitions, 1030 flow [2024-10-11 17:17:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 17:17:33,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-11 17:17:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4804 transitions. [2024-10-11 17:17:33,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7496878901373284 [2024-10-11 17:17:33,110 INFO L175 Difference]: Start difference. First operand has 219 places, 215 transitions, 520 flow. Second operand 24 states and 4804 transitions. [2024-10-11 17:17:33,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 285 transitions, 1030 flow [2024-10-11 17:17:33,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 285 transitions, 1026 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:33,118 INFO L231 Difference]: Finished difference. Result has 245 places, 240 transitions, 792 flow [2024-10-11 17:17:33,118 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=792, PETRI_PLACES=245, PETRI_TRANSITIONS=240} [2024-10-11 17:17:33,119 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 3 predicate places. [2024-10-11 17:17:33,119 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 240 transitions, 792 flow [2024-10-11 17:17:33,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 198.46666666666667) internal successors, (2977), 15 states have internal predecessors, (2977), 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:17:33,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:33,121 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:33,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:17:33,121 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:33,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:33,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1913155474, now seen corresponding path program 2 times [2024-10-11 17:17:33,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:33,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900351667] [2024-10-11 17:17:33,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:33,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:33,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-11 17:17:33,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:33,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900351667] [2024-10-11 17:17:33,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900351667] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:33,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:33,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 17:17:33,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039690817] [2024-10-11 17:17:33,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:33,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:17:33,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:33,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:17:33,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:17:34,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 267 [2024-10-11 17:17:34,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 240 transitions, 792 flow. Second operand has 15 states, 15 states have (on average 198.46666666666667) internal successors, (2977), 15 states have internal predecessors, (2977), 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:17:34,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:34,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 267 [2024-10-11 17:17:34,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:36,385 INFO L124 PetriNetUnfolderBase]: 1458/4674 cut-off events. [2024-10-11 17:17:36,385 INFO L125 PetriNetUnfolderBase]: For 5865/6167 co-relation queries the response was YES. [2024-10-11 17:17:36,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10890 conditions, 4674 events. 1458/4674 cut-off events. For 5865/6167 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 41797 event pairs, 389 based on Foata normal form. 170/4583 useless extension candidates. Maximal degree in co-relation 10874. Up to 1033 conditions per place. [2024-10-11 17:17:36,431 INFO L140 encePairwiseOnDemand]: 241/267 looper letters, 85 selfloop transitions, 65 changer transitions 0/310 dead transitions. [2024-10-11 17:17:36,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 310 transitions, 1488 flow [2024-10-11 17:17:36,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 17:17:36,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-10-11 17:17:36,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4804 transitions. [2024-10-11 17:17:36,442 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7496878901373284 [2024-10-11 17:17:36,442 INFO L175 Difference]: Start difference. First operand has 245 places, 240 transitions, 792 flow. Second operand 24 states and 4804 transitions. [2024-10-11 17:17:36,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 310 transitions, 1488 flow [2024-10-11 17:17:36,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 310 transitions, 1455 flow, removed 0 selfloop flow, removed 17 redundant places. [2024-10-11 17:17:36,456 INFO L231 Difference]: Finished difference. Result has 256 places, 272 transitions, 1224 flow [2024-10-11 17:17:36,456 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1224, PETRI_PLACES=256, PETRI_TRANSITIONS=272} [2024-10-11 17:17:36,457 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 14 predicate places. [2024-10-11 17:17:36,457 INFO L471 AbstractCegarLoop]: Abstraction has has 256 places, 272 transitions, 1224 flow [2024-10-11 17:17:36,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 198.46666666666667) internal successors, (2977), 15 states have internal predecessors, (2977), 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:17:36,459 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:36,459 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:36,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:17:36,459 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:36,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:36,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1407441473, now seen corresponding path program 1 times [2024-10-11 17:17:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:36,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717268261] [2024-10-11 17:17:36,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:36,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:17:36,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:36,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717268261] [2024-10-11 17:17:36,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717268261] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:17:36,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226084545] [2024-10-11 17:17:36,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:36,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:17:36,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:17:36,724 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:17:36,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:17:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:36,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 17:17:36,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:17:37,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:17:37,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:17:37,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:17:37,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226084545] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:17:37,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:17:37,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-10-11 17:17:37,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115898805] [2024-10-11 17:17:37,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:17:37,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 17:17:37,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:37,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 17:17:37,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-10-11 17:17:38,458 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 267 [2024-10-11 17:17:38,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 272 transitions, 1224 flow. Second operand has 24 states, 24 states have (on average 205.75) internal successors, (4938), 24 states have internal predecessors, (4938), 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:17:38,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:38,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 267 [2024-10-11 17:17:38,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:40,458 INFO L124 PetriNetUnfolderBase]: 2502/7426 cut-off events. [2024-10-11 17:17:40,458 INFO L125 PetriNetUnfolderBase]: For 11997/12868 co-relation queries the response was YES. [2024-10-11 17:17:40,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18804 conditions, 7426 events. 2502/7426 cut-off events. For 11997/12868 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 70468 event pairs, 1113 based on Foata normal form. 208/7199 useless extension candidates. Maximal degree in co-relation 18783. Up to 2249 conditions per place. [2024-10-11 17:17:40,558 INFO L140 encePairwiseOnDemand]: 236/267 looper letters, 117 selfloop transitions, 71 changer transitions 1/383 dead transitions. [2024-10-11 17:17:40,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 383 transitions, 2144 flow [2024-10-11 17:17:40,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 17:17:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-10-11 17:17:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4794 transitions. [2024-10-11 17:17:40,567 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7806546165119688 [2024-10-11 17:17:40,568 INFO L175 Difference]: Start difference. First operand has 256 places, 272 transitions, 1224 flow. Second operand 23 states and 4794 transitions. [2024-10-11 17:17:40,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 383 transitions, 2144 flow [2024-10-11 17:17:40,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 383 transitions, 2055 flow, removed 26 selfloop flow, removed 17 redundant places. [2024-10-11 17:17:40,606 INFO L231 Difference]: Finished difference. Result has 274 places, 319 transitions, 1668 flow [2024-10-11 17:17:40,606 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1668, PETRI_PLACES=274, PETRI_TRANSITIONS=319} [2024-10-11 17:17:40,607 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 32 predicate places. [2024-10-11 17:17:40,607 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 319 transitions, 1668 flow [2024-10-11 17:17:40,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 205.75) internal successors, (4938), 24 states have internal predecessors, (4938), 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:17:40,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:40,609 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:40,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 17:17:40,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 17:17:40,811 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:40,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash -863254300, now seen corresponding path program 1 times [2024-10-11 17:17:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:40,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166932111] [2024-10-11 17:17:40,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:40,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:17:41,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:41,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166932111] [2024-10-11 17:17:41,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166932111] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:17:41,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886142000] [2024-10-11 17:17:41,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:41,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:17:41,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:17:41,221 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:17:41,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:17:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:41,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 17:17:41,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:17:41,744 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:17:41,745 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:17:42,134 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:17:42,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886142000] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:17:42,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:17:42,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-10-11 17:17:42,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808480611] [2024-10-11 17:17:42,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:17:42,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-11 17:17:42,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:42,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-11 17:17:42,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-10-11 17:17:43,218 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 267 [2024-10-11 17:17:43,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 319 transitions, 1668 flow. Second operand has 24 states, 24 states have (on average 205.5) internal successors, (4932), 24 states have internal predecessors, (4932), 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:17:43,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:43,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 267 [2024-10-11 17:17:43,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:45,115 INFO L124 PetriNetUnfolderBase]: 2295/8330 cut-off events. [2024-10-11 17:17:45,115 INFO L125 PetriNetUnfolderBase]: For 14521/14707 co-relation queries the response was YES. [2024-10-11 17:17:45,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21209 conditions, 8330 events. 2295/8330 cut-off events. For 14521/14707 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 79861 event pairs, 805 based on Foata normal form. 89/7995 useless extension candidates. Maximal degree in co-relation 21175. Up to 1735 conditions per place. [2024-10-11 17:17:45,211 INFO L140 encePairwiseOnDemand]: 236/267 looper letters, 65 selfloop transitions, 33 changer transitions 119/411 dead transitions. [2024-10-11 17:17:45,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 411 transitions, 2576 flow [2024-10-11 17:17:45,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 17:17:45,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-10-11 17:17:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4806 transitions. [2024-10-11 17:17:45,220 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.782608695652174 [2024-10-11 17:17:45,220 INFO L175 Difference]: Start difference. First operand has 274 places, 319 transitions, 1668 flow. Second operand 23 states and 4806 transitions. [2024-10-11 17:17:45,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 411 transitions, 2576 flow [2024-10-11 17:17:45,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 411 transitions, 2550 flow, removed 10 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:45,300 INFO L231 Difference]: Finished difference. Result has 300 places, 280 transitions, 1405 flow [2024-10-11 17:17:45,300 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1405, PETRI_PLACES=300, PETRI_TRANSITIONS=280} [2024-10-11 17:17:45,301 INFO L277 CegarLoopForPetriNet]: 242 programPoint places, 58 predicate places. [2024-10-11 17:17:45,301 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 280 transitions, 1405 flow [2024-10-11 17:17:45,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 205.5) internal successors, (4932), 24 states have internal predecessors, (4932), 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:17:45,303 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:45,304 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:45,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:17:45,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 17:17:45,505 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 43 more)] === [2024-10-11 17:17:45,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:45,505 INFO L85 PathProgramCache]: Analyzing trace with hash 963910473, now seen corresponding path program 2 times [2024-10-11 17:17:45,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:45,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063402223] [2024-10-11 17:17:45,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:45,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:47,300 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 17:17:47,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:47,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063402223] [2024-10-11 17:17:47,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063402223] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:17:47,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83827140] [2024-10-11 17:17:47,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:17:47,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:17:47,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:17:47,304 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:17:47,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:17:47,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:17:47,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:17:47,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-10-11 17:17:47,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:17:47,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 17:17:48,079 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:17:48,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-11 17:17:48,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:17:48,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-11 17:17:48,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-11 17:17:49,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-10-11 17:17:49,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:17:49,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:17:49,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:17:49,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:17:49,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 91 [2024-10-11 17:17:49,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 60 [2024-10-11 17:17:53,372 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 17:17:53,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:17:53,410 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#race| c_~A~0.base (let ((.cse2 (* c_thread2Thread1of1ForFork2_~i~1 4))) (store (store (store (store (select |c_#race| c_~A~0.base) (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0)))) (.cse1 (* c_thread1Thread1of1ForFork1_~i~0 4))) (and (forall ((v_ArrVal_572 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_572) c_~A~0.base) (+ c_~A~0.offset .cse1)) 0)) (forall ((v_ArrVal_572 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_572) c_~A~0.base) (+ c_~A~0.offset .cse1 1)) 0)) (forall ((v_ArrVal_572 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_572) c_~A~0.base) (+ c_~A~0.offset 2 .cse1)) 0)) (forall ((v_ArrVal_572 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_572) c_~A~0.base) (+ c_~A~0.offset .cse1 3)) 0)))) is different from false [2024-10-11 17:17:54,121 INFO L349 Elim1Store]: treesize reduction 87, result has 54.2 percent of original size [2024-10-11 17:17:54,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 118 [2024-10-11 17:17:54,135 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-10-11 17:17:54,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 134 treesize of output 55 [2024-10-11 17:17:54,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2024-10-11 17:17:54,168 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-10-11 17:17:54,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 81 treesize of output 1 [2024-10-11 17:17:54,187 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-10-11 17:17:54,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2024-10-11 17:17:54,205 INFO L349 Elim1Store]: treesize reduction 189, result has 0.5 percent of original size [2024-10-11 17:17:54,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 82 treesize of output 1 [2024-10-11 17:18:14,419 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 3 times theorem prover too weak. 32 trivial. 1 not checked. [2024-10-11 17:18:14,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83827140] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:18:14,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:18:14,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 24] total 65 [2024-10-11 17:18:14,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292426294] [2024-10-11 17:18:14,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:18:14,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-10-11 17:18:14,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:18:14,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-10-11 17:18:14,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=3778, Unknown=17, NotChecked=126, Total=4290 [2024-10-11 17:18:14,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 267 [2024-10-11 17:18:14,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 280 transitions, 1405 flow. Second operand has 66 states, 66 states have (on average 129.4848484848485) internal successors, (8546), 66 states have internal predecessors, (8546), 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:18:14,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:18:14,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 267 [2024-10-11 17:18:14,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:18:16,218 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (* c_thread2Thread1of1ForFork2_~i~1 4))) (let ((.cse10 (select |c_#race| c_~A~0.base)) (.cse11 (+ c_~A~0.offset .cse17)) (.cse12 (+ c_~A~0.offset .cse17 1)) (.cse13 (+ c_~A~0.offset 2 .cse17)) (.cse14 (+ c_~A~0.offset 3 .cse17)) (.cse16 (* c_thread1Thread1of1ForFork1_~i~0 4))) (let ((.cse8 (+ c_~A~0.offset .cse16 3)) (.cse6 (+ c_~A~0.offset 2 .cse16)) (.cse7 (+ c_~A~0.offset .cse16 1)) (.cse15 (store |c_#race| c_~A~0.base (store (store (store (store .cse10 .cse11 0) .cse12 0) .cse13 0) .cse14 0))) (.cse9 (+ c_~A~0.offset .cse16))) (let ((.cse0 (forall ((v_ArrVal_572 (Array Int Int))) (= (select (select (store .cse15 c_~C~0.base v_ArrVal_572) c_~A~0.base) .cse9) 0))) (.cse1 (< c_~N~0 (+ c_thread2Thread1of1ForFork2_~i~1 1))) (.cse2 (forall ((v_ArrVal_572 (Array Int Int))) (= (select (select (store .cse15 c_~C~0.base v_ArrVal_572) c_~A~0.base) .cse7) 0))) (.cse3 (forall ((v_ArrVal_572 (Array Int Int))) (= (select (select (store .cse15 c_~C~0.base v_ArrVal_572) c_~A~0.base) .cse6) 0))) (.cse4 (forall ((v_ArrVal_572 (Array Int Int))) (= (select (select (store .cse15 c_~C~0.base v_ArrVal_572) c_~A~0.base) .cse8) 0)))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 1) .cse0 (= |c_ULTIMATE.start_create_fresh_uint_array_#res#1.offset| 0) (or .cse1 (and .cse0 .cse2 .cse3 .cse4)) (or .cse1 (let ((.cse5 (store |c_#race| c_~A~0.base (store (store (store (store (store .cse10 .cse8 0) .cse11 0) .cse12 0) .cse13 0) .cse14 0)))) (and (forall ((v_ArrVal_572 (Array Int Int))) (= (select (select (store .cse5 c_~C~0.base v_ArrVal_572) c_~A~0.base) .cse6) 0)) (forall ((v_ArrVal_572 (Array Int Int))) (= 0 (select (select (store .cse5 c_~C~0.base v_ArrVal_572) c_~A~0.base) .cse7))) (forall ((v_ArrVal_572 (Array Int Int))) (= (select (select (store .cse5 c_~C~0.base v_ArrVal_572) c_~A~0.base) .cse8) 0)) (forall ((v_ArrVal_572 (Array Int Int))) (= (select (select (store .cse5 c_~C~0.base v_ArrVal_572) c_~A~0.base) .cse9) 0))))) (not (= c_~C~0.base c_~A~0.base)) .cse2 (= c_~A~0.offset 0) .cse3 (= c_thread2Thread1of1ForFork2_~i~1 0) (= (select |c_#valid| c_~A~0.base) 1) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) .cse4))))) is different from false [2024-10-11 17:18:33,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]