./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41874b69ed787f1d4b0fd199a95bb437bfc8aab0f734c194621d2ef33cc65cc9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:40:02,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:40:02,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-12 12:40:02,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:40:02,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:40:02,932 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:40:02,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:40:02,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:40:02,933 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:40:02,934 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:40:02,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:40:02,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:40:02,934 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:40:02,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:40:02,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:40:02,936 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:40:02,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:40:02,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:40:02,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:40:02,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:40:02,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:40:02,940 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:40:02,940 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-12 12:40:02,941 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:40:02,941 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:40:02,941 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:40:02,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:40:02,941 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:40:02,941 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:40:02,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:40:02,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:40:02,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:40:02,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:40:02,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:40:02,942 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 12:40:02,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:40:02,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:40:02,943 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:40:02,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:40:02,943 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:40:02,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:40:02,944 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 41874b69ed787f1d4b0fd199a95bb437bfc8aab0f734c194621d2ef33cc65cc9 [2024-11-12 12:40:03,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:40:03,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:40:03,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:40:03,173 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:40:03,173 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:40:03,174 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2024-11-12 12:40:04,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:40:04,513 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:40:04,514 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2024-11-12 12:40:04,520 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81b772bc/c3576c3d367f475c98ea1d688fd69850/FLAG3dd8ec124 [2024-11-12 12:40:04,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a81b772bc/c3576c3d367f475c98ea1d688fd69850 [2024-11-12 12:40:04,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:40:04,534 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:40:04,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:40:04,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:40:04,544 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:40:04,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:40:04" (1/1) ... [2024-11-12 12:40:04,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@135b7e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:04, skipping insertion in model container [2024-11-12 12:40:04,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:40:04" (1/1) ... [2024-11-12 12:40:04,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:40:04,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:40:04,757 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:40:04,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:40:04,806 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:40:04,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:04 WrapperNode [2024-11-12 12:40:04,807 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:40:04,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:40:04,808 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:40:04,808 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:40:04,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:04" (1/1) ... [2024-11-12 12:40:04,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:04" (1/1) ... [2024-11-12 12:40:04,876 INFO L138 Inliner]: procedures = 25, calls = 54, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 466 [2024-11-12 12:40:04,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:40:04,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:40:04,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:40:04,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:40:04,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:04" (1/1) ... [2024-11-12 12:40:04,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:04" (1/1) ... [2024-11-12 12:40:04,895 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:04" (1/1) ... [2024-11-12 12:40:04,895 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:04" (1/1) ... [2024-11-12 12:40:04,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:04" (1/1) ... [2024-11-12 12:40:04,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:04" (1/1) ... [2024-11-12 12:40:04,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:04" (1/1) ... [2024-11-12 12:40:04,920 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:04" (1/1) ... [2024-11-12 12:40:04,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:40:04,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:40:04,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:40:04,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:40:04,924 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:04" (1/1) ... [2024-11-12 12:40:04,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:40:04,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:40:04,964 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:40:04,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:40:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:40:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 12:40:05,009 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 12:40:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 12:40:05,009 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 12:40:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-12 12:40:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-12 12:40:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-12 12:40:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-12 12:40:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-12 12:40:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-12 12:40:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 12:40:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 12:40:05,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:40:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:40:05,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:40:05,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-12 12:40:05,013 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 12:40:05,121 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:40:05,122 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:40:05,601 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 12:40:05,601 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:40:05,900 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:40:05,900 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-12 12:40:05,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:05 BoogieIcfgContainer [2024-11-12 12:40:05,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:40:05,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:40:05,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:40:05,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:40:05,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:40:04" (1/3) ... [2024-11-12 12:40:05,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22966825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:40:05, skipping insertion in model container [2024-11-12 12:40:05,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:40:04" (2/3) ... [2024-11-12 12:40:05,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22966825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:40:05, skipping insertion in model container [2024-11-12 12:40:05,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:05" (3/3) ... [2024-11-12 12:40:05,910 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2024-11-12 12:40:05,924 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:40:05,924 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 68 error locations. [2024-11-12 12:40:05,924 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 12:40:06,014 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-12 12:40:06,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 369 places, 374 transitions, 776 flow [2024-11-12 12:40:06,197 INFO L124 PetriNetUnfolderBase]: 18/370 cut-off events. [2024-11-12 12:40:06,197 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-12 12:40:06,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 370 events. 18/370 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 508 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 343. Up to 3 conditions per place. [2024-11-12 12:40:06,203 INFO L82 GeneralOperation]: Start removeDead. Operand has 369 places, 374 transitions, 776 flow [2024-11-12 12:40:06,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 349 places, 353 transitions, 730 flow [2024-11-12 12:40:06,215 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:40:06,221 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;@720d0176, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:40:06,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 121 error locations. [2024-11-12 12:40:06,228 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 12:40:06,228 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-11-12 12:40:06,228 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-12 12:40:06,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:06,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:06,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:06,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:06,235 INFO L85 PathProgramCache]: Analyzing trace with hash 556877122, now seen corresponding path program 1 times [2024-11-12 12:40:06,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:06,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140931659] [2024-11-12 12:40:06,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:06,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:06,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:06,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140931659] [2024-11-12 12:40:06,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140931659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:06,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:06,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:06,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581967884] [2024-11-12 12:40:06,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:06,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:06,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:06,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:06,536 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 374 [2024-11-12 12:40:06,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 353 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:06,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:06,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 374 [2024-11-12 12:40:06,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:06,965 INFO L124 PetriNetUnfolderBase]: 752/1727 cut-off events. [2024-11-12 12:40:06,966 INFO L125 PetriNetUnfolderBase]: For 256/256 co-relation queries the response was YES. [2024-11-12 12:40:06,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3048 conditions, 1727 events. 752/1727 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 9816 event pairs, 600 based on Foata normal form. 204/1779 useless extension candidates. Maximal degree in co-relation 2698. Up to 1053 conditions per place. [2024-11-12 12:40:06,980 INFO L140 encePairwiseOnDemand]: 312/374 looper letters, 26 selfloop transitions, 2 changer transitions 6/293 dead transitions. [2024-11-12 12:40:06,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 293 transitions, 666 flow [2024-11-12 12:40:06,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:06,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:06,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2024-11-12 12:40:06,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8351158645276292 [2024-11-12 12:40:06,998 INFO L175 Difference]: Start difference. First operand has 349 places, 353 transitions, 730 flow. Second operand 3 states and 937 transitions. [2024-11-12 12:40:06,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 293 transitions, 666 flow [2024-11-12 12:40:07,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 293 transitions, 650 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-12 12:40:07,008 INFO L231 Difference]: Finished difference. Result has 294 places, 287 transitions, 586 flow [2024-11-12 12:40:07,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=586, PETRI_PLACES=294, PETRI_TRANSITIONS=287} [2024-11-12 12:40:07,015 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -55 predicate places. [2024-11-12 12:40:07,016 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 287 transitions, 586 flow [2024-11-12 12:40:07,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:07,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:07,017 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:07,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 12:40:07,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:07,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash -217242735, now seen corresponding path program 1 times [2024-11-12 12:40:07,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:07,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039394592] [2024-11-12 12:40:07,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:07,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:07,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:07,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039394592] [2024-11-12 12:40:07,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039394592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:07,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:07,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:07,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290507331] [2024-11-12 12:40:07,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:07,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:07,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:07,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:07,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:07,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 374 [2024-11-12 12:40:07,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 287 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:07,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:07,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 374 [2024-11-12 12:40:07,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:07,477 INFO L124 PetriNetUnfolderBase]: 923/1998 cut-off events. [2024-11-12 12:40:07,477 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-12 12:40:07,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3423 conditions, 1998 events. 923/1998 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11720 event pairs, 743 based on Foata normal form. 0/1850 useless extension candidates. Maximal degree in co-relation 3385. Up to 1288 conditions per place. [2024-11-12 12:40:07,492 INFO L140 encePairwiseOnDemand]: 370/374 looper letters, 26 selfloop transitions, 1 changer transitions 0/284 dead transitions. [2024-11-12 12:40:07,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 284 transitions, 634 flow [2024-11-12 12:40:07,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:07,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:07,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 879 transitions. [2024-11-12 12:40:07,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7834224598930482 [2024-11-12 12:40:07,496 INFO L175 Difference]: Start difference. First operand has 294 places, 287 transitions, 586 flow. Second operand 3 states and 879 transitions. [2024-11-12 12:40:07,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 284 transitions, 634 flow [2024-11-12 12:40:07,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 284 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:07,503 INFO L231 Difference]: Finished difference. Result has 285 places, 284 transitions, 578 flow [2024-11-12 12:40:07,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=576, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=285, PETRI_TRANSITIONS=284} [2024-11-12 12:40:07,505 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -64 predicate places. [2024-11-12 12:40:07,505 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 284 transitions, 578 flow [2024-11-12 12:40:07,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:07,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:07,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:07,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 12:40:07,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:07,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:07,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2055433511, now seen corresponding path program 1 times [2024-11-12 12:40:07,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:07,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153794968] [2024-11-12 12:40:07,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:07,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:07,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:07,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:07,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153794968] [2024-11-12 12:40:07,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153794968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:07,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:07,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:07,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646258240] [2024-11-12 12:40:07,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:07,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:07,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:07,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:07,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:07,572 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 374 [2024-11-12 12:40:07,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 284 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:07,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:07,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 374 [2024-11-12 12:40:07,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:07,792 INFO L124 PetriNetUnfolderBase]: 565/1385 cut-off events. [2024-11-12 12:40:07,793 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-12 12:40:07,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 1385 events. 565/1385 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7545 event pairs, 457 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 2246. Up to 815 conditions per place. [2024-11-12 12:40:07,800 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 24 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2024-11-12 12:40:07,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 283 transitions, 628 flow [2024-11-12 12:40:07,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2024-11-12 12:40:07,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.786096256684492 [2024-11-12 12:40:07,802 INFO L175 Difference]: Start difference. First operand has 285 places, 284 transitions, 578 flow. Second operand 3 states and 882 transitions. [2024-11-12 12:40:07,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 283 transitions, 628 flow [2024-11-12 12:40:07,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 283 transitions, 627 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:07,806 INFO L231 Difference]: Finished difference. Result has 285 places, 283 transitions, 579 flow [2024-11-12 12:40:07,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=579, PETRI_PLACES=285, PETRI_TRANSITIONS=283} [2024-11-12 12:40:07,808 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -64 predicate places. [2024-11-12 12:40:07,808 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 283 transitions, 579 flow [2024-11-12 12:40:07,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:07,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:07,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:07,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 12:40:07,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:07,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:07,810 INFO L85 PathProgramCache]: Analyzing trace with hash 852732388, now seen corresponding path program 1 times [2024-11-12 12:40:07,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:07,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23377140] [2024-11-12 12:40:07,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:07,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:07,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:07,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:07,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23377140] [2024-11-12 12:40:07,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23377140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:07,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:07,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:07,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307878984] [2024-11-12 12:40:07,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:07,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:07,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:07,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:07,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:07,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 374 [2024-11-12 12:40:07,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 283 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:07,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:07,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 374 [2024-11-12 12:40:07,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:08,068 INFO L124 PetriNetUnfolderBase]: 565/1384 cut-off events. [2024-11-12 12:40:08,069 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-12 12:40:08,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2285 conditions, 1384 events. 565/1384 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7521 event pairs, 457 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 2247. Up to 815 conditions per place. [2024-11-12 12:40:08,076 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 24 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2024-11-12 12:40:08,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 282 transitions, 629 flow [2024-11-12 12:40:08,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2024-11-12 12:40:08,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.786096256684492 [2024-11-12 12:40:08,079 INFO L175 Difference]: Start difference. First operand has 285 places, 283 transitions, 579 flow. Second operand 3 states and 882 transitions. [2024-11-12 12:40:08,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 282 transitions, 629 flow [2024-11-12 12:40:08,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 282 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:08,082 INFO L231 Difference]: Finished difference. Result has 284 places, 282 transitions, 577 flow [2024-11-12 12:40:08,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=284, PETRI_TRANSITIONS=282} [2024-11-12 12:40:08,084 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -65 predicate places. [2024-11-12 12:40:08,084 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 282 transitions, 577 flow [2024-11-12 12:40:08,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:08,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:08,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:08,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 12:40:08,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:08,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:08,087 INFO L85 PathProgramCache]: Analyzing trace with hash -724619586, now seen corresponding path program 1 times [2024-11-12 12:40:08,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:08,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148109450] [2024-11-12 12:40:08,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:08,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:08,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:08,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148109450] [2024-11-12 12:40:08,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148109450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:08,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:08,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:08,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054736854] [2024-11-12 12:40:08,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:08,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:08,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:08,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:08,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:08,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 374 [2024-11-12 12:40:08,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 282 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:08,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:08,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 374 [2024-11-12 12:40:08,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:08,326 INFO L124 PetriNetUnfolderBase]: 565/1383 cut-off events. [2024-11-12 12:40:08,326 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-12 12:40:08,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 1383 events. 565/1383 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7521 event pairs, 457 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 2246. Up to 815 conditions per place. [2024-11-12 12:40:08,333 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 24 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2024-11-12 12:40:08,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 281 transitions, 627 flow [2024-11-12 12:40:08,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:08,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2024-11-12 12:40:08,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.786096256684492 [2024-11-12 12:40:08,335 INFO L175 Difference]: Start difference. First operand has 284 places, 282 transitions, 577 flow. Second operand 3 states and 882 transitions. [2024-11-12 12:40:08,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 281 transitions, 627 flow [2024-11-12 12:40:08,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 281 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:08,338 INFO L231 Difference]: Finished difference. Result has 283 places, 281 transitions, 575 flow [2024-11-12 12:40:08,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=283, PETRI_TRANSITIONS=281} [2024-11-12 12:40:08,339 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -66 predicate places. [2024-11-12 12:40:08,340 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 281 transitions, 575 flow [2024-11-12 12:40:08,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:08,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:08,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:08,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 12:40:08,341 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:08,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:08,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1794571893, now seen corresponding path program 1 times [2024-11-12 12:40:08,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:08,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007051417] [2024-11-12 12:40:08,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:08,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:08,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:08,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007051417] [2024-11-12 12:40:08,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007051417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:08,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:08,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:08,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604657950] [2024-11-12 12:40:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:08,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:08,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:08,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:08,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:08,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 374 [2024-11-12 12:40:08,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 281 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:08,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:08,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 374 [2024-11-12 12:40:08,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:08,574 INFO L124 PetriNetUnfolderBase]: 565/1382 cut-off events. [2024-11-12 12:40:08,575 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-12 12:40:08,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2283 conditions, 1382 events. 565/1382 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7586 event pairs, 457 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 2245. Up to 815 conditions per place. [2024-11-12 12:40:08,583 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 24 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2024-11-12 12:40:08,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 280 transitions, 625 flow [2024-11-12 12:40:08,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:08,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:08,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2024-11-12 12:40:08,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.786096256684492 [2024-11-12 12:40:08,585 INFO L175 Difference]: Start difference. First operand has 283 places, 281 transitions, 575 flow. Second operand 3 states and 882 transitions. [2024-11-12 12:40:08,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 280 transitions, 625 flow [2024-11-12 12:40:08,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 280 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:08,589 INFO L231 Difference]: Finished difference. Result has 282 places, 280 transitions, 573 flow [2024-11-12 12:40:08,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=282, PETRI_TRANSITIONS=280} [2024-11-12 12:40:08,592 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2024-11-12 12:40:08,592 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 280 transitions, 573 flow [2024-11-12 12:40:08,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:08,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:08,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:08,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 12:40:08,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:08,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:08,594 INFO L85 PathProgramCache]: Analyzing trace with hash 75497449, now seen corresponding path program 1 times [2024-11-12 12:40:08,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:08,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583930739] [2024-11-12 12:40:08,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:08,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:08,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:08,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:08,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583930739] [2024-11-12 12:40:08,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583930739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:08,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:08,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:08,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672708858] [2024-11-12 12:40:08,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:08,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:08,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:08,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:08,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:08,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 374 [2024-11-12 12:40:08,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 280 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:08,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:08,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 374 [2024-11-12 12:40:08,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:08,908 INFO L124 PetriNetUnfolderBase]: 687/1785 cut-off events. [2024-11-12 12:40:08,909 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-11-12 12:40:08,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2878 conditions, 1785 events. 687/1785 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 11118 event pairs, 418 based on Foata normal form. 0/1635 useless extension candidates. Maximal degree in co-relation 2841. Up to 697 conditions per place. [2024-11-12 12:40:08,920 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 35 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-11-12 12:40:08,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 293 transitions, 679 flow [2024-11-12 12:40:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:08,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2024-11-12 12:40:08,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8065953654188949 [2024-11-12 12:40:08,922 INFO L175 Difference]: Start difference. First operand has 282 places, 280 transitions, 573 flow. Second operand 3 states and 905 transitions. [2024-11-12 12:40:08,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 293 transitions, 679 flow [2024-11-12 12:40:08,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 293 transitions, 675 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:08,928 INFO L231 Difference]: Finished difference. Result has 282 places, 280 transitions, 577 flow [2024-11-12 12:40:08,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=282, PETRI_TRANSITIONS=280} [2024-11-12 12:40:08,929 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2024-11-12 12:40:08,929 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 280 transitions, 577 flow [2024-11-12 12:40:08,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:08,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:08,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:08,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 12:40:08,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:08,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:08,931 INFO L85 PathProgramCache]: Analyzing trace with hash -979615985, now seen corresponding path program 1 times [2024-11-12 12:40:08,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:08,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421174709] [2024-11-12 12:40:08,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:08,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:08,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:08,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421174709] [2024-11-12 12:40:08,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421174709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:08,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:08,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:08,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720519005] [2024-11-12 12:40:08,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:08,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:08,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:08,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:08,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:08,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 374 [2024-11-12 12:40:08,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 280 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:08,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:08,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 374 [2024-11-12 12:40:08,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:09,167 INFO L124 PetriNetUnfolderBase]: 687/1688 cut-off events. [2024-11-12 12:40:09,168 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2024-11-12 12:40:09,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2924 conditions, 1688 events. 687/1688 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10141 event pairs, 566 based on Foata normal form. 0/1571 useless extension candidates. Maximal degree in co-relation 2885. Up to 994 conditions per place. [2024-11-12 12:40:09,174 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 24 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2024-11-12 12:40:09,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 279 transitions, 627 flow [2024-11-12 12:40:09,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:09,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2024-11-12 12:40:09,176 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2024-11-12 12:40:09,176 INFO L175 Difference]: Start difference. First operand has 282 places, 280 transitions, 577 flow. Second operand 3 states and 884 transitions. [2024-11-12 12:40:09,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 279 transitions, 627 flow [2024-11-12 12:40:09,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 279 transitions, 625 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:09,179 INFO L231 Difference]: Finished difference. Result has 282 places, 279 transitions, 577 flow [2024-11-12 12:40:09,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=282, PETRI_TRANSITIONS=279} [2024-11-12 12:40:09,180 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2024-11-12 12:40:09,180 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 279 transitions, 577 flow [2024-11-12 12:40:09,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:09,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:09,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:09,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 12:40:09,181 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:09,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:09,182 INFO L85 PathProgramCache]: Analyzing trace with hash 564200169, now seen corresponding path program 1 times [2024-11-12 12:40:09,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:09,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014161565] [2024-11-12 12:40:09,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:09,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:09,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:09,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014161565] [2024-11-12 12:40:09,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014161565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:09,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:09,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:09,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127927092] [2024-11-12 12:40:09,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:09,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:09,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:09,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:09,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:09,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 374 [2024-11-12 12:40:09,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 279 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:09,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:09,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 374 [2024-11-12 12:40:09,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:09,474 INFO L124 PetriNetUnfolderBase]: 851/2155 cut-off events. [2024-11-12 12:40:09,475 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2024-11-12 12:40:09,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3624 conditions, 2155 events. 851/2155 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14496 event pairs, 264 based on Foata normal form. 0/1975 useless extension candidates. Maximal degree in co-relation 3586. Up to 776 conditions per place. [2024-11-12 12:40:09,487 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 37 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2024-11-12 12:40:09,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 293 transitions, 692 flow [2024-11-12 12:40:09,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:09,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:09,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 905 transitions. [2024-11-12 12:40:09,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8065953654188949 [2024-11-12 12:40:09,491 INFO L175 Difference]: Start difference. First operand has 282 places, 279 transitions, 577 flow. Second operand 3 states and 905 transitions. [2024-11-12 12:40:09,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 293 transitions, 692 flow [2024-11-12 12:40:09,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 293 transitions, 688 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:09,495 INFO L231 Difference]: Finished difference. Result has 282 places, 279 transitions, 581 flow [2024-11-12 12:40:09,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=282, PETRI_TRANSITIONS=279} [2024-11-12 12:40:09,497 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2024-11-12 12:40:09,497 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 279 transitions, 581 flow [2024-11-12 12:40:09,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:09,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:09,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:09,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 12:40:09,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:09,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1803662583, now seen corresponding path program 1 times [2024-11-12 12:40:09,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:09,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908006827] [2024-11-12 12:40:09,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:09,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:09,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:09,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908006827] [2024-11-12 12:40:09,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908006827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:09,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:09,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:09,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918918326] [2024-11-12 12:40:09,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:09,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:09,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:09,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:09,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:09,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 374 [2024-11-12 12:40:09,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 279 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:09,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:09,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 374 [2024-11-12 12:40:09,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:09,790 INFO L124 PetriNetUnfolderBase]: 851/2198 cut-off events. [2024-11-12 12:40:09,791 INFO L125 PetriNetUnfolderBase]: For 349/349 co-relation queries the response was YES. [2024-11-12 12:40:09,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3879 conditions, 2198 events. 851/2198 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15154 event pairs, 719 based on Foata normal form. 0/2019 useless extension candidates. Maximal degree in co-relation 3839. Up to 1234 conditions per place. [2024-11-12 12:40:09,803 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 25 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2024-11-12 12:40:09,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 278 transitions, 633 flow [2024-11-12 12:40:09,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:09,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2024-11-12 12:40:09,805 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2024-11-12 12:40:09,805 INFO L175 Difference]: Start difference. First operand has 282 places, 279 transitions, 581 flow. Second operand 3 states and 884 transitions. [2024-11-12 12:40:09,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 278 transitions, 633 flow [2024-11-12 12:40:09,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 278 transitions, 631 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:09,808 INFO L231 Difference]: Finished difference. Result has 282 places, 278 transitions, 581 flow [2024-11-12 12:40:09,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=282, PETRI_TRANSITIONS=278} [2024-11-12 12:40:09,809 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2024-11-12 12:40:09,809 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 278 transitions, 581 flow [2024-11-12 12:40:09,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:09,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:09,810 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:09,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 12:40:09,810 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:09,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash -439095779, now seen corresponding path program 1 times [2024-11-12 12:40:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:09,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878648668] [2024-11-12 12:40:09,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:09,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:09,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:09,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:09,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878648668] [2024-11-12 12:40:09,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878648668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:09,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:09,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:09,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161427513] [2024-11-12 12:40:09,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:09,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:09,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:09,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:09,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:09,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 285 out of 374 [2024-11-12 12:40:09,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 278 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:09,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:09,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 285 of 374 [2024-11-12 12:40:09,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:10,087 INFO L124 PetriNetUnfolderBase]: 851/2197 cut-off events. [2024-11-12 12:40:10,087 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-11-12 12:40:10,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3814 conditions, 2197 events. 851/2197 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15086 event pairs, 719 based on Foata normal form. 0/2019 useless extension candidates. Maximal degree in co-relation 3774. Up to 1238 conditions per place. [2024-11-12 12:40:10,097 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 26 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2024-11-12 12:40:10,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 277 transitions, 635 flow [2024-11-12 12:40:10,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 882 transitions. [2024-11-12 12:40:10,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.786096256684492 [2024-11-12 12:40:10,099 INFO L175 Difference]: Start difference. First operand has 282 places, 278 transitions, 581 flow. Second operand 3 states and 882 transitions. [2024-11-12 12:40:10,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 277 transitions, 635 flow [2024-11-12 12:40:10,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 277 transitions, 631 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:10,103 INFO L231 Difference]: Finished difference. Result has 281 places, 277 transitions, 579 flow [2024-11-12 12:40:10,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=579, PETRI_PLACES=281, PETRI_TRANSITIONS=277} [2024-11-12 12:40:10,103 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -68 predicate places. [2024-11-12 12:40:10,103 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 277 transitions, 579 flow [2024-11-12 12:40:10,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 286.3333333333333) internal successors, (859), 3 states have internal predecessors, (859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:10,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:10,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:10,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 12:40:10,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:10,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:10,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1369483931, now seen corresponding path program 1 times [2024-11-12 12:40:10,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:10,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97093834] [2024-11-12 12:40:10,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:10,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:10,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:10,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:10,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97093834] [2024-11-12 12:40:10,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97093834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:10,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:10,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:10,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144898452] [2024-11-12 12:40:10,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:10,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:10,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:10,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:10,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:10,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 374 [2024-11-12 12:40:10,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 277 transitions, 579 flow. Second operand has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:10,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:10,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 374 [2024-11-12 12:40:10,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:10,370 INFO L124 PetriNetUnfolderBase]: 851/2196 cut-off events. [2024-11-12 12:40:10,370 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-11-12 12:40:10,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3807 conditions, 2196 events. 851/2196 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15149 event pairs, 719 based on Foata normal form. 0/2019 useless extension candidates. Maximal degree in co-relation 3768. Up to 1232 conditions per place. [2024-11-12 12:40:10,384 INFO L140 encePairwiseOnDemand]: 372/374 looper letters, 24 selfloop transitions, 1 changer transitions 0/276 dead transitions. [2024-11-12 12:40:10,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 276 transitions, 627 flow [2024-11-12 12:40:10,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2024-11-12 12:40:10,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7941176470588235 [2024-11-12 12:40:10,387 INFO L175 Difference]: Start difference. First operand has 281 places, 277 transitions, 579 flow. Second operand 3 states and 891 transitions. [2024-11-12 12:40:10,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 276 transitions, 627 flow [2024-11-12 12:40:10,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 276 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:10,391 INFO L231 Difference]: Finished difference. Result has 280 places, 276 transitions, 575 flow [2024-11-12 12:40:10,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=280, PETRI_TRANSITIONS=276} [2024-11-12 12:40:10,392 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -69 predicate places. [2024-11-12 12:40:10,393 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 276 transitions, 575 flow [2024-11-12 12:40:10,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:10,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:10,394 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:10,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 12:40:10,394 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:10,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:10,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1236666305, now seen corresponding path program 1 times [2024-11-12 12:40:10,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:10,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629300128] [2024-11-12 12:40:10,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:10,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:10,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:10,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629300128] [2024-11-12 12:40:10,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629300128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:10,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:10,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:40:10,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388250692] [2024-11-12 12:40:10,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:10,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:40:10,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:10,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:40:10,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:40:10,958 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 374 [2024-11-12 12:40:10,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 276 transitions, 575 flow. Second operand has 6 states, 6 states have (on average 266.5) internal successors, (1599), 6 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:10,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:10,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 374 [2024-11-12 12:40:10,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:11,344 INFO L124 PetriNetUnfolderBase]: 851/2194 cut-off events. [2024-11-12 12:40:11,344 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-11-12 12:40:11,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3827 conditions, 2194 events. 851/2194 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15116 event pairs, 719 based on Foata normal form. 0/2019 useless extension candidates. Maximal degree in co-relation 3788. Up to 1247 conditions per place. [2024-11-12 12:40:11,361 INFO L140 encePairwiseOnDemand]: 362/374 looper letters, 38 selfloop transitions, 10 changer transitions 0/274 dead transitions. [2024-11-12 12:40:11,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 274 transitions, 667 flow [2024-11-12 12:40:11,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:40:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 12:40:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1638 transitions. [2024-11-12 12:40:11,365 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7299465240641712 [2024-11-12 12:40:11,365 INFO L175 Difference]: Start difference. First operand has 280 places, 276 transitions, 575 flow. Second operand 6 states and 1638 transitions. [2024-11-12 12:40:11,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 274 transitions, 667 flow [2024-11-12 12:40:11,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 274 transitions, 666 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:11,370 INFO L231 Difference]: Finished difference. Result has 282 places, 274 transitions, 590 flow [2024-11-12 12:40:11,370 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=570, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=590, PETRI_PLACES=282, PETRI_TRANSITIONS=274} [2024-11-12 12:40:11,371 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -67 predicate places. [2024-11-12 12:40:11,371 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 274 transitions, 590 flow [2024-11-12 12:40:11,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 266.5) internal successors, (1599), 6 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:11,372 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:11,372 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:11,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 12:40:11,373 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:11,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:11,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1123432265, now seen corresponding path program 1 times [2024-11-12 12:40:11,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:11,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328985973] [2024-11-12 12:40:11,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:11,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:11,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:11,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:11,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328985973] [2024-11-12 12:40:11,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328985973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:11,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:11,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:11,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741294505] [2024-11-12 12:40:11,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:11,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:11,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:11,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:11,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:11,426 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 374 [2024-11-12 12:40:11,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 274 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:11,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:11,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 374 [2024-11-12 12:40:11,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:11,656 INFO L124 PetriNetUnfolderBase]: 851/2193 cut-off events. [2024-11-12 12:40:11,656 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-11-12 12:40:11,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3815 conditions, 2193 events. 851/2193 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15119 event pairs, 719 based on Foata normal form. 0/2019 useless extension candidates. Maximal degree in co-relation 3780. Up to 1234 conditions per place. [2024-11-12 12:40:11,669 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 25 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2024-11-12 12:40:11,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 273 transitions, 642 flow [2024-11-12 12:40:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:11,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:11,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2024-11-12 12:40:11,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2024-11-12 12:40:11,672 INFO L175 Difference]: Start difference. First operand has 282 places, 274 transitions, 590 flow. Second operand 3 states and 884 transitions. [2024-11-12 12:40:11,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 273 transitions, 642 flow [2024-11-12 12:40:11,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 273 transitions, 622 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-12 12:40:11,711 INFO L231 Difference]: Finished difference. Result has 278 places, 273 transitions, 572 flow [2024-11-12 12:40:11,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=278, PETRI_TRANSITIONS=273} [2024-11-12 12:40:11,712 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -71 predicate places. [2024-11-12 12:40:11,712 INFO L471 AbstractCegarLoop]: Abstraction has has 278 places, 273 transitions, 572 flow [2024-11-12 12:40:11,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:11,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:11,713 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:11,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 12:40:11,714 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:11,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:11,714 INFO L85 PathProgramCache]: Analyzing trace with hash 526609753, now seen corresponding path program 1 times [2024-11-12 12:40:11,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:11,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761236435] [2024-11-12 12:40:11,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:11,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:11,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:11,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:11,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761236435] [2024-11-12 12:40:11,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761236435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:11,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:11,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:11,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052813102] [2024-11-12 12:40:11,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:11,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:11,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:11,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:11,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:11,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 374 [2024-11-12 12:40:11,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 273 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:11,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:11,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 374 [2024-11-12 12:40:11,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:11,974 INFO L124 PetriNetUnfolderBase]: 851/2192 cut-off events. [2024-11-12 12:40:11,974 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-11-12 12:40:11,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3804 conditions, 2192 events. 851/2192 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15090 event pairs, 719 based on Foata normal form. 0/2019 useless extension candidates. Maximal degree in co-relation 3765. Up to 1232 conditions per place. [2024-11-12 12:40:11,993 INFO L140 encePairwiseOnDemand]: 372/374 looper letters, 24 selfloop transitions, 1 changer transitions 0/272 dead transitions. [2024-11-12 12:40:11,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 272 transitions, 620 flow [2024-11-12 12:40:11,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2024-11-12 12:40:11,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7941176470588235 [2024-11-12 12:40:11,995 INFO L175 Difference]: Start difference. First operand has 278 places, 273 transitions, 572 flow. Second operand 3 states and 891 transitions. [2024-11-12 12:40:11,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 272 transitions, 620 flow [2024-11-12 12:40:11,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 272 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:12,000 INFO L231 Difference]: Finished difference. Result has 277 places, 272 transitions, 568 flow [2024-11-12 12:40:12,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=277, PETRI_TRANSITIONS=272} [2024-11-12 12:40:12,001 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -72 predicate places. [2024-11-12 12:40:12,001 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 272 transitions, 568 flow [2024-11-12 12:40:12,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:12,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:12,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:12,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 12:40:12,003 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:12,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:12,003 INFO L85 PathProgramCache]: Analyzing trace with hash -803893374, now seen corresponding path program 1 times [2024-11-12 12:40:12,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:12,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652229223] [2024-11-12 12:40:12,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:12,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:12,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:12,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652229223] [2024-11-12 12:40:12,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652229223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:12,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:12,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:12,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146507171] [2024-11-12 12:40:12,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:12,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:12,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:12,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:12,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:12,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 374 [2024-11-12 12:40:12,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 272 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:12,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:12,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 374 [2024-11-12 12:40:12,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:12,278 INFO L124 PetriNetUnfolderBase]: 851/2191 cut-off events. [2024-11-12 12:40:12,278 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-11-12 12:40:12,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3804 conditions, 2191 events. 851/2191 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 15086 event pairs, 719 based on Foata normal form. 0/2019 useless extension candidates. Maximal degree in co-relation 3764. Up to 1234 conditions per place. [2024-11-12 12:40:12,292 INFO L140 encePairwiseOnDemand]: 371/374 looper letters, 25 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2024-11-12 12:40:12,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 271 transitions, 620 flow [2024-11-12 12:40:12,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 884 transitions. [2024-11-12 12:40:12,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2024-11-12 12:40:12,294 INFO L175 Difference]: Start difference. First operand has 277 places, 272 transitions, 568 flow. Second operand 3 states and 884 transitions. [2024-11-12 12:40:12,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 271 transitions, 620 flow [2024-11-12 12:40:12,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 271 transitions, 619 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 12:40:12,297 INFO L231 Difference]: Finished difference. Result has 277 places, 271 transitions, 569 flow [2024-11-12 12:40:12,298 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=569, PETRI_PLACES=277, PETRI_TRANSITIONS=271} [2024-11-12 12:40:12,298 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -72 predicate places. [2024-11-12 12:40:12,298 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 271 transitions, 569 flow [2024-11-12 12:40:12,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:12,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 12:40:12,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:12,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 12:40:12,299 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 117 more)] === [2024-11-12 12:40:12,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:40:12,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1294401737, now seen corresponding path program 1 times [2024-11-12 12:40:12,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 12:40:12,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969785549] [2024-11-12 12:40:12,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:40:12,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 12:40:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:40:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:40:12,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 12:40:12,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969785549] [2024-11-12 12:40:12,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969785549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:40:12,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:40:12,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 12:40:12,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963594070] [2024-11-12 12:40:12,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:40:12,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 12:40:12,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 12:40:12,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 12:40:12,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 12:40:12,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 289 out of 374 [2024-11-12 12:40:12,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 271 transitions, 569 flow. Second operand has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:12,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 12:40:12,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 289 of 374 [2024-11-12 12:40:12,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 12:40:12,671 INFO L124 PetriNetUnfolderBase]: 1357/2994 cut-off events. [2024-11-12 12:40:12,671 INFO L125 PetriNetUnfolderBase]: For 613/614 co-relation queries the response was YES. [2024-11-12 12:40:12,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5343 conditions, 2994 events. 1357/2994 cut-off events. For 613/614 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 20288 event pairs, 460 based on Foata normal form. 4/2783 useless extension candidates. Maximal degree in co-relation 5304. Up to 1440 conditions per place. [2024-11-12 12:40:12,683 INFO L140 encePairwiseOnDemand]: 366/374 looper letters, 0 selfloop transitions, 0 changer transitions 292/292 dead transitions. [2024-11-12 12:40:12,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 292 transitions, 718 flow [2024-11-12 12:40:12,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 12:40:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 12:40:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2024-11-12 12:40:12,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8110516934046346 [2024-11-12 12:40:12,685 INFO L175 Difference]: Start difference. First operand has 277 places, 271 transitions, 569 flow. Second operand 3 states and 910 transitions. [2024-11-12 12:40:12,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 292 transitions, 718 flow [2024-11-12 12:40:12,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 292 transitions, 714 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-12 12:40:12,688 INFO L231 Difference]: Finished difference. Result has 276 places, 0 transitions, 0 flow [2024-11-12 12:40:12,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=374, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=276, PETRI_TRANSITIONS=0} [2024-11-12 12:40:12,688 INFO L279 CegarLoopForPetriNet]: 349 programPoint places, -73 predicate places. [2024-11-12 12:40:12,689 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 0 transitions, 0 flow [2024-11-12 12:40:12,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.6666666666667) internal successors, (881), 3 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:40:12,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (120 of 121 remaining) [2024-11-12 12:40:12,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (119 of 121 remaining) [2024-11-12 12:40:12,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (118 of 121 remaining) [2024-11-12 12:40:12,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (117 of 121 remaining) [2024-11-12 12:40:12,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (116 of 121 remaining) [2024-11-12 12:40:12,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (115 of 121 remaining) [2024-11-12 12:40:12,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (114 of 121 remaining) [2024-11-12 12:40:12,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (113 of 121 remaining) [2024-11-12 12:40:12,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (112 of 121 remaining) [2024-11-12 12:40:12,692 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (111 of 121 remaining) [2024-11-12 12:40:12,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (110 of 121 remaining) [2024-11-12 12:40:12,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (109 of 121 remaining) [2024-11-12 12:40:12,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (108 of 121 remaining) [2024-11-12 12:40:12,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (107 of 121 remaining) [2024-11-12 12:40:12,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (106 of 121 remaining) [2024-11-12 12:40:12,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (105 of 121 remaining) [2024-11-12 12:40:12,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (104 of 121 remaining) [2024-11-12 12:40:12,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (103 of 121 remaining) [2024-11-12 12:40:12,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (102 of 121 remaining) [2024-11-12 12:40:12,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (101 of 121 remaining) [2024-11-12 12:40:12,693 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (100 of 121 remaining) [2024-11-12 12:40:12,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (99 of 121 remaining) [2024-11-12 12:40:12,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (98 of 121 remaining) [2024-11-12 12:40:12,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (97 of 121 remaining) [2024-11-12 12:40:12,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (96 of 121 remaining) [2024-11-12 12:40:12,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (95 of 121 remaining) [2024-11-12 12:40:12,694 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (94 of 121 remaining) [2024-11-12 12:40:12,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (93 of 121 remaining) [2024-11-12 12:40:12,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (92 of 121 remaining) [2024-11-12 12:40:12,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (91 of 121 remaining) [2024-11-12 12:40:12,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (90 of 121 remaining) [2024-11-12 12:40:12,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (89 of 121 remaining) [2024-11-12 12:40:12,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (88 of 121 remaining) [2024-11-12 12:40:12,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (87 of 121 remaining) [2024-11-12 12:40:12,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (86 of 121 remaining) [2024-11-12 12:40:12,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (85 of 121 remaining) [2024-11-12 12:40:12,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (84 of 121 remaining) [2024-11-12 12:40:12,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (83 of 121 remaining) [2024-11-12 12:40:12,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (82 of 121 remaining) [2024-11-12 12:40:12,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (81 of 121 remaining) [2024-11-12 12:40:12,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (80 of 121 remaining) [2024-11-12 12:40:12,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (79 of 121 remaining) [2024-11-12 12:40:12,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (78 of 121 remaining) [2024-11-12 12:40:12,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (77 of 121 remaining) [2024-11-12 12:40:12,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (76 of 121 remaining) [2024-11-12 12:40:12,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (75 of 121 remaining) [2024-11-12 12:40:12,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (74 of 121 remaining) [2024-11-12 12:40:12,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (73 of 121 remaining) [2024-11-12 12:40:12,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (72 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (71 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (70 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (69 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (68 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (67 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (66 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (65 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (64 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (63 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (62 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (61 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (60 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (59 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (58 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (57 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (56 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 121 remaining) [2024-11-12 12:40:12,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (53 of 121 remaining) [2024-11-12 12:40:12,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (52 of 121 remaining) [2024-11-12 12:40:12,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (51 of 121 remaining) [2024-11-12 12:40:12,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (50 of 121 remaining) [2024-11-12 12:40:12,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (49 of 121 remaining) [2024-11-12 12:40:12,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (48 of 121 remaining) [2024-11-12 12:40:12,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (47 of 121 remaining) [2024-11-12 12:40:12,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 121 remaining) [2024-11-12 12:40:12,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 121 remaining) [2024-11-12 12:40:12,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (44 of 121 remaining) [2024-11-12 12:40:12,698 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 121 remaining) [2024-11-12 12:40:12,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (42 of 121 remaining) [2024-11-12 12:40:12,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (41 of 121 remaining) [2024-11-12 12:40:12,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (40 of 121 remaining) [2024-11-12 12:40:12,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (39 of 121 remaining) [2024-11-12 12:40:12,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (38 of 121 remaining) [2024-11-12 12:40:12,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 121 remaining) [2024-11-12 12:40:12,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (36 of 121 remaining) [2024-11-12 12:40:12,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (35 of 121 remaining) [2024-11-12 12:40:12,699 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (34 of 121 remaining) [2024-11-12 12:40:12,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (33 of 121 remaining) [2024-11-12 12:40:12,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 121 remaining) [2024-11-12 12:40:12,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (31 of 121 remaining) [2024-11-12 12:40:12,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (30 of 121 remaining) [2024-11-12 12:40:12,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (29 of 121 remaining) [2024-11-12 12:40:12,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (28 of 121 remaining) [2024-11-12 12:40:12,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (27 of 121 remaining) [2024-11-12 12:40:12,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (26 of 121 remaining) [2024-11-12 12:40:12,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (25 of 121 remaining) [2024-11-12 12:40:12,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (24 of 121 remaining) [2024-11-12 12:40:12,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (23 of 121 remaining) [2024-11-12 12:40:12,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (22 of 121 remaining) [2024-11-12 12:40:12,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (21 of 121 remaining) [2024-11-12 12:40:12,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (20 of 121 remaining) [2024-11-12 12:40:12,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (19 of 121 remaining) [2024-11-12 12:40:12,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (18 of 121 remaining) [2024-11-12 12:40:12,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (17 of 121 remaining) [2024-11-12 12:40:12,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (16 of 121 remaining) [2024-11-12 12:40:12,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (15 of 121 remaining) [2024-11-12 12:40:12,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (14 of 121 remaining) [2024-11-12 12:40:12,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (13 of 121 remaining) [2024-11-12 12:40:12,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (12 of 121 remaining) [2024-11-12 12:40:12,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (11 of 121 remaining) [2024-11-12 12:40:12,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (10 of 121 remaining) [2024-11-12 12:40:12,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (9 of 121 remaining) [2024-11-12 12:40:12,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 121 remaining) [2024-11-12 12:40:12,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (7 of 121 remaining) [2024-11-12 12:40:12,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (6 of 121 remaining) [2024-11-12 12:40:12,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (5 of 121 remaining) [2024-11-12 12:40:12,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (4 of 121 remaining) [2024-11-12 12:40:12,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (3 of 121 remaining) [2024-11-12 12:40:12,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (2 of 121 remaining) [2024-11-12 12:40:12,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 121 remaining) [2024-11-12 12:40:12,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (0 of 121 remaining) [2024-11-12 12:40:12,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 12:40:12,703 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:40:12,709 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-12 12:40:12,709 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 12:40:12,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 12:40:12 BasicIcfg [2024-11-12 12:40:12,715 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 12:40:12,716 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 12:40:12,716 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 12:40:12,716 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 12:40:12,716 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:40:05" (3/4) ... [2024-11-12 12:40:12,718 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 12:40:12,720 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-12 12:40:12,720 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-12 12:40:12,720 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-12 12:40:12,720 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-12 12:40:12,728 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-11-12 12:40:12,729 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 12:40:12,729 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 12:40:12,729 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 12:40:12,809 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 12:40:12,809 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 12:40:12,809 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 12:40:12,810 INFO L158 Benchmark]: Toolchain (without parser) took 8275.69ms. Allocated memory was 178.3MB in the beginning and 931.1MB in the end (delta: 752.9MB). Free memory was 108.9MB in the beginning and 566.2MB in the end (delta: -457.2MB). Peak memory consumption was 295.9MB. Max. memory is 16.1GB. [2024-11-12 12:40:12,810 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 178.3MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:40:12,810 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.72ms. Allocated memory is still 178.3MB. Free memory was 108.7MB in the beginning and 93.4MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 12:40:12,810 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.83ms. Allocated memory is still 178.3MB. Free memory was 93.4MB in the beginning and 147.1MB in the end (delta: -53.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-12 12:40:12,810 INFO L158 Benchmark]: Boogie Preprocessor took 44.89ms. Allocated memory is still 178.3MB. Free memory was 147.1MB in the beginning and 144.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 12:40:12,811 INFO L158 Benchmark]: RCFGBuilder took 977.27ms. Allocated memory is still 178.3MB. Free memory was 144.3MB in the beginning and 92.5MB in the end (delta: 51.8MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. [2024-11-12 12:40:12,811 INFO L158 Benchmark]: TraceAbstraction took 6813.80ms. Allocated memory was 178.3MB in the beginning and 931.1MB in the end (delta: 752.9MB). Free memory was 91.4MB in the beginning and 573.5MB in the end (delta: -482.1MB). Peak memory consumption was 568.5MB. Max. memory is 16.1GB. [2024-11-12 12:40:12,811 INFO L158 Benchmark]: Witness Printer took 93.35ms. Allocated memory is still 931.1MB. Free memory was 573.5MB in the beginning and 566.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 12:40:12,812 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 178.3MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 271.72ms. Allocated memory is still 178.3MB. Free memory was 108.7MB in the beginning and 93.4MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.83ms. Allocated memory is still 178.3MB. Free memory was 93.4MB in the beginning and 147.1MB in the end (delta: -53.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.89ms. Allocated memory is still 178.3MB. Free memory was 147.1MB in the beginning and 144.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 977.27ms. Allocated memory is still 178.3MB. Free memory was 144.3MB in the beginning and 92.5MB in the end (delta: 51.8MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6813.80ms. Allocated memory was 178.3MB in the beginning and 931.1MB in the end (delta: 752.9MB). Free memory was 91.4MB in the beginning and 573.5MB in the end (delta: -482.1MB). Peak memory consumption was 568.5MB. Max. memory is 16.1GB. * Witness Printer took 93.35ms. Allocated memory is still 931.1MB. Free memory was 573.5MB in the beginning and 566.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 452 locations, 121 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 360 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 948 IncrementalHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 62 mSDtfsCounter, 948 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=730occurred in iteration=0, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1548 NumberOfCodeBlocks, 1548 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1531 ConstructedInterpolants, 0 QuantifiedInterpolants, 1678 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 68 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-12 12:40:12,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE