./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp3x3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/bench-exp3x3.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 21325645cf7d2c394d0eaa1628a16a96624f1addcdd1b56c7e8aa2473acfaf07 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:56:13,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:56:13,852 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:56:13,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:56:13,860 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:56:13,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:56:13,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:56:13,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:56:13,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:56:13,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:56:13,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:56:13,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:56:13,893 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:56:13,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:56:13,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:56:13,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:56:13,894 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:56:13,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:56:13,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:56:13,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:56:13,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:56:13,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:56:13,901 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:56:13,901 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:56:13,901 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:56:13,902 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:56:13,902 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:56:13,903 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:56:13,903 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:56:13,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:56:13,903 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:56:13,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:56:13,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:56:13,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:56:13,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:56:13,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:56:13,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:56:13,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:56:13,906 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:56:13,906 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:56:13,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:56:13,907 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 -> 21325645cf7d2c394d0eaa1628a16a96624f1addcdd1b56c7e8aa2473acfaf07 [2024-11-19 05:56:14,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:56:14,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:56:14,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:56:14,203 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:56:14,203 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:56:14,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp3x3.wvr.c [2024-11-19 05:56:15,743 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:56:15,979 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:56:15,983 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp3x3.wvr.c [2024-11-19 05:56:15,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87fce79c/65fff5f107cf4874b29cd69916ed786d/FLAG73ea6dfe7 [2024-11-19 05:56:16,014 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87fce79c/65fff5f107cf4874b29cd69916ed786d [2024-11-19 05:56:16,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:56:16,019 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:56:16,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:56:16,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:56:16,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:56:16,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@646d5274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16, skipping insertion in model container [2024-11-19 05:56:16,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,058 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:56:16,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:56:16,389 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:56:16,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:56:16,437 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:56:16,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16 WrapperNode [2024-11-19 05:56:16,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:56:16,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:56:16,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:56:16,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:56:16,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,478 INFO L138 Inliner]: procedures = 21, calls = 15, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 183 [2024-11-19 05:56:16,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:56:16,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:56:16,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:56:16,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:56:16,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,512 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:56:16,529 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:56:16,529 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:56:16,529 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:56:16,530 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16" (1/1) ... [2024-11-19 05:56:16,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:56:16,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:56:16,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:56:16,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:56:16,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:56:16,621 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:56:16,621 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:56:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:56:16,622 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:56:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:56:16,622 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:56:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-19 05:56:16,622 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-19 05:56:16,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:56:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-19 05:56:16,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-19 05:56:16,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-19 05:56:16,623 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-19 05:56:16,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:56:16,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:56:16,627 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:56:16,746 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:56:16,749 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:56:17,266 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:56:17,266 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:56:17,293 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:56:17,294 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 05:56:17,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:17 BoogieIcfgContainer [2024-11-19 05:56:17,295 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:56:17,297 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:56:17,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:56:17,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:56:17,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:56:16" (1/3) ... [2024-11-19 05:56:17,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261800c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:56:17, skipping insertion in model container [2024-11-19 05:56:17,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:56:16" (2/3) ... [2024-11-19 05:56:17,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@261800c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:56:17, skipping insertion in model container [2024-11-19 05:56:17,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:17" (3/3) ... [2024-11-19 05:56:17,307 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2024-11-19 05:56:17,324 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:56:17,325 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2024-11-19 05:56:17,325 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:56:17,469 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-11-19 05:56:17,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 371 places, 373 transitions, 788 flow [2024-11-19 05:56:17,750 INFO L124 PetriNetUnfolderBase]: 21/367 cut-off events. [2024-11-19 05:56:17,751 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:56:17,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 367 events. 21/367 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 684 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 300. Up to 2 conditions per place. [2024-11-19 05:56:17,763 INFO L82 GeneralOperation]: Start removeDead. Operand has 371 places, 373 transitions, 788 flow [2024-11-19 05:56:17,777 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 346 places, 346 transitions, 728 flow [2024-11-19 05:56:17,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:56:17,802 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;@54c6c521, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:56:17,803 INFO L334 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2024-11-19 05:56:17,810 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:56:17,811 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-19 05:56:17,811 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:56:17,811 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:17,812 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:17,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:17,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:17,819 INFO L85 PathProgramCache]: Analyzing trace with hash -748009484, now seen corresponding path program 1 times [2024-11-19 05:56:17,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:17,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864876070] [2024-11-19 05:56:17,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:17,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:18,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:18,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:18,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864876070] [2024-11-19 05:56:18,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864876070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:18,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:18,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:18,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003049137] [2024-11-19 05:56:18,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:18,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:18,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:18,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:18,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:18,182 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 373 [2024-11-19 05:56:18,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 346 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:18,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:18,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 373 [2024-11-19 05:56:18,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:18,348 INFO L124 PetriNetUnfolderBase]: 37/473 cut-off events. [2024-11-19 05:56:18,349 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-19 05:56:18,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 473 events. 37/473 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1661 event pairs, 20 based on Foata normal form. 91/466 useless extension candidates. Maximal degree in co-relation 485. Up to 68 conditions per place. [2024-11-19 05:56:18,363 INFO L140 encePairwiseOnDemand]: 363/373 looper letters, 22 selfloop transitions, 2 changer transitions 1/338 dead transitions. [2024-11-19 05:56:18,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 338 transitions, 760 flow [2024-11-19 05:56:18,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:18,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1046 transitions. [2024-11-19 05:56:18,387 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.934763181411975 [2024-11-19 05:56:18,392 INFO L175 Difference]: Start difference. First operand has 346 places, 346 transitions, 728 flow. Second operand 3 states and 1046 transitions. [2024-11-19 05:56:18,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 338 transitions, 760 flow [2024-11-19 05:56:18,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 338 transitions, 736 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-19 05:56:18,408 INFO L231 Difference]: Finished difference. Result has 335 places, 337 transitions, 690 flow [2024-11-19 05:56:18,412 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=335, PETRI_TRANSITIONS=337} [2024-11-19 05:56:18,420 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -11 predicate places. [2024-11-19 05:56:18,420 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 337 transitions, 690 flow [2024-11-19 05:56:18,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:18,421 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:18,421 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:18,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:56:18,422 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:18,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:18,423 INFO L85 PathProgramCache]: Analyzing trace with hash -698880175, now seen corresponding path program 1 times [2024-11-19 05:56:18,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:18,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953798059] [2024-11-19 05:56:18,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:18,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:18,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953798059] [2024-11-19 05:56:18,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953798059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:18,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:18,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:18,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200863059] [2024-11-19 05:56:18,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:18,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:18,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:18,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:18,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:18,600 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 373 [2024-11-19 05:56:18,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 337 transitions, 690 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:18,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:18,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 373 [2024-11-19 05:56:18,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:18,740 INFO L124 PetriNetUnfolderBase]: 37/471 cut-off events. [2024-11-19 05:56:18,741 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:56:18,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 471 events. 37/471 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1592 event pairs, 20 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 532. Up to 67 conditions per place. [2024-11-19 05:56:18,750 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 21 selfloop transitions, 2 changer transitions 0/336 dead transitions. [2024-11-19 05:56:18,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 336 transitions, 734 flow [2024-11-19 05:56:18,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:18,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2024-11-19 05:56:18,755 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9302949061662198 [2024-11-19 05:56:18,755 INFO L175 Difference]: Start difference. First operand has 335 places, 337 transitions, 690 flow. Second operand 3 states and 1041 transitions. [2024-11-19 05:56:18,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 336 transitions, 734 flow [2024-11-19 05:56:18,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 336 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:18,767 INFO L231 Difference]: Finished difference. Result has 333 places, 336 transitions, 688 flow [2024-11-19 05:56:18,767 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=688, PETRI_PLACES=333, PETRI_TRANSITIONS=336} [2024-11-19 05:56:18,768 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -13 predicate places. [2024-11-19 05:56:18,768 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 336 transitions, 688 flow [2024-11-19 05:56:18,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:18,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:18,769 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:18,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:56:18,770 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:18,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:18,771 INFO L85 PathProgramCache]: Analyzing trace with hash -320754955, now seen corresponding path program 1 times [2024-11-19 05:56:18,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:18,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037162872] [2024-11-19 05:56:18,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:18,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:18,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:18,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037162872] [2024-11-19 05:56:18,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037162872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:18,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:18,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:18,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298983585] [2024-11-19 05:56:18,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:18,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:18,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:18,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:18,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:18,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 373 [2024-11-19 05:56:18,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 336 transitions, 688 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:18,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:18,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 373 [2024-11-19 05:56:18,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:19,011 INFO L124 PetriNetUnfolderBase]: 37/452 cut-off events. [2024-11-19 05:56:19,011 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 05:56:19,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 452 events. 37/452 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1452 event pairs, 20 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 503. Up to 68 conditions per place. [2024-11-19 05:56:19,020 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 22 selfloop transitions, 2 changer transitions 0/335 dead transitions. [2024-11-19 05:56:19,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 335 transitions, 734 flow [2024-11-19 05:56:19,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:19,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2024-11-19 05:56:19,023 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9285075960679178 [2024-11-19 05:56:19,024 INFO L175 Difference]: Start difference. First operand has 333 places, 336 transitions, 688 flow. Second operand 3 states and 1039 transitions. [2024-11-19 05:56:19,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 335 transitions, 734 flow [2024-11-19 05:56:19,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 335 transitions, 730 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:19,030 INFO L231 Difference]: Finished difference. Result has 332 places, 335 transitions, 686 flow [2024-11-19 05:56:19,031 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=686, PETRI_PLACES=332, PETRI_TRANSITIONS=335} [2024-11-19 05:56:19,032 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -14 predicate places. [2024-11-19 05:56:19,032 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 335 transitions, 686 flow [2024-11-19 05:56:19,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:19,033 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:19,033 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:19,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:56:19,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:19,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:19,034 INFO L85 PathProgramCache]: Analyzing trace with hash -132641644, now seen corresponding path program 1 times [2024-11-19 05:56:19,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:19,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354743844] [2024-11-19 05:56:19,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:19,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:19,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:19,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354743844] [2024-11-19 05:56:19,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354743844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:19,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:19,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602347780] [2024-11-19 05:56:19,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:19,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:19,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:19,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:19,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:19,138 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 373 [2024-11-19 05:56:19,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 335 transitions, 686 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:19,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:19,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 373 [2024-11-19 05:56:19,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:19,247 INFO L124 PetriNetUnfolderBase]: 37/433 cut-off events. [2024-11-19 05:56:19,247 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 05:56:19,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 433 events. 37/433 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1230 event pairs, 20 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 472. Up to 67 conditions per place. [2024-11-19 05:56:19,255 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 21 selfloop transitions, 2 changer transitions 0/334 dead transitions. [2024-11-19 05:56:19,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 334 transitions, 730 flow [2024-11-19 05:56:19,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:19,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:19,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2024-11-19 05:56:19,258 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9302949061662198 [2024-11-19 05:56:19,258 INFO L175 Difference]: Start difference. First operand has 332 places, 335 transitions, 686 flow. Second operand 3 states and 1041 transitions. [2024-11-19 05:56:19,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 334 transitions, 730 flow [2024-11-19 05:56:19,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 334 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:19,265 INFO L231 Difference]: Finished difference. Result has 331 places, 334 transitions, 684 flow [2024-11-19 05:56:19,265 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=331, PETRI_TRANSITIONS=334} [2024-11-19 05:56:19,267 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -15 predicate places. [2024-11-19 05:56:19,267 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 334 transitions, 684 flow [2024-11-19 05:56:19,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:19,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:19,268 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:19,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:56:19,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:19,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash -350897220, now seen corresponding path program 1 times [2024-11-19 05:56:19,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:19,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508408393] [2024-11-19 05:56:19,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:19,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:19,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:19,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508408393] [2024-11-19 05:56:19,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508408393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:19,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:19,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:19,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441651713] [2024-11-19 05:56:19,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:19,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:19,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:19,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:19,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:19,377 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 338 out of 373 [2024-11-19 05:56:19,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 334 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:19,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:19,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 338 of 373 [2024-11-19 05:56:19,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:19,460 INFO L124 PetriNetUnfolderBase]: 37/414 cut-off events. [2024-11-19 05:56:19,461 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 05:56:19,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 414 events. 37/414 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1067 event pairs, 20 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 443. Up to 68 conditions per place. [2024-11-19 05:56:19,468 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 22 selfloop transitions, 2 changer transitions 0/333 dead transitions. [2024-11-19 05:56:19,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 333 transitions, 730 flow [2024-11-19 05:56:19,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1039 transitions. [2024-11-19 05:56:19,471 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9285075960679178 [2024-11-19 05:56:19,471 INFO L175 Difference]: Start difference. First operand has 331 places, 334 transitions, 684 flow. Second operand 3 states and 1039 transitions. [2024-11-19 05:56:19,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 333 transitions, 730 flow [2024-11-19 05:56:19,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 333 transitions, 726 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:19,478 INFO L231 Difference]: Finished difference. Result has 330 places, 333 transitions, 682 flow [2024-11-19 05:56:19,478 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=330, PETRI_TRANSITIONS=333} [2024-11-19 05:56:19,479 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -16 predicate places. [2024-11-19 05:56:19,479 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 333 transitions, 682 flow [2024-11-19 05:56:19,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 339.3333333333333) internal successors, (1018), 3 states have internal predecessors, (1018), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:19,482 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:19,482 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:19,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:56:19,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:19,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:19,483 INFO L85 PathProgramCache]: Analyzing trace with hash 200376289, now seen corresponding path program 1 times [2024-11-19 05:56:19,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:19,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204261190] [2024-11-19 05:56:19,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:19,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:19,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204261190] [2024-11-19 05:56:19,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204261190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:19,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:19,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:19,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501210838] [2024-11-19 05:56:19,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:19,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:19,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:19,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:19,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:19,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 373 [2024-11-19 05:56:19,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 333 transitions, 682 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:19,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:19,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 373 [2024-11-19 05:56:19,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:19,652 INFO L124 PetriNetUnfolderBase]: 37/395 cut-off events. [2024-11-19 05:56:19,653 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 05:56:19,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 395 events. 37/395 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 911 event pairs, 20 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 412. Up to 67 conditions per place. [2024-11-19 05:56:19,658 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 21 selfloop transitions, 2 changer transitions 0/332 dead transitions. [2024-11-19 05:56:19,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 332 transitions, 726 flow [2024-11-19 05:56:19,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2024-11-19 05:56:19,661 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9302949061662198 [2024-11-19 05:56:19,661 INFO L175 Difference]: Start difference. First operand has 330 places, 333 transitions, 682 flow. Second operand 3 states and 1041 transitions. [2024-11-19 05:56:19,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 332 transitions, 726 flow [2024-11-19 05:56:19,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 332 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:19,667 INFO L231 Difference]: Finished difference. Result has 329 places, 332 transitions, 680 flow [2024-11-19 05:56:19,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=332, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=329, PETRI_TRANSITIONS=332} [2024-11-19 05:56:19,691 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -17 predicate places. [2024-11-19 05:56:19,691 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 332 transitions, 680 flow [2024-11-19 05:56:19,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:19,693 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:19,693 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:19,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:56:19,694 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:19,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:19,694 INFO L85 PathProgramCache]: Analyzing trace with hash -936151976, now seen corresponding path program 1 times [2024-11-19 05:56:19,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:19,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455108631] [2024-11-19 05:56:19,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:19,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:19,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:19,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:19,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455108631] [2024-11-19 05:56:19,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455108631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:19,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:19,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:19,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103727726] [2024-11-19 05:56:19,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:19,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:19,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:19,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:19,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:19,774 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 373 [2024-11-19 05:56:19,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 332 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:19,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:19,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 373 [2024-11-19 05:56:19,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:20,650 INFO L124 PetriNetUnfolderBase]: 755/4731 cut-off events. [2024-11-19 05:56:20,650 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-19 05:56:20,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5736 conditions, 4731 events. 755/4731 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 46078 event pairs, 387 based on Foata normal form. 0/3476 useless extension candidates. Maximal degree in co-relation 5667. Up to 936 conditions per place. [2024-11-19 05:56:20,744 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 21 selfloop transitions, 2 changer transitions 0/331 dead transitions. [2024-11-19 05:56:20,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 331 transitions, 724 flow [2024-11-19 05:56:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1041 transitions. [2024-11-19 05:56:20,748 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9302949061662198 [2024-11-19 05:56:20,748 INFO L175 Difference]: Start difference. First operand has 329 places, 332 transitions, 680 flow. Second operand 3 states and 1041 transitions. [2024-11-19 05:56:20,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 331 transitions, 724 flow [2024-11-19 05:56:20,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 331 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:20,756 INFO L231 Difference]: Finished difference. Result has 328 places, 331 transitions, 678 flow [2024-11-19 05:56:20,757 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=678, PETRI_PLACES=328, PETRI_TRANSITIONS=331} [2024-11-19 05:56:20,758 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -18 predicate places. [2024-11-19 05:56:20,759 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 331 transitions, 678 flow [2024-11-19 05:56:20,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 340.3333333333333) internal successors, (1021), 3 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:20,760 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:20,760 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:20,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:56:20,760 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:20,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:20,761 INFO L85 PathProgramCache]: Analyzing trace with hash -551824842, now seen corresponding path program 1 times [2024-11-19 05:56:20,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:20,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471122086] [2024-11-19 05:56:20,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:20,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:20,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:20,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471122086] [2024-11-19 05:56:20,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471122086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:20,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:20,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:20,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245360156] [2024-11-19 05:56:20,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:20,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:20,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:20,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:20,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:20,835 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 373 [2024-11-19 05:56:20,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 331 transitions, 678 flow. Second operand has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:20,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:20,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 373 [2024-11-19 05:56:20,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:20,928 INFO L124 PetriNetUnfolderBase]: 52/461 cut-off events. [2024-11-19 05:56:20,929 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:56:20,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 609 conditions, 461 events. 52/461 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1742 event pairs, 30 based on Foata normal form. 0/386 useless extension candidates. Maximal degree in co-relation 533. Up to 90 conditions per place. [2024-11-19 05:56:20,936 INFO L140 encePairwiseOnDemand]: 364/373 looper letters, 29 selfloop transitions, 3 changer transitions 0/331 dead transitions. [2024-11-19 05:56:20,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 331 transitions, 747 flow [2024-11-19 05:56:20,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:20,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:20,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1034 transitions. [2024-11-19 05:56:20,988 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9240393208221627 [2024-11-19 05:56:20,988 INFO L175 Difference]: Start difference. First operand has 328 places, 331 transitions, 678 flow. Second operand 3 states and 1034 transitions. [2024-11-19 05:56:20,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 331 transitions, 747 flow [2024-11-19 05:56:20,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 331 transitions, 743 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:21,000 INFO L231 Difference]: Finished difference. Result has 323 places, 326 transitions, 675 flow [2024-11-19 05:56:21,000 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=675, PETRI_PLACES=323, PETRI_TRANSITIONS=326} [2024-11-19 05:56:21,001 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -23 predicate places. [2024-11-19 05:56:21,001 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 326 transitions, 675 flow [2024-11-19 05:56:21,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:21,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:21,002 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:21,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:56:21,003 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:21,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:21,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2022671171, now seen corresponding path program 1 times [2024-11-19 05:56:21,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:21,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924299993] [2024-11-19 05:56:21,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:21,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:21,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:21,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:21,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:21,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924299993] [2024-11-19 05:56:21,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924299993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:21,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:21,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:21,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882410951] [2024-11-19 05:56:21,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:21,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:21,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:21,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:21,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:21,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 373 [2024-11-19 05:56:21,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 326 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:21,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:21,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 373 [2024-11-19 05:56:21,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:21,149 INFO L124 PetriNetUnfolderBase]: 52/457 cut-off events. [2024-11-19 05:56:21,149 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-19 05:56:21,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 457 events. 52/457 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1691 event pairs, 30 based on Foata normal form. 0/388 useless extension candidates. Maximal degree in co-relation 515. Up to 88 conditions per place. [2024-11-19 05:56:21,156 INFO L140 encePairwiseOnDemand]: 365/373 looper letters, 27 selfloop transitions, 3 changer transitions 0/327 dead transitions. [2024-11-19 05:56:21,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 327 transitions, 742 flow [2024-11-19 05:56:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:21,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1040 transitions. [2024-11-19 05:56:21,159 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9294012511170688 [2024-11-19 05:56:21,159 INFO L175 Difference]: Start difference. First operand has 323 places, 326 transitions, 675 flow. Second operand 3 states and 1040 transitions. [2024-11-19 05:56:21,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 327 transitions, 742 flow [2024-11-19 05:56:21,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 327 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:21,165 INFO L231 Difference]: Finished difference. Result has 320 places, 322 transitions, 675 flow [2024-11-19 05:56:21,166 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=675, PETRI_PLACES=320, PETRI_TRANSITIONS=322} [2024-11-19 05:56:21,167 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -26 predicate places. [2024-11-19 05:56:21,167 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 322 transitions, 675 flow [2024-11-19 05:56:21,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:21,168 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:21,168 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:21,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:56:21,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:21,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:21,169 INFO L85 PathProgramCache]: Analyzing trace with hash 370001196, now seen corresponding path program 1 times [2024-11-19 05:56:21,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:21,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370879972] [2024-11-19 05:56:21,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:21,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:21,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:21,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370879972] [2024-11-19 05:56:21,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370879972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:21,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:21,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:21,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157082624] [2024-11-19 05:56:21,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:21,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:21,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:21,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:21,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:21,250 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 373 [2024-11-19 05:56:21,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 322 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:21,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:21,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 373 [2024-11-19 05:56:21,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:21,394 INFO L124 PetriNetUnfolderBase]: 70/752 cut-off events. [2024-11-19 05:56:21,395 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-19 05:56:21,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 752 events. 70/752 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3799 event pairs, 25 based on Foata normal form. 0/638 useless extension candidates. Maximal degree in co-relation 825. Up to 96 conditions per place. [2024-11-19 05:56:21,409 INFO L140 encePairwiseOnDemand]: 363/373 looper letters, 32 selfloop transitions, 4 changer transitions 0/326 dead transitions. [2024-11-19 05:56:21,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 326 transitions, 763 flow [2024-11-19 05:56:21,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1038 transitions. [2024-11-19 05:56:21,444 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9276139410187667 [2024-11-19 05:56:21,444 INFO L175 Difference]: Start difference. First operand has 320 places, 322 transitions, 675 flow. Second operand 3 states and 1038 transitions. [2024-11-19 05:56:21,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 326 transitions, 763 flow [2024-11-19 05:56:21,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 326 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:21,451 INFO L231 Difference]: Finished difference. Result has 316 places, 318 transitions, 680 flow [2024-11-19 05:56:21,452 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=316, PETRI_TRANSITIONS=318} [2024-11-19 05:56:21,453 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -30 predicate places. [2024-11-19 05:56:21,453 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 318 transitions, 680 flow [2024-11-19 05:56:21,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:21,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:21,454 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:21,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:56:21,454 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:21,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash -911110627, now seen corresponding path program 1 times [2024-11-19 05:56:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:21,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859949573] [2024-11-19 05:56:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:21,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:21,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859949573] [2024-11-19 05:56:21,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859949573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:21,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:21,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:21,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951442364] [2024-11-19 05:56:21,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:21,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:21,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:21,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:21,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:21,536 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 373 [2024-11-19 05:56:21,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 318 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:21,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:21,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 373 [2024-11-19 05:56:21,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:21,705 INFO L124 PetriNetUnfolderBase]: 104/910 cut-off events. [2024-11-19 05:56:21,706 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-19 05:56:21,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 910 events. 104/910 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5052 event pairs, 9 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 875. Up to 151 conditions per place. [2024-11-19 05:56:21,721 INFO L140 encePairwiseOnDemand]: 365/373 looper letters, 31 selfloop transitions, 3 changer transitions 0/323 dead transitions. [2024-11-19 05:56:21,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 323 transitions, 767 flow [2024-11-19 05:56:21,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1044 transitions. [2024-11-19 05:56:21,725 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9329758713136729 [2024-11-19 05:56:21,725 INFO L175 Difference]: Start difference. First operand has 316 places, 318 transitions, 680 flow. Second operand 3 states and 1044 transitions. [2024-11-19 05:56:21,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 323 transitions, 767 flow [2024-11-19 05:56:21,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 323 transitions, 763 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:21,731 INFO L231 Difference]: Finished difference. Result has 313 places, 314 transitions, 679 flow [2024-11-19 05:56:21,732 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=313, PETRI_TRANSITIONS=314} [2024-11-19 05:56:21,733 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -33 predicate places. [2024-11-19 05:56:21,733 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 314 transitions, 679 flow [2024-11-19 05:56:21,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:21,734 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:21,734 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:21,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:56:21,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:21,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:21,735 INFO L85 PathProgramCache]: Analyzing trace with hash 407258650, now seen corresponding path program 1 times [2024-11-19 05:56:21,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:21,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436074108] [2024-11-19 05:56:21,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:21,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:21,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:21,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436074108] [2024-11-19 05:56:21,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436074108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:21,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:21,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:21,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262636980] [2024-11-19 05:56:21,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:21,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:21,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:21,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:21,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:21,816 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 332 out of 373 [2024-11-19 05:56:21,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 314 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:21,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:21,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 332 of 373 [2024-11-19 05:56:21,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:22,091 INFO L124 PetriNetUnfolderBase]: 153/1421 cut-off events. [2024-11-19 05:56:22,092 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-11-19 05:56:22,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 1421 events. 153/1421 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9640 event pairs, 12 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 1329. Up to 235 conditions per place. [2024-11-19 05:56:22,120 INFO L140 encePairwiseOnDemand]: 363/373 looper letters, 34 selfloop transitions, 4 changer transitions 0/320 dead transitions. [2024-11-19 05:56:22,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 320 transitions, 777 flow [2024-11-19 05:56:22,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:22,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1040 transitions. [2024-11-19 05:56:22,123 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9294012511170688 [2024-11-19 05:56:22,123 INFO L175 Difference]: Start difference. First operand has 313 places, 314 transitions, 679 flow. Second operand 3 states and 1040 transitions. [2024-11-19 05:56:22,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 320 transitions, 777 flow [2024-11-19 05:56:22,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 320 transitions, 774 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:22,129 INFO L231 Difference]: Finished difference. Result has 309 places, 310 transitions, 684 flow [2024-11-19 05:56:22,130 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=309, PETRI_TRANSITIONS=310} [2024-11-19 05:56:22,131 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -37 predicate places. [2024-11-19 05:56:22,132 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 310 transitions, 684 flow [2024-11-19 05:56:22,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:22,133 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:22,133 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:22,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:56:22,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:22,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:22,134 INFO L85 PathProgramCache]: Analyzing trace with hash 533560071, now seen corresponding path program 1 times [2024-11-19 05:56:22,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:22,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648060094] [2024-11-19 05:56:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:22,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:22,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:22,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648060094] [2024-11-19 05:56:22,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648060094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:22,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:22,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:22,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031454062] [2024-11-19 05:56:22,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:22,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:22,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:22,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:22,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:22,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 373 [2024-11-19 05:56:22,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 310 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:22,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:22,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 373 [2024-11-19 05:56:22,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:22,629 INFO L124 PetriNetUnfolderBase]: 222/2002 cut-off events. [2024-11-19 05:56:22,630 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2024-11-19 05:56:22,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2627 conditions, 2002 events. 222/2002 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 15440 event pairs, 19 based on Foata normal form. 1/1819 useless extension candidates. Maximal degree in co-relation 1756. Up to 332 conditions per place. [2024-11-19 05:56:22,664 INFO L140 encePairwiseOnDemand]: 365/373 looper letters, 30 selfloop transitions, 3 changer transitions 18/317 dead transitions. [2024-11-19 05:56:22,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 317 transitions, 779 flow [2024-11-19 05:56:22,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1045 transitions. [2024-11-19 05:56:22,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9338695263628239 [2024-11-19 05:56:22,669 INFO L175 Difference]: Start difference. First operand has 309 places, 310 transitions, 684 flow. Second operand 3 states and 1045 transitions. [2024-11-19 05:56:22,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 317 transitions, 779 flow [2024-11-19 05:56:22,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 317 transitions, 775 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:22,677 INFO L231 Difference]: Finished difference. Result has 306 places, 288 transitions, 646 flow [2024-11-19 05:56:22,678 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=306, PETRI_TRANSITIONS=288} [2024-11-19 05:56:22,679 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -40 predicate places. [2024-11-19 05:56:22,679 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 288 transitions, 646 flow [2024-11-19 05:56:22,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 336.0) internal successors, (1008), 3 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:22,680 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:22,681 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:22,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:56:22,681 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:22,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:22,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1316544112, now seen corresponding path program 1 times [2024-11-19 05:56:22,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:22,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630400127] [2024-11-19 05:56:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:22,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:22,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:22,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:22,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630400127] [2024-11-19 05:56:22,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630400127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:22,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:22,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:22,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204920571] [2024-11-19 05:56:22,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:22,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:22,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:22,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:22,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:22,767 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 373 [2024-11-19 05:56:22,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 288 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:22,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:22,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 373 [2024-11-19 05:56:22,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:32,842 INFO L124 PetriNetUnfolderBase]: 18691/70752 cut-off events. [2024-11-19 05:56:32,842 INFO L125 PetriNetUnfolderBase]: For 1780/1780 co-relation queries the response was YES. [2024-11-19 05:56:33,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102346 conditions, 70752 events. 18691/70752 cut-off events. For 1780/1780 co-relation queries the response was YES. Maximal size of possible extension queue 2563. Compared 1065754 event pairs, 9985 based on Foata normal form. 0/60885 useless extension candidates. Maximal degree in co-relation 36296. Up to 23154 conditions per place. [2024-11-19 05:56:33,807 INFO L140 encePairwiseOnDemand]: 361/373 looper letters, 29 selfloop transitions, 6 changer transitions 0/293 dead transitions. [2024-11-19 05:56:33,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 293 transitions, 731 flow [2024-11-19 05:56:33,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1040 transitions. [2024-11-19 05:56:33,810 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9294012511170688 [2024-11-19 05:56:33,810 INFO L175 Difference]: Start difference. First operand has 306 places, 288 transitions, 646 flow. Second operand 3 states and 1040 transitions. [2024-11-19 05:56:33,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 293 transitions, 731 flow [2024-11-19 05:56:33,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 293 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:56:33,920 INFO L231 Difference]: Finished difference. Result has 285 places, 288 transitions, 673 flow [2024-11-19 05:56:33,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=631, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=673, PETRI_PLACES=285, PETRI_TRANSITIONS=288} [2024-11-19 05:56:33,924 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -61 predicate places. [2024-11-19 05:56:33,924 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 288 transitions, 673 flow [2024-11-19 05:56:33,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.3333333333333) internal successors, (1003), 3 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:33,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:33,925 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:33,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:56:33,926 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:33,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:33,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1563741403, now seen corresponding path program 1 times [2024-11-19 05:56:33,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:33,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971707768] [2024-11-19 05:56:33,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:33,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:33,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:33,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971707768] [2024-11-19 05:56:33,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971707768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:33,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:33,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:33,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80298256] [2024-11-19 05:56:33,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:33,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:33,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:33,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:33,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:34,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 373 [2024-11-19 05:56:34,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 288 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:34,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:34,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 373 [2024-11-19 05:56:34,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:35,498 INFO L124 PetriNetUnfolderBase]: 2051/10608 cut-off events. [2024-11-19 05:56:35,498 INFO L125 PetriNetUnfolderBase]: For 73/109 co-relation queries the response was YES. [2024-11-19 05:56:35,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15083 conditions, 10608 events. 2051/10608 cut-off events. For 73/109 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 128472 event pairs, 546 based on Foata normal form. 0/9038 useless extension candidates. Maximal degree in co-relation 8297. Up to 2106 conditions per place. [2024-11-19 05:56:35,620 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 25 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2024-11-19 05:56:35,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 292 transitions, 740 flow [2024-11-19 05:56:35,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1047 transitions. [2024-11-19 05:56:35,623 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935656836461126 [2024-11-19 05:56:35,623 INFO L175 Difference]: Start difference. First operand has 285 places, 288 transitions, 673 flow. Second operand 3 states and 1047 transitions. [2024-11-19 05:56:35,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 292 transitions, 740 flow [2024-11-19 05:56:35,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 292 transitions, 740 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:56:35,636 INFO L231 Difference]: Finished difference. Result has 286 places, 287 transitions, 675 flow [2024-11-19 05:56:35,637 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=675, PETRI_PLACES=286, PETRI_TRANSITIONS=287} [2024-11-19 05:56:35,637 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -60 predicate places. [2024-11-19 05:56:35,638 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 287 transitions, 675 flow [2024-11-19 05:56:35,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 343.0) internal successors, (1029), 3 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:35,639 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:35,639 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:35,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:56:35,640 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:35,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:35,640 INFO L85 PathProgramCache]: Analyzing trace with hash -297074701, now seen corresponding path program 1 times [2024-11-19 05:56:35,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:35,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014569866] [2024-11-19 05:56:35,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:35,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:35,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:35,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014569866] [2024-11-19 05:56:35,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014569866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:35,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:35,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:35,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238454056] [2024-11-19 05:56:35,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:35,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:35,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:35,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:35,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:35,722 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 373 [2024-11-19 05:56:35,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 287 transitions, 675 flow. Second operand has 3 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:35,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:35,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 373 [2024-11-19 05:56:35,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:38,600 INFO L124 PetriNetUnfolderBase]: 4001/17647 cut-off events. [2024-11-19 05:56:38,600 INFO L125 PetriNetUnfolderBase]: For 444/468 co-relation queries the response was YES. [2024-11-19 05:56:38,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27008 conditions, 17647 events. 4001/17647 cut-off events. For 444/468 co-relation queries the response was YES. Maximal size of possible extension queue 728. Compared 229719 event pairs, 1404 based on Foata normal form. 0/15685 useless extension candidates. Maximal degree in co-relation 26219. Up to 3152 conditions per place. [2024-11-19 05:56:38,798 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 24 selfloop transitions, 2 changer transitions 0/291 dead transitions. [2024-11-19 05:56:38,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 291 transitions, 740 flow [2024-11-19 05:56:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:38,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:38,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2024-11-19 05:56:38,801 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9374441465594281 [2024-11-19 05:56:38,801 INFO L175 Difference]: Start difference. First operand has 286 places, 287 transitions, 675 flow. Second operand 3 states and 1049 transitions. [2024-11-19 05:56:38,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 291 transitions, 740 flow [2024-11-19 05:56:38,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 291 transitions, 736 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:38,813 INFO L231 Difference]: Finished difference. Result has 285 places, 286 transitions, 673 flow [2024-11-19 05:56:38,813 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=673, PETRI_PLACES=285, PETRI_TRANSITIONS=286} [2024-11-19 05:56:38,814 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -61 predicate places. [2024-11-19 05:56:38,814 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 286 transitions, 673 flow [2024-11-19 05:56:38,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.3333333333333) internal successors, (1033), 3 states have internal predecessors, (1033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:38,815 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:38,815 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:38,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:56:38,815 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:38,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:38,816 INFO L85 PathProgramCache]: Analyzing trace with hash 329484035, now seen corresponding path program 1 times [2024-11-19 05:56:38,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:38,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228030783] [2024-11-19 05:56:38,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:38,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:38,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:38,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:38,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228030783] [2024-11-19 05:56:38,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228030783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:38,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:38,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:38,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036832865] [2024-11-19 05:56:38,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:38,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:38,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:38,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:38,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:38,904 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 373 [2024-11-19 05:56:38,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 286 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 343.3333333333333) internal successors, (1030), 3 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:38,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:38,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 373 [2024-11-19 05:56:38,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:41,136 INFO L124 PetriNetUnfolderBase]: 2747/12631 cut-off events. [2024-11-19 05:56:41,137 INFO L125 PetriNetUnfolderBase]: For 573/591 co-relation queries the response was YES. [2024-11-19 05:56:41,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18842 conditions, 12631 events. 2747/12631 cut-off events. For 573/591 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 154164 event pairs, 867 based on Foata normal form. 0/11082 useless extension candidates. Maximal degree in co-relation 17382. Up to 2394 conditions per place. [2024-11-19 05:56:41,332 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 26 selfloop transitions, 2 changer transitions 0/290 dead transitions. [2024-11-19 05:56:41,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 290 transitions, 742 flow [2024-11-19 05:56:41,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:41,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:41,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1047 transitions. [2024-11-19 05:56:41,335 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935656836461126 [2024-11-19 05:56:41,336 INFO L175 Difference]: Start difference. First operand has 285 places, 286 transitions, 673 flow. Second operand 3 states and 1047 transitions. [2024-11-19 05:56:41,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 290 transitions, 742 flow [2024-11-19 05:56:41,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 290 transitions, 738 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:41,352 INFO L231 Difference]: Finished difference. Result has 284 places, 285 transitions, 671 flow [2024-11-19 05:56:41,352 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=671, PETRI_PLACES=284, PETRI_TRANSITIONS=285} [2024-11-19 05:56:41,353 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -62 predicate places. [2024-11-19 05:56:41,353 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 285 transitions, 671 flow [2024-11-19 05:56:41,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 343.3333333333333) internal successors, (1030), 3 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:41,354 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:41,354 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:41,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:56:41,354 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:41,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1218308526, now seen corresponding path program 1 times [2024-11-19 05:56:41,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:41,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740721300] [2024-11-19 05:56:41,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:41,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:41,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:41,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740721300] [2024-11-19 05:56:41,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740721300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:41,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:41,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:41,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072306152] [2024-11-19 05:56:41,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:41,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:41,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:41,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:41,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:41,449 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 373 [2024-11-19 05:56:41,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 285 transitions, 671 flow. Second operand has 3 states, 3 states have (on average 344.6666666666667) internal successors, (1034), 3 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:41,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:41,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 373 [2024-11-19 05:56:41,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:43,358 INFO L124 PetriNetUnfolderBase]: 2649/11575 cut-off events. [2024-11-19 05:56:43,358 INFO L125 PetriNetUnfolderBase]: For 585/616 co-relation queries the response was YES. [2024-11-19 05:56:43,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17706 conditions, 11575 events. 2649/11575 cut-off events. For 585/616 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 138504 event pairs, 874 based on Foata normal form. 3/10317 useless extension candidates. Maximal degree in co-relation 16892. Up to 2195 conditions per place. [2024-11-19 05:56:43,536 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 24 selfloop transitions, 2 changer transitions 0/289 dead transitions. [2024-11-19 05:56:43,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 289 transitions, 736 flow [2024-11-19 05:56:43,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2024-11-19 05:56:43,538 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9374441465594281 [2024-11-19 05:56:43,538 INFO L175 Difference]: Start difference. First operand has 284 places, 285 transitions, 671 flow. Second operand 3 states and 1049 transitions. [2024-11-19 05:56:43,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 289 transitions, 736 flow [2024-11-19 05:56:43,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 289 transitions, 732 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:43,548 INFO L231 Difference]: Finished difference. Result has 283 places, 284 transitions, 669 flow [2024-11-19 05:56:43,549 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=283, PETRI_TRANSITIONS=284} [2024-11-19 05:56:43,549 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -63 predicate places. [2024-11-19 05:56:43,549 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 284 transitions, 669 flow [2024-11-19 05:56:43,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.6666666666667) internal successors, (1034), 3 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:43,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:43,550 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:43,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:56:43,550 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread5Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:43,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:43,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1169197540, now seen corresponding path program 1 times [2024-11-19 05:56:43,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845861570] [2024-11-19 05:56:43,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:43,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:43,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:43,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:43,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845861570] [2024-11-19 05:56:43,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845861570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:43,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:43,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:43,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713556071] [2024-11-19 05:56:43,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:43,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:43,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:43,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:43,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:43,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 340 out of 373 [2024-11-19 05:56:43,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 284 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:43,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:43,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 340 of 373 [2024-11-19 05:56:43,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:45,098 INFO L124 PetriNetUnfolderBase]: 2031/9411 cut-off events. [2024-11-19 05:56:45,099 INFO L125 PetriNetUnfolderBase]: For 554/598 co-relation queries the response was YES. [2024-11-19 05:56:45,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14100 conditions, 9411 events. 2031/9411 cut-off events. For 554/598 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 107555 event pairs, 646 based on Foata normal form. 5/8372 useless extension candidates. Maximal degree in co-relation 12890. Up to 1876 conditions per place. [2024-11-19 05:56:45,260 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 26 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-11-19 05:56:45,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 288 transitions, 738 flow [2024-11-19 05:56:45,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1047 transitions. [2024-11-19 05:56:45,263 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.935656836461126 [2024-11-19 05:56:45,263 INFO L175 Difference]: Start difference. First operand has 283 places, 284 transitions, 669 flow. Second operand 3 states and 1047 transitions. [2024-11-19 05:56:45,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 288 transitions, 738 flow [2024-11-19 05:56:45,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 288 transitions, 734 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:45,277 INFO L231 Difference]: Finished difference. Result has 282 places, 283 transitions, 667 flow [2024-11-19 05:56:45,278 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=280, 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=667, PETRI_PLACES=282, PETRI_TRANSITIONS=283} [2024-11-19 05:56:45,278 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -64 predicate places. [2024-11-19 05:56:45,278 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 667 flow [2024-11-19 05:56:45,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:45,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:56:45,279 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:45,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:56:45,279 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread6Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 84 more)] === [2024-11-19 05:56:45,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:56:45,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1435968225, now seen corresponding path program 1 times [2024-11-19 05:56:45,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:56:45,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032494271] [2024-11-19 05:56:45,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:56:45,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:56:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:56:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:56:45,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:56:45,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032494271] [2024-11-19 05:56:45,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032494271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:56:45,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:56:45,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:56:45,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353217679] [2024-11-19 05:56:45,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:56:45,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:56:45,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:56:45,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:56:45,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:56:45,351 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 373 [2024-11-19 05:56:45,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 283 transitions, 667 flow. Second operand has 3 states, 3 states have (on average 345.3333333333333) internal successors, (1036), 3 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:45,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:56:45,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 373 [2024-11-19 05:56:45,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:56:46,487 INFO L124 PetriNetUnfolderBase]: 1397/7322 cut-off events. [2024-11-19 05:56:46,488 INFO L125 PetriNetUnfolderBase]: For 296/324 co-relation queries the response was YES. [2024-11-19 05:56:46,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10372 conditions, 7322 events. 1397/7322 cut-off events. For 296/324 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 79666 event pairs, 375 based on Foata normal form. 4/6510 useless extension candidates. Maximal degree in co-relation 9562. Up to 1480 conditions per place. [2024-11-19 05:56:46,641 INFO L140 encePairwiseOnDemand]: 370/373 looper letters, 0 selfloop transitions, 0 changer transitions 287/287 dead transitions. [2024-11-19 05:56:46,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 287 transitions, 732 flow [2024-11-19 05:56:46,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:56:46,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:56:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1049 transitions. [2024-11-19 05:56:46,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9374441465594281 [2024-11-19 05:56:46,644 INFO L175 Difference]: Start difference. First operand has 282 places, 283 transitions, 667 flow. Second operand 3 states and 1049 transitions. [2024-11-19 05:56:46,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 287 transitions, 732 flow [2024-11-19 05:56:46,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 287 transitions, 728 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:56:46,653 INFO L231 Difference]: Finished difference. Result has 281 places, 0 transitions, 0 flow [2024-11-19 05:56:46,653 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=373, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=281, PETRI_TRANSITIONS=0} [2024-11-19 05:56:46,654 INFO L277 CegarLoopForPetriNet]: 346 programPoint places, -65 predicate places. [2024-11-19 05:56:46,654 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 0 transitions, 0 flow [2024-11-19 05:56:46,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 345.3333333333333) internal successors, (1036), 3 states have internal predecessors, (1036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:56:46,657 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (87 of 88 remaining) [2024-11-19 05:56:46,658 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (86 of 88 remaining) [2024-11-19 05:56:46,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (85 of 88 remaining) [2024-11-19 05:56:46,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (84 of 88 remaining) [2024-11-19 05:56:46,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (83 of 88 remaining) [2024-11-19 05:56:46,659 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (82 of 88 remaining) [2024-11-19 05:56:46,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (81 of 88 remaining) [2024-11-19 05:56:46,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (80 of 88 remaining) [2024-11-19 05:56:46,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (79 of 88 remaining) [2024-11-19 05:56:46,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (78 of 88 remaining) [2024-11-19 05:56:46,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (77 of 88 remaining) [2024-11-19 05:56:46,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (76 of 88 remaining) [2024-11-19 05:56:46,660 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (75 of 88 remaining) [2024-11-19 05:56:46,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (74 of 88 remaining) [2024-11-19 05:56:46,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (73 of 88 remaining) [2024-11-19 05:56:46,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (72 of 88 remaining) [2024-11-19 05:56:46,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (71 of 88 remaining) [2024-11-19 05:56:46,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (70 of 88 remaining) [2024-11-19 05:56:46,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (69 of 88 remaining) [2024-11-19 05:56:46,661 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (68 of 88 remaining) [2024-11-19 05:56:46,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (67 of 88 remaining) [2024-11-19 05:56:46,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (66 of 88 remaining) [2024-11-19 05:56:46,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (65 of 88 remaining) [2024-11-19 05:56:46,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (64 of 88 remaining) [2024-11-19 05:56:46,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (63 of 88 remaining) [2024-11-19 05:56:46,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (62 of 88 remaining) [2024-11-19 05:56:46,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (61 of 88 remaining) [2024-11-19 05:56:46,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (60 of 88 remaining) [2024-11-19 05:56:46,662 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (59 of 88 remaining) [2024-11-19 05:56:46,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (58 of 88 remaining) [2024-11-19 05:56:46,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (57 of 88 remaining) [2024-11-19 05:56:46,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (56 of 88 remaining) [2024-11-19 05:56:46,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (55 of 88 remaining) [2024-11-19 05:56:46,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (54 of 88 remaining) [2024-11-19 05:56:46,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (53 of 88 remaining) [2024-11-19 05:56:46,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (52 of 88 remaining) [2024-11-19 05:56:46,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (51 of 88 remaining) [2024-11-19 05:56:46,663 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (50 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (47 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (46 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (44 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (43 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (42 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (41 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (40 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (39 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (38 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (37 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (36 of 88 remaining) [2024-11-19 05:56:46,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (35 of 88 remaining) [2024-11-19 05:56:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (34 of 88 remaining) [2024-11-19 05:56:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (33 of 88 remaining) [2024-11-19 05:56:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (32 of 88 remaining) [2024-11-19 05:56:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (31 of 88 remaining) [2024-11-19 05:56:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (30 of 88 remaining) [2024-11-19 05:56:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (29 of 88 remaining) [2024-11-19 05:56:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 88 remaining) [2024-11-19 05:56:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (27 of 88 remaining) [2024-11-19 05:56:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (26 of 88 remaining) [2024-11-19 05:56:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (25 of 88 remaining) [2024-11-19 05:56:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (24 of 88 remaining) [2024-11-19 05:56:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (23 of 88 remaining) [2024-11-19 05:56:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 88 remaining) [2024-11-19 05:56:46,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (21 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (19 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (18 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (17 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (16 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (15 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (14 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (13 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (12 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (11 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (10 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (9 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (8 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (7 of 88 remaining) [2024-11-19 05:56:46,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (6 of 88 remaining) [2024-11-19 05:56:46,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (5 of 88 remaining) [2024-11-19 05:56:46,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (4 of 88 remaining) [2024-11-19 05:56:46,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (3 of 88 remaining) [2024-11-19 05:56:46,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (2 of 88 remaining) [2024-11-19 05:56:46,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (1 of 88 remaining) [2024-11-19 05:56:46,667 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (0 of 88 remaining) [2024-11-19 05:56:46,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:56:46,668 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:56:46,675 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:56:46,676 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:56:46,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:56:46 BasicIcfg [2024-11-19 05:56:46,684 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:56:46,685 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:56:46,685 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:56:46,685 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:56:46,685 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:56:17" (3/4) ... [2024-11-19 05:56:46,687 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:56:46,690 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:56:46,690 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:56:46,690 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 05:56:46,691 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-19 05:56:46,691 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2024-11-19 05:56:46,691 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2024-11-19 05:56:46,699 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-19 05:56:46,699 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-19 05:56:46,699 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 05:56:46,700 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:56:46,808 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:56:46,808 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:56:46,808 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:56:46,809 INFO L158 Benchmark]: Toolchain (without parser) took 30789.91ms. Allocated memory was 157.3MB in the beginning and 13.2GB in the end (delta: 13.1GB). Free memory was 101.5MB in the beginning and 11.5GB in the end (delta: -11.4GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-11-19 05:56:46,809 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 96.5MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:56:46,809 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.74ms. Allocated memory is still 157.3MB. Free memory was 101.1MB in the beginning and 124.9MB in the end (delta: -23.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-19 05:56:46,809 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.07ms. Allocated memory is still 157.3MB. Free memory was 124.9MB in the beginning and 122.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:56:46,810 INFO L158 Benchmark]: Boogie Preprocessor took 38.51ms. Allocated memory is still 157.3MB. Free memory was 122.8MB in the beginning and 120.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 05:56:46,810 INFO L158 Benchmark]: RCFGBuilder took 766.12ms. Allocated memory is still 157.3MB. Free memory was 120.9MB in the beginning and 94.3MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-19 05:56:46,813 INFO L158 Benchmark]: TraceAbstraction took 29386.77ms. Allocated memory was 157.3MB in the beginning and 13.2GB in the end (delta: 13.1GB). Free memory was 93.7MB in the beginning and 11.5GB in the end (delta: -11.4GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2024-11-19 05:56:46,813 INFO L158 Benchmark]: Witness Printer took 123.93ms. Allocated memory is still 13.2GB. Free memory was 11.5GB in the beginning and 11.5GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 05:56:46,814 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.11ms. Allocated memory is still 96.5MB. Free memory is still 51.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.74ms. Allocated memory is still 157.3MB. Free memory was 101.1MB in the beginning and 124.9MB in the end (delta: -23.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.07ms. Allocated memory is still 157.3MB. Free memory was 124.9MB in the beginning and 122.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.51ms. Allocated memory is still 157.3MB. Free memory was 122.8MB in the beginning and 120.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 766.12ms. Allocated memory is still 157.3MB. Free memory was 120.9MB in the beginning and 94.3MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 29386.77ms. Allocated memory was 157.3MB in the beginning and 13.2GB in the end (delta: 13.1GB). Free memory was 93.7MB in the beginning and 11.5GB in the end (delta: -11.4GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 123.93ms. Allocated memory is still 13.2GB. Free memory was 11.5GB in the beginning and 11.5GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: 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: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: 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: 79]: 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 13 procedures, 497 locations, 88 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: 29.2s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1010 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 358 mSDsluCounter, 202 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1170 IncrementalHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 202 mSDtfsCounter, 1170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=728occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1679 NumberOfCodeBlocks, 1679 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1659 ConstructedInterpolants, 0 QuantifiedInterpolants, 1699 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 52 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:56:46,849 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