./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:13:25,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:13:25,588 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:13:25,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:13:25,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:13:25,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:13:25,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:13:25,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:13:25,624 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:13:25,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:13:25,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:13:25,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:13:25,629 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:13:25,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:13:25,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:13:25,629 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:13:25,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:13:25,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:13:25,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:13:25,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:13:25,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:13:25,632 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:13:25,632 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:13:25,632 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:13:25,633 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:13:25,634 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:13:25,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:13:25,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:13:25,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:13:25,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:13:25,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:13:25,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:25,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:13:25,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:13:25,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:13:25,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:13:25,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:13:25,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:13:25,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:13:25,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:13:25,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:13:25,639 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a [2024-10-11 17:13:25,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:13:25,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:13:25,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:13:25,937 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:13:25,938 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:13:25,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2024-10-11 17:13:27,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:13:27,530 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:13:27,531 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2024-10-11 17:13:27,538 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3784a0650/bfce26ae428f4979afc00666cab6a2d9/FLAG0e2968f38 [2024-10-11 17:13:27,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3784a0650/bfce26ae428f4979afc00666cab6a2d9 [2024-10-11 17:13:27,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:13:27,556 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:13:27,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:27,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:13:27,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:13:27,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:27" (1/1) ... [2024-10-11 17:13:27,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3adca133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:27, skipping insertion in model container [2024-10-11 17:13:27,567 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:13:27" (1/1) ... [2024-10-11 17:13:27,587 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:13:27,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:27,814 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:13:27,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:13:27,860 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:13:27,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:27 WrapperNode [2024-10-11 17:13:27,860 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:13:27,861 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:27,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:13:27,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:13:27,869 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:27" (1/1) ... [2024-10-11 17:13:27,882 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:27" (1/1) ... [2024-10-11 17:13:27,913 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 277 [2024-10-11 17:13:27,913 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:13:27,914 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:13:27,914 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:13:27,914 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:13:27,927 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:27" (1/1) ... [2024-10-11 17:13:27,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:27" (1/1) ... [2024-10-11 17:13:27,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:27" (1/1) ... [2024-10-11 17:13:27,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:27" (1/1) ... [2024-10-11 17:13:27,968 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:27" (1/1) ... [2024-10-11 17:13:27,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:27" (1/1) ... [2024-10-11 17:13:27,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:27" (1/1) ... [2024-10-11 17:13:27,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:27" (1/1) ... [2024-10-11 17:13:27,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:13:27,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:13:27,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:13:27,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:13:27,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:27" (1/1) ... [2024-10-11 17:13:28,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:13:28,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:13:28,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:13:28,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:13:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:13:28,082 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:13:28,083 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:13:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:13:28,083 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:13:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:13:28,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:13:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:13:28,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:13:28,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:13:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:13:28,086 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:13:28,201 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:13:28,203 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:13:28,771 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:13:28,771 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:13:28,797 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:13:28,797 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 17:13:28,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:28 BoogieIcfgContainer [2024-10-11 17:13:28,798 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:13:28,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:13:28,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:13:28,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:13:28,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:13:27" (1/3) ... [2024-10-11 17:13:28,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a43f5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:28, skipping insertion in model container [2024-10-11 17:13:28,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:13:27" (2/3) ... [2024-10-11 17:13:28,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a43f5d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:13:28, skipping insertion in model container [2024-10-11 17:13:28,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:28" (3/3) ... [2024-10-11 17:13:28,809 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2024-10-11 17:13:28,824 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:13:28,825 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-10-11 17:13:28,826 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:13:28,941 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 17:13:28,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 346 transitions, 706 flow [2024-10-11 17:13:29,128 INFO L124 PetriNetUnfolderBase]: 19/344 cut-off events. [2024-10-11 17:13:29,131 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:13:29,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 344 events. 19/344 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 657 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 236. Up to 3 conditions per place. [2024-10-11 17:13:29,146 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 346 transitions, 706 flow [2024-10-11 17:13:29,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 316 places, 327 transitions, 666 flow [2024-10-11 17:13:29,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:13:29,178 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;@1a4e1539, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:13:29,179 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-10-11 17:13:29,193 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:13:29,194 INFO L124 PetriNetUnfolderBase]: 3/59 cut-off events. [2024-10-11 17:13:29,194 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:13:29,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:29,195 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] [2024-10-11 17:13:29,196 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:29,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:29,201 INFO L85 PathProgramCache]: Analyzing trace with hash 7340901, now seen corresponding path program 1 times [2024-10-11 17:13:29,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:29,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891120613] [2024-10-11 17:13:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:30,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:30,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891120613] [2024-10-11 17:13:30,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891120613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:30,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:30,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:30,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391001984] [2024-10-11 17:13:30,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:30,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:30,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:30,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:30,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:30,511 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 346 [2024-10-11 17:13:30,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 327 transitions, 666 flow. Second operand has 6 states, 6 states have (on average 271.5) internal successors, (1629), 6 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:30,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:30,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 346 [2024-10-11 17:13:30,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:31,047 INFO L124 PetriNetUnfolderBase]: 424/2283 cut-off events. [2024-10-11 17:13:31,048 INFO L125 PetriNetUnfolderBase]: For 157/158 co-relation queries the response was YES. [2024-10-11 17:13:31,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3088 conditions, 2283 events. 424/2283 cut-off events. For 157/158 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 16082 event pairs, 288 based on Foata normal form. 100/1987 useless extension candidates. Maximal degree in co-relation 2685. Up to 709 conditions per place. [2024-10-11 17:13:31,069 INFO L140 encePairwiseOnDemand]: 324/346 looper letters, 52 selfloop transitions, 10 changer transitions 4/315 dead transitions. [2024-10-11 17:13:31,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 315 transitions, 766 flow [2024-10-11 17:13:31,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:31,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1694 transitions. [2024-10-11 17:13:31,093 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8159922928709056 [2024-10-11 17:13:31,095 INFO L175 Difference]: Start difference. First operand has 316 places, 327 transitions, 666 flow. Second operand 6 states and 1694 transitions. [2024-10-11 17:13:31,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 315 transitions, 766 flow [2024-10-11 17:13:31,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 315 transitions, 758 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-11 17:13:31,111 INFO L231 Difference]: Finished difference. Result has 315 places, 311 transitions, 646 flow [2024-10-11 17:13:31,114 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=646, PETRI_PLACES=315, PETRI_TRANSITIONS=311} [2024-10-11 17:13:31,119 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, -1 predicate places. [2024-10-11 17:13:31,119 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 311 transitions, 646 flow [2024-10-11 17:13:31,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 271.5) internal successors, (1629), 6 states have internal predecessors, (1629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:31,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:31,121 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:31,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:13:31,122 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:31,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:31,122 INFO L85 PathProgramCache]: Analyzing trace with hash -668924992, now seen corresponding path program 1 times [2024-10-11 17:13:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:31,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155677263] [2024-10-11 17:13:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:31,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:31,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:31,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155677263] [2024-10-11 17:13:31,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155677263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:31,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:31,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:31,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180222078] [2024-10-11 17:13:31,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:31,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:31,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:31,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:31,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 346 [2024-10-11 17:13:31,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 311 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:31,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:31,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 346 [2024-10-11 17:13:31,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:31,358 INFO L124 PetriNetUnfolderBase]: 22/488 cut-off events. [2024-10-11 17:13:31,358 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-11 17:13:31,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 488 events. 22/488 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1546 event pairs, 8 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 501. Up to 28 conditions per place. [2024-10-11 17:13:31,361 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 11 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2024-10-11 17:13:31,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 310 transitions, 670 flow [2024-10-11 17:13:31,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2024-10-11 17:13:31,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9354527938342967 [2024-10-11 17:13:31,365 INFO L175 Difference]: Start difference. First operand has 315 places, 311 transitions, 646 flow. Second operand 3 states and 971 transitions. [2024-10-11 17:13:31,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 310 transitions, 670 flow [2024-10-11 17:13:31,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 310 transitions, 650 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:31,374 INFO L231 Difference]: Finished difference. Result has 307 places, 310 transitions, 628 flow [2024-10-11 17:13:31,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=307, PETRI_TRANSITIONS=310} [2024-10-11 17:13:31,376 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, -9 predicate places. [2024-10-11 17:13:31,376 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 310 transitions, 628 flow [2024-10-11 17:13:31,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:31,377 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:31,377 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:31,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:13:31,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:31,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:31,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2033357872, now seen corresponding path program 1 times [2024-10-11 17:13:31,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:31,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172913756] [2024-10-11 17:13:31,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:31,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:31,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:31,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172913756] [2024-10-11 17:13:31,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172913756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:31,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:31,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:31,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61684333] [2024-10-11 17:13:31,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:31,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:31,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:31,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:31,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:31,479 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 346 [2024-10-11 17:13:31,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 310 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:31,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:31,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 346 [2024-10-11 17:13:31,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:31,549 INFO L124 PetriNetUnfolderBase]: 22/487 cut-off events. [2024-10-11 17:13:31,549 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-11 17:13:31,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 487 events. 22/487 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1433 event pairs, 8 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 456. Up to 28 conditions per place. [2024-10-11 17:13:31,553 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 11 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2024-10-11 17:13:31,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 309 transitions, 652 flow [2024-10-11 17:13:31,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:31,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2024-10-11 17:13:31,557 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9354527938342967 [2024-10-11 17:13:31,557 INFO L175 Difference]: Start difference. First operand has 307 places, 310 transitions, 628 flow. Second operand 3 states and 971 transitions. [2024-10-11 17:13:31,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 309 transitions, 652 flow [2024-10-11 17:13:31,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 309 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:31,562 INFO L231 Difference]: Finished difference. Result has 306 places, 309 transitions, 626 flow [2024-10-11 17:13:31,563 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=306, PETRI_TRANSITIONS=309} [2024-10-11 17:13:31,564 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, -10 predicate places. [2024-10-11 17:13:31,564 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 309 transitions, 626 flow [2024-10-11 17:13:31,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:31,566 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:31,566 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-10-11 17:13:31,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:13:31,566 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:31,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash -443523946, now seen corresponding path program 1 times [2024-10-11 17:13:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:31,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497283940] [2024-10-11 17:13:31,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:31,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:31,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:31,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497283940] [2024-10-11 17:13:31,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497283940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:31,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:31,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:31,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110937609] [2024-10-11 17:13:31,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:31,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:31,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:31,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:31,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:31,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 346 [2024-10-11 17:13:31,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 309 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:31,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:31,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 346 [2024-10-11 17:13:31,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:31,730 INFO L124 PetriNetUnfolderBase]: 17/468 cut-off events. [2024-10-11 17:13:31,731 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 17:13:31,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 468 events. 17/468 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1428 event pairs, 3 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 377. Up to 16 conditions per place. [2024-10-11 17:13:31,734 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 9 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2024-10-11 17:13:31,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 308 transitions, 646 flow [2024-10-11 17:13:31,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2024-10-11 17:13:31,737 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9393063583815029 [2024-10-11 17:13:31,737 INFO L175 Difference]: Start difference. First operand has 306 places, 309 transitions, 626 flow. Second operand 3 states and 975 transitions. [2024-10-11 17:13:31,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 308 transitions, 646 flow [2024-10-11 17:13:31,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 308 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:31,743 INFO L231 Difference]: Finished difference. Result has 305 places, 308 transitions, 624 flow [2024-10-11 17:13:31,743 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=305, PETRI_TRANSITIONS=308} [2024-10-11 17:13:31,744 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, -11 predicate places. [2024-10-11 17:13:31,744 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 308 transitions, 624 flow [2024-10-11 17:13:31,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:31,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:31,745 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] [2024-10-11 17:13:31,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:13:31,746 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:31,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:31,748 INFO L85 PathProgramCache]: Analyzing trace with hash -754061302, now seen corresponding path program 1 times [2024-10-11 17:13:31,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:31,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133613071] [2024-10-11 17:13:31,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:31,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:31,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:31,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133613071] [2024-10-11 17:13:31,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133613071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:31,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:31,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:31,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084041251] [2024-10-11 17:13:31,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:31,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:31,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:31,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:31,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:31,816 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 346 [2024-10-11 17:13:31,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 308 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:31,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:31,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 346 [2024-10-11 17:13:31,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:31,864 INFO L124 PetriNetUnfolderBase]: 14/395 cut-off events. [2024-10-11 17:13:31,864 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-11 17:13:31,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 395 events. 14/395 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 963 event pairs, 3 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 296. Up to 16 conditions per place. [2024-10-11 17:13:31,867 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 9 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2024-10-11 17:13:31,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 307 transitions, 644 flow [2024-10-11 17:13:31,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2024-10-11 17:13:31,870 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9393063583815029 [2024-10-11 17:13:31,870 INFO L175 Difference]: Start difference. First operand has 305 places, 308 transitions, 624 flow. Second operand 3 states and 975 transitions. [2024-10-11 17:13:31,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 307 transitions, 644 flow [2024-10-11 17:13:31,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 307 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:31,875 INFO L231 Difference]: Finished difference. Result has 304 places, 307 transitions, 622 flow [2024-10-11 17:13:31,875 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=304, PETRI_TRANSITIONS=307} [2024-10-11 17:13:31,876 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, -12 predicate places. [2024-10-11 17:13:31,876 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 307 transitions, 622 flow [2024-10-11 17:13:31,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:31,877 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:31,877 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] [2024-10-11 17:13:31,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:13:31,878 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:31,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:31,878 INFO L85 PathProgramCache]: Analyzing trace with hash 470308048, now seen corresponding path program 1 times [2024-10-11 17:13:31,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:31,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797819036] [2024-10-11 17:13:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:31,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:31,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:31,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:31,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797819036] [2024-10-11 17:13:31,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797819036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:31,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:31,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:31,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451878557] [2024-10-11 17:13:31,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:31,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:31,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:31,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:31,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:31,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 346 [2024-10-11 17:13:31,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 307 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:31,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:31,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 346 [2024-10-11 17:13:31,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:32,032 INFO L124 PetriNetUnfolderBase]: 31/684 cut-off events. [2024-10-11 17:13:32,032 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-11 17:13:32,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 684 events. 31/684 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2991 event pairs, 5 based on Foata normal form. 0/585 useless extension candidates. Maximal degree in co-relation 589. Up to 25 conditions per place. [2024-10-11 17:13:32,037 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 10 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2024-10-11 17:13:32,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 308 transitions, 649 flow [2024-10-11 17:13:32,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2024-10-11 17:13:32,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9470134874759152 [2024-10-11 17:13:32,040 INFO L175 Difference]: Start difference. First operand has 304 places, 307 transitions, 622 flow. Second operand 3 states and 983 transitions. [2024-10-11 17:13:32,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 308 transitions, 649 flow [2024-10-11 17:13:32,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 308 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:32,048 INFO L231 Difference]: Finished difference. Result has 303 places, 307 transitions, 628 flow [2024-10-11 17:13:32,049 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=303, PETRI_TRANSITIONS=307} [2024-10-11 17:13:32,049 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, -13 predicate places. [2024-10-11 17:13:32,050 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 307 transitions, 628 flow [2024-10-11 17:13:32,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:32,050 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:32,051 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] [2024-10-11 17:13:32,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:13:32,051 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:32,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:32,052 INFO L85 PathProgramCache]: Analyzing trace with hash -183197735, now seen corresponding path program 1 times [2024-10-11 17:13:32,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:32,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620952152] [2024-10-11 17:13:32,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:32,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:32,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:32,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620952152] [2024-10-11 17:13:32,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620952152] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:32,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:32,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:32,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307814961] [2024-10-11 17:13:32,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:32,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:32,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:32,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:32,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:32,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 346 [2024-10-11 17:13:32,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 307 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:32,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:32,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 346 [2024-10-11 17:13:32,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:32,203 INFO L124 PetriNetUnfolderBase]: 32/662 cut-off events. [2024-10-11 17:13:32,203 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-10-11 17:13:32,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 662 events. 32/662 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3070 event pairs, 3 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 492. Up to 26 conditions per place. [2024-10-11 17:13:32,208 INFO L140 encePairwiseOnDemand]: 342/346 looper letters, 10 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2024-10-11 17:13:32,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 308 transitions, 655 flow [2024-10-11 17:13:32,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2024-10-11 17:13:32,211 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9470134874759152 [2024-10-11 17:13:32,212 INFO L175 Difference]: Start difference. First operand has 303 places, 307 transitions, 628 flow. Second operand 3 states and 983 transitions. [2024-10-11 17:13:32,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 308 transitions, 655 flow [2024-10-11 17:13:32,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 308 transitions, 655 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:32,218 INFO L231 Difference]: Finished difference. Result has 304 places, 307 transitions, 638 flow [2024-10-11 17:13:32,218 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=304, PETRI_TRANSITIONS=307} [2024-10-11 17:13:32,219 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, -12 predicate places. [2024-10-11 17:13:32,219 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 307 transitions, 638 flow [2024-10-11 17:13:32,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:32,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:32,220 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] [2024-10-11 17:13:32,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:13:32,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:32,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:32,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1149627104, now seen corresponding path program 1 times [2024-10-11 17:13:32,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:32,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997186230] [2024-10-11 17:13:32,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:32,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:32,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:32,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:32,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997186230] [2024-10-11 17:13:32,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997186230] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:32,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:32,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:32,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737695254] [2024-10-11 17:13:32,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:32,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:32,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:32,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:32,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:32,298 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 346 [2024-10-11 17:13:32,299 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 307 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:32,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:32,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 346 [2024-10-11 17:13:32,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:32,438 INFO L124 PetriNetUnfolderBase]: 80/1050 cut-off events. [2024-10-11 17:13:32,438 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-10-11 17:13:32,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 1050 events. 80/1050 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5529 event pairs, 12 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 950. Up to 94 conditions per place. [2024-10-11 17:13:32,444 INFO L140 encePairwiseOnDemand]: 340/346 looper letters, 16 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2024-10-11 17:13:32,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 308 transitions, 679 flow [2024-10-11 17:13:32,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:32,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2024-10-11 17:13:32,447 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373795761078998 [2024-10-11 17:13:32,447 INFO L175 Difference]: Start difference. First operand has 304 places, 307 transitions, 638 flow. Second operand 3 states and 973 transitions. [2024-10-11 17:13:32,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 308 transitions, 679 flow [2024-10-11 17:13:32,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 308 transitions, 679 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:32,452 INFO L231 Difference]: Finished difference. Result has 303 places, 305 transitions, 644 flow [2024-10-11 17:13:32,452 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=303, PETRI_TRANSITIONS=305} [2024-10-11 17:13:32,453 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, -13 predicate places. [2024-10-11 17:13:32,453 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 305 transitions, 644 flow [2024-10-11 17:13:32,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:32,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:32,455 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] [2024-10-11 17:13:32,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:13:32,456 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:32,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:32,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1187443434, now seen corresponding path program 1 times [2024-10-11 17:13:32,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:32,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139803623] [2024-10-11 17:13:32,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:32,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:32,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:32,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139803623] [2024-10-11 17:13:32,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139803623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:32,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:32,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:32,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513685311] [2024-10-11 17:13:32,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:32,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:32,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:32,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:32,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:32,534 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 346 [2024-10-11 17:13:32,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 305 transitions, 644 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:32,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:32,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 346 [2024-10-11 17:13:32,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:32,654 INFO L124 PetriNetUnfolderBase]: 87/1086 cut-off events. [2024-10-11 17:13:32,654 INFO L125 PetriNetUnfolderBase]: For 17/22 co-relation queries the response was YES. [2024-10-11 17:13:32,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1255 conditions, 1086 events. 87/1086 cut-off events. For 17/22 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6024 event pairs, 13 based on Foata normal form. 0/961 useless extension candidates. Maximal degree in co-relation 1016. Up to 100 conditions per place. [2024-10-11 17:13:32,663 INFO L140 encePairwiseOnDemand]: 340/346 looper letters, 16 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2024-10-11 17:13:32,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 306 transitions, 685 flow [2024-10-11 17:13:32,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2024-10-11 17:13:32,666 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9373795761078998 [2024-10-11 17:13:32,666 INFO L175 Difference]: Start difference. First operand has 303 places, 305 transitions, 644 flow. Second operand 3 states and 973 transitions. [2024-10-11 17:13:32,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 306 transitions, 685 flow [2024-10-11 17:13:32,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 306 transitions, 685 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:32,671 INFO L231 Difference]: Finished difference. Result has 302 places, 303 transitions, 650 flow [2024-10-11 17:13:32,672 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=302, PETRI_TRANSITIONS=303} [2024-10-11 17:13:32,672 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, -14 predicate places. [2024-10-11 17:13:32,673 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 303 transitions, 650 flow [2024-10-11 17:13:32,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:32,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:32,675 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] [2024-10-11 17:13:32,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:13:32,675 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:32,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:32,676 INFO L85 PathProgramCache]: Analyzing trace with hash -399798556, now seen corresponding path program 1 times [2024-10-11 17:13:32,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:32,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809767802] [2024-10-11 17:13:32,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:32,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:13:32,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:32,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809767802] [2024-10-11 17:13:32,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809767802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:32,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:32,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:32,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441787033] [2024-10-11 17:13:32,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:32,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:13:32,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:32,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:13:32,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:13:32,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 346 [2024-10-11 17:13:32,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 303 transitions, 650 flow. Second operand has 5 states, 5 states have (on average 315.4) internal successors, (1577), 5 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:32,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:32,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 346 [2024-10-11 17:13:32,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:33,021 INFO L124 PetriNetUnfolderBase]: 31/653 cut-off events. [2024-10-11 17:13:33,022 INFO L125 PetriNetUnfolderBase]: For 6/9 co-relation queries the response was YES. [2024-10-11 17:13:33,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 746 conditions, 653 events. 31/653 cut-off events. For 6/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2641 event pairs, 0 based on Foata normal form. 2/594 useless extension candidates. Maximal degree in co-relation 524. Up to 14 conditions per place. [2024-10-11 17:13:33,026 INFO L140 encePairwiseOnDemand]: 332/346 looper letters, 12 selfloop transitions, 12 changer transitions 0/305 dead transitions. [2024-10-11 17:13:33,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 305 transitions, 702 flow [2024-10-11 17:13:33,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:13:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 17:13:33,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1586 transitions. [2024-10-11 17:13:33,030 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9167630057803469 [2024-10-11 17:13:33,030 INFO L175 Difference]: Start difference. First operand has 302 places, 303 transitions, 650 flow. Second operand 5 states and 1586 transitions. [2024-10-11 17:13:33,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 305 transitions, 702 flow [2024-10-11 17:13:33,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 305 transitions, 702 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:33,035 INFO L231 Difference]: Finished difference. Result has 307 places, 305 transitions, 690 flow [2024-10-11 17:13:33,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=690, PETRI_PLACES=307, PETRI_TRANSITIONS=305} [2024-10-11 17:13:33,036 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, -9 predicate places. [2024-10-11 17:13:33,037 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 305 transitions, 690 flow [2024-10-11 17:13:33,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 315.4) internal successors, (1577), 5 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:33,039 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:33,039 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:33,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:13:33,039 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:33,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1534637709, now seen corresponding path program 1 times [2024-10-11 17:13:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:33,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551249627] [2024-10-11 17:13:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:33,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:33,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:13:33,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551249627] [2024-10-11 17:13:33,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551249627] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:13:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754618551] [2024-10-11 17:13:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:33,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:13:33,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:13:33,214 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:13:33,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:13:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:33,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 17:13:33,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:13:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:13:33,530 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:13:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:13:33,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754618551] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:13:33,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:13:33,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2024-10-11 17:13:33,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738942490] [2024-10-11 17:13:33,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:13:33,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 17:13:33,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:33,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 17:13:33,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:13:34,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 346 [2024-10-11 17:13:34,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 305 transitions, 690 flow. Second operand has 15 states, 15 states have (on average 308.6666666666667) internal successors, (4630), 15 states have internal predecessors, (4630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:34,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:34,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 346 [2024-10-11 17:13:34,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:34,337 INFO L124 PetriNetUnfolderBase]: 31/687 cut-off events. [2024-10-11 17:13:34,338 INFO L125 PetriNetUnfolderBase]: For 16/19 co-relation queries the response was YES. [2024-10-11 17:13:34,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 687 events. 31/687 cut-off events. For 16/19 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2591 event pairs, 0 based on Foata normal form. 4/630 useless extension candidates. Maximal degree in co-relation 598. Up to 14 conditions per place. [2024-10-11 17:13:34,342 INFO L140 encePairwiseOnDemand]: 326/346 looper letters, 20 selfloop transitions, 26 changer transitions 0/321 dead transitions. [2024-10-11 17:13:34,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 321 transitions, 818 flow [2024-10-11 17:13:34,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:13:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-11 17:13:34,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3416 transitions. [2024-10-11 17:13:34,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8975302154492906 [2024-10-11 17:13:34,350 INFO L175 Difference]: Start difference. First operand has 307 places, 305 transitions, 690 flow. Second operand 11 states and 3416 transitions. [2024-10-11 17:13:34,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 321 transitions, 818 flow [2024-10-11 17:13:34,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 321 transitions, 798 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 17:13:34,359 INFO L231 Difference]: Finished difference. Result has 317 places, 317 transitions, 790 flow [2024-10-11 17:13:34,360 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=790, PETRI_PLACES=317, PETRI_TRANSITIONS=317} [2024-10-11 17:13:34,361 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places. [2024-10-11 17:13:34,361 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 317 transitions, 790 flow [2024-10-11 17:13:34,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 308.6666666666667) internal successors, (4630), 15 states have internal predecessors, (4630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:34,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:34,365 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:34,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 17:13:34,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 17:13:34,567 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:34,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:34,567 INFO L85 PathProgramCache]: Analyzing trace with hash 755201325, now seen corresponding path program 2 times [2024-10-11 17:13:34,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:34,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060216816] [2024-10-11 17:13:34,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:34,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:34,901 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 17:13:34,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:34,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060216816] [2024-10-11 17:13:34,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060216816] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:13:34,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183235233] [2024-10-11 17:13:34,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:13:34,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:13:34,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:13:34,905 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:13:34,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:13:35,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 17:13:35,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:13:35,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 17:13:35,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:13:35,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 17:13:35,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2024-10-11 17:13:35,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:13:35,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2024-10-11 17:13:35,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:13:35,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2024-10-11 17:13:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-10-11 17:13:35,228 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:13:35,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183235233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:35,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:13:35,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-11 17:13:35,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610136161] [2024-10-11 17:13:35,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:35,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:35,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:35,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:35,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-10-11 17:13:35,743 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 346 [2024-10-11 17:13:35,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 317 transitions, 790 flow. Second operand has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:35,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:35,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 346 [2024-10-11 17:13:35,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:35,911 INFO L124 PetriNetUnfolderBase]: 48/801 cut-off events. [2024-10-11 17:13:35,911 INFO L125 PetriNetUnfolderBase]: For 21/22 co-relation queries the response was YES. [2024-10-11 17:13:35,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 801 events. 48/801 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3579 event pairs, 2 based on Foata normal form. 0/738 useless extension candidates. Maximal degree in co-relation 821. Up to 48 conditions per place. [2024-10-11 17:13:35,916 INFO L140 encePairwiseOnDemand]: 339/346 looper letters, 27 selfloop transitions, 5 changer transitions 0/321 dead transitions. [2024-10-11 17:13:35,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 321 transitions, 868 flow [2024-10-11 17:13:35,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:35,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1870 transitions. [2024-10-11 17:13:35,922 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9007707129094412 [2024-10-11 17:13:35,922 INFO L175 Difference]: Start difference. First operand has 317 places, 317 transitions, 790 flow. Second operand 6 states and 1870 transitions. [2024-10-11 17:13:35,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 321 transitions, 868 flow [2024-10-11 17:13:35,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 321 transitions, 844 flow, removed 4 selfloop flow, removed 3 redundant places. [2024-10-11 17:13:35,930 INFO L231 Difference]: Finished difference. Result has 317 places, 315 transitions, 772 flow [2024-10-11 17:13:35,930 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=772, PETRI_PLACES=317, PETRI_TRANSITIONS=315} [2024-10-11 17:13:35,932 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places. [2024-10-11 17:13:35,932 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 315 transitions, 772 flow [2024-10-11 17:13:35,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:35,934 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:35,935 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:35,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:13:36,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:13:36,136 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:36,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:36,137 INFO L85 PathProgramCache]: Analyzing trace with hash -769749033, now seen corresponding path program 1 times [2024-10-11 17:13:36,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:36,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326713156] [2024-10-11 17:13:36,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:36,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:36,475 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 17:13:36,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:36,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326713156] [2024-10-11 17:13:36,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326713156] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:13:36,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396647446] [2024-10-11 17:13:36,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:36,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:13:36,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:13:36,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:13:36,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:13:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:36,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 17:13:36,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:13:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 17:13:36,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:13:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-11 17:13:37,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396647446] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:13:37,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:13:37,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2024-10-11 17:13:37,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586040452] [2024-10-11 17:13:37,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:13:37,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 17:13:37,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:37,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 17:13:37,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2024-10-11 17:13:37,612 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 346 [2024-10-11 17:13:37,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 315 transitions, 772 flow. Second operand has 22 states, 22 states have (on average 308.59090909090907) internal successors, (6789), 22 states have internal predecessors, (6789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:37,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:37,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 346 [2024-10-11 17:13:37,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:38,041 INFO L124 PetriNetUnfolderBase]: 29/755 cut-off events. [2024-10-11 17:13:38,042 INFO L125 PetriNetUnfolderBase]: For 45/49 co-relation queries the response was YES. [2024-10-11 17:13:38,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 991 conditions, 755 events. 29/755 cut-off events. For 45/49 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2697 event pairs, 0 based on Foata normal form. 4/705 useless extension candidates. Maximal degree in co-relation 706. Up to 19 conditions per place. [2024-10-11 17:13:38,045 INFO L140 encePairwiseOnDemand]: 326/346 looper letters, 24 selfloop transitions, 38 changer transitions 0/335 dead transitions. [2024-10-11 17:13:38,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 335 transitions, 992 flow [2024-10-11 17:13:38,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 17:13:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-10-11 17:13:38,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5268 transitions. [2024-10-11 17:13:38,055 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8956137368242094 [2024-10-11 17:13:38,055 INFO L175 Difference]: Start difference. First operand has 317 places, 315 transitions, 772 flow. Second operand 17 states and 5268 transitions. [2024-10-11 17:13:38,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 335 transitions, 992 flow [2024-10-11 17:13:38,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 335 transitions, 982 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:38,062 INFO L231 Difference]: Finished difference. Result has 331 places, 329 transitions, 946 flow [2024-10-11 17:13:38,062 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=946, PETRI_PLACES=331, PETRI_TRANSITIONS=329} [2024-10-11 17:13:38,063 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, 15 predicate places. [2024-10-11 17:13:38,063 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 329 transitions, 946 flow [2024-10-11 17:13:38,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 308.59090909090907) internal successors, (6789), 22 states have internal predecessors, (6789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:38,066 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:38,066 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:38,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 17:13:38,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:13:38,267 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:38,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:38,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2001904009, now seen corresponding path program 2 times [2024-10-11 17:13:38,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:38,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686574801] [2024-10-11 17:13:38,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:38,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-10-11 17:13:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:39,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686574801] [2024-10-11 17:13:39,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686574801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:39,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:39,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029251706] [2024-10-11 17:13:39,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:39,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:39,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:39,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:39,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:39,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 346 [2024-10-11 17:13:39,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 329 transitions, 946 flow. Second operand has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:39,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:39,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 346 [2024-10-11 17:13:39,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:39,769 INFO L124 PetriNetUnfolderBase]: 61/838 cut-off events. [2024-10-11 17:13:39,769 INFO L125 PetriNetUnfolderBase]: For 87/89 co-relation queries the response was YES. [2024-10-11 17:13:39,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 838 events. 61/838 cut-off events. For 87/89 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3595 event pairs, 3 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 781. Up to 64 conditions per place. [2024-10-11 17:13:39,775 INFO L140 encePairwiseOnDemand]: 339/346 looper letters, 26 selfloop transitions, 5 changer transitions 0/332 dead transitions. [2024-10-11 17:13:39,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 332 transitions, 1019 flow [2024-10-11 17:13:39,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1869 transitions. [2024-10-11 17:13:39,779 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9002890173410405 [2024-10-11 17:13:39,779 INFO L175 Difference]: Start difference. First operand has 331 places, 329 transitions, 946 flow. Second operand 6 states and 1869 transitions. [2024-10-11 17:13:39,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 332 transitions, 1019 flow [2024-10-11 17:13:39,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 332 transitions, 967 flow, removed 8 selfloop flow, removed 8 redundant places. [2024-10-11 17:13:39,786 INFO L231 Difference]: Finished difference. Result has 326 places, 327 transitions, 900 flow [2024-10-11 17:13:39,787 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=900, PETRI_PLACES=326, PETRI_TRANSITIONS=327} [2024-10-11 17:13:39,788 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, 10 predicate places. [2024-10-11 17:13:39,788 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 327 transitions, 900 flow [2024-10-11 17:13:39,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:39,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:39,789 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:39,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:13:39,789 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:39,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:39,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1873922803, now seen corresponding path program 1 times [2024-10-11 17:13:39,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:39,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762382598] [2024-10-11 17:13:39,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:39,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-10-11 17:13:40,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:40,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762382598] [2024-10-11 17:13:40,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762382598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:40,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:40,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:40,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047130211] [2024-10-11 17:13:40,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:40,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:40,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:40,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:40,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:40,937 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 346 [2024-10-11 17:13:40,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 327 transitions, 900 flow. Second operand has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:40,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:40,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 346 [2024-10-11 17:13:40,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:41,109 INFO L124 PetriNetUnfolderBase]: 41/860 cut-off events. [2024-10-11 17:13:41,109 INFO L125 PetriNetUnfolderBase]: For 66/68 co-relation queries the response was YES. [2024-10-11 17:13:41,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 860 events. 41/860 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3520 event pairs, 2 based on Foata normal form. 0/808 useless extension candidates. Maximal degree in co-relation 925. Up to 64 conditions per place. [2024-10-11 17:13:41,115 INFO L140 encePairwiseOnDemand]: 339/346 looper letters, 27 selfloop transitions, 5 changer transitions 0/331 dead transitions. [2024-10-11 17:13:41,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 331 transitions, 978 flow [2024-10-11 17:13:41,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:41,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1870 transitions. [2024-10-11 17:13:41,119 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9007707129094412 [2024-10-11 17:13:41,119 INFO L175 Difference]: Start difference. First operand has 326 places, 327 transitions, 900 flow. Second operand 6 states and 1870 transitions. [2024-10-11 17:13:41,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 331 transitions, 978 flow [2024-10-11 17:13:41,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 331 transitions, 968 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:41,127 INFO L231 Difference]: Finished difference. Result has 324 places, 325 transitions, 896 flow [2024-10-11 17:13:41,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=896, PETRI_PLACES=324, PETRI_TRANSITIONS=325} [2024-10-11 17:13:41,128 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, 8 predicate places. [2024-10-11 17:13:41,128 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 325 transitions, 896 flow [2024-10-11 17:13:41,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:41,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:41,129 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:41,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:13:41,130 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:41,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:41,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1343667485, now seen corresponding path program 1 times [2024-10-11 17:13:41,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:41,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509921051] [2024-10-11 17:13:41,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:41,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-10-11 17:13:41,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:41,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509921051] [2024-10-11 17:13:41,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509921051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:41,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:41,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:13:41,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301272551] [2024-10-11 17:13:41,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:41,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:13:41,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:41,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:13:41,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:13:42,221 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 346 [2024-10-11 17:13:42,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 325 transitions, 896 flow. Second operand has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:42,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:42,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 346 [2024-10-11 17:13:42,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:42,428 INFO L124 PetriNetUnfolderBase]: 68/893 cut-off events. [2024-10-11 17:13:42,429 INFO L125 PetriNetUnfolderBase]: For 103/106 co-relation queries the response was YES. [2024-10-11 17:13:42,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 893 events. 68/893 cut-off events. For 103/106 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3997 event pairs, 5 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 864. Up to 73 conditions per place. [2024-10-11 17:13:42,434 INFO L140 encePairwiseOnDemand]: 339/346 looper letters, 26 selfloop transitions, 5 changer transitions 0/328 dead transitions. [2024-10-11 17:13:42,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 328 transitions, 969 flow [2024-10-11 17:13:42,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:13:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:13:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1869 transitions. [2024-10-11 17:13:42,439 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9002890173410405 [2024-10-11 17:13:42,439 INFO L175 Difference]: Start difference. First operand has 324 places, 325 transitions, 896 flow. Second operand 6 states and 1869 transitions. [2024-10-11 17:13:42,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 328 transitions, 969 flow [2024-10-11 17:13:42,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 328 transitions, 959 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:42,445 INFO L231 Difference]: Finished difference. Result has 322 places, 323 transitions, 892 flow [2024-10-11 17:13:42,446 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=892, PETRI_PLACES=322, PETRI_TRANSITIONS=323} [2024-10-11 17:13:42,446 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, 6 predicate places. [2024-10-11 17:13:42,446 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 323 transitions, 892 flow [2024-10-11 17:13:42,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:42,447 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:42,448 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:42,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:13:42,448 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:42,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash 297091527, now seen corresponding path program 1 times [2024-10-11 17:13:42,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:42,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867724697] [2024-10-11 17:13:42,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:42,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-10-11 17:13:42,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:42,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867724697] [2024-10-11 17:13:42,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867724697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:42,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:42,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:42,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222922504] [2024-10-11 17:13:42,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:42,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:42,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:42,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:42,574 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 346 [2024-10-11 17:13:42,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 323 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:42,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:42,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 346 [2024-10-11 17:13:42,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:42,691 INFO L124 PetriNetUnfolderBase]: 34/746 cut-off events. [2024-10-11 17:13:42,691 INFO L125 PetriNetUnfolderBase]: For 63/66 co-relation queries the response was YES. [2024-10-11 17:13:42,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 746 events. 34/746 cut-off events. For 63/66 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2645 event pairs, 2 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 754. Up to 27 conditions per place. [2024-10-11 17:13:42,696 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 8 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2024-10-11 17:13:42,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 323 transitions, 913 flow [2024-10-11 17:13:42,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:42,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2024-10-11 17:13:42,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9470134874759152 [2024-10-11 17:13:42,699 INFO L175 Difference]: Start difference. First operand has 322 places, 323 transitions, 892 flow. Second operand 3 states and 983 transitions. [2024-10-11 17:13:42,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 323 transitions, 913 flow [2024-10-11 17:13:42,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 323 transitions, 903 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:13:42,705 INFO L231 Difference]: Finished difference. Result has 318 places, 322 transitions, 884 flow [2024-10-11 17:13:42,705 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=318, PETRI_TRANSITIONS=322} [2024-10-11 17:13:42,705 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, 2 predicate places. [2024-10-11 17:13:42,706 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 322 transitions, 884 flow [2024-10-11 17:13:42,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:42,706 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:42,707 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:42,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:13:42,707 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:42,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash 765922188, now seen corresponding path program 1 times [2024-10-11 17:13:42,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:42,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374691121] [2024-10-11 17:13:42,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:42,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:42,801 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-10-11 17:13:42,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:42,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374691121] [2024-10-11 17:13:42,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374691121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:42,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:42,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:42,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799087371] [2024-10-11 17:13:42,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:42,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:42,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:42,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:42,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:42,810 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 346 [2024-10-11 17:13:42,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 322 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:42,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:42,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 346 [2024-10-11 17:13:42,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:42,910 INFO L124 PetriNetUnfolderBase]: 33/723 cut-off events. [2024-10-11 17:13:42,910 INFO L125 PetriNetUnfolderBase]: For 66/68 co-relation queries the response was YES. [2024-10-11 17:13:42,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 723 events. 33/723 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2392 event pairs, 1 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 867. Up to 17 conditions per place. [2024-10-11 17:13:42,914 INFO L140 encePairwiseOnDemand]: 344/346 looper letters, 6 selfloop transitions, 1 changer transitions 0/321 dead transitions. [2024-10-11 17:13:42,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 321 transitions, 896 flow [2024-10-11 17:13:42,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 986 transitions. [2024-10-11 17:13:42,917 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9499036608863198 [2024-10-11 17:13:42,917 INFO L175 Difference]: Start difference. First operand has 318 places, 322 transitions, 884 flow. Second operand 3 states and 986 transitions. [2024-10-11 17:13:42,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 321 transitions, 896 flow [2024-10-11 17:13:42,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 321 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:13:42,923 INFO L231 Difference]: Finished difference. Result has 317 places, 321 transitions, 880 flow [2024-10-11 17:13:42,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=317, PETRI_TRANSITIONS=321} [2024-10-11 17:13:42,923 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places. [2024-10-11 17:13:42,924 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 321 transitions, 880 flow [2024-10-11 17:13:42,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:42,924 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:42,924 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:42,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:13:42,925 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:42,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:42,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1611833642, now seen corresponding path program 1 times [2024-10-11 17:13:42,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:42,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536315915] [2024-10-11 17:13:42,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:42,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-10-11 17:13:43,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:43,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536315915] [2024-10-11 17:13:43,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536315915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:43,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:43,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:43,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716892876] [2024-10-11 17:13:43,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:43,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:43,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:43,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:43,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:43,028 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 346 [2024-10-11 17:13:43,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 321 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:43,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 346 [2024-10-11 17:13:43,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:43,122 INFO L124 PetriNetUnfolderBase]: 33/716 cut-off events. [2024-10-11 17:13:43,123 INFO L125 PetriNetUnfolderBase]: For 63/65 co-relation queries the response was YES. [2024-10-11 17:13:43,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 716 events. 33/716 cut-off events. For 63/65 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2382 event pairs, 1 based on Foata normal form. 2/687 useless extension candidates. Maximal degree in co-relation 889. Up to 18 conditions per place. [2024-10-11 17:13:43,127 INFO L140 encePairwiseOnDemand]: 344/346 looper letters, 4 selfloop transitions, 0 changer transitions 4/320 dead transitions. [2024-10-11 17:13:43,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 320 transitions, 890 flow [2024-10-11 17:13:43,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:43,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2024-10-11 17:13:43,130 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9489402697495183 [2024-10-11 17:13:43,130 INFO L175 Difference]: Start difference. First operand has 317 places, 321 transitions, 880 flow. Second operand 3 states and 985 transitions. [2024-10-11 17:13:43,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 320 transitions, 890 flow [2024-10-11 17:13:43,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 320 transitions, 889 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:13:43,135 INFO L231 Difference]: Finished difference. Result has 317 places, 316 transitions, 867 flow [2024-10-11 17:13:43,135 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=867, PETRI_PLACES=317, PETRI_TRANSITIONS=316} [2024-10-11 17:13:43,136 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places. [2024-10-11 17:13:43,136 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 316 transitions, 867 flow [2024-10-11 17:13:43,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,137 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:13:43,137 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:43,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:13:43,137 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2024-10-11 17:13:43,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:13:43,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1896322544, now seen corresponding path program 1 times [2024-10-11 17:13:43,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:13:43,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007451948] [2024-10-11 17:13:43,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:13:43,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:13:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:13:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2024-10-11 17:13:43,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:13:43,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007451948] [2024-10-11 17:13:43,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007451948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:13:43,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:13:43,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:13:43,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600919193] [2024-10-11 17:13:43,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:13:43,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:13:43,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:13:43,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:13:43,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:13:43,236 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 346 [2024-10-11 17:13:43,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 316 transitions, 867 flow. Second operand has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:13:43,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 346 [2024-10-11 17:13:43,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:13:43,331 INFO L124 PetriNetUnfolderBase]: 38/715 cut-off events. [2024-10-11 17:13:43,331 INFO L125 PetriNetUnfolderBase]: For 69/71 co-relation queries the response was YES. [2024-10-11 17:13:43,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 715 events. 38/715 cut-off events. For 69/71 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2365 event pairs, 2 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 909. Up to 21 conditions per place. [2024-10-11 17:13:43,335 INFO L140 encePairwiseOnDemand]: 343/346 looper letters, 0 selfloop transitions, 0 changer transitions 316/316 dead transitions. [2024-10-11 17:13:43,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 316 transitions, 884 flow [2024-10-11 17:13:43,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:13:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:13:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 981 transitions. [2024-10-11 17:13:43,337 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9450867052023122 [2024-10-11 17:13:43,338 INFO L175 Difference]: Start difference. First operand has 317 places, 316 transitions, 867 flow. Second operand 3 states and 981 transitions. [2024-10-11 17:13:43,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 316 transitions, 884 flow [2024-10-11 17:13:43,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 316 transitions, 884 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:13:43,342 INFO L231 Difference]: Finished difference. Result has 312 places, 0 transitions, 0 flow [2024-10-11 17:13:43,342 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=312, PETRI_TRANSITIONS=0} [2024-10-11 17:13:43,342 INFO L277 CegarLoopForPetriNet]: 316 programPoint places, -4 predicate places. [2024-10-11 17:13:43,343 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 0 transitions, 0 flow [2024-10-11 17:13:43,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:13:43,345 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (53 of 54 remaining) [2024-10-11 17:13:43,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining) [2024-10-11 17:13:43,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining) [2024-10-11 17:13:43,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining) [2024-10-11 17:13:43,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining) [2024-10-11 17:13:43,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining) [2024-10-11 17:13:43,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (47 of 54 remaining) [2024-10-11 17:13:43,346 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (46 of 54 remaining) [2024-10-11 17:13:43,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining) [2024-10-11 17:13:43,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining) [2024-10-11 17:13:43,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining) [2024-10-11 17:13:43,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining) [2024-10-11 17:13:43,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining) [2024-10-11 17:13:43,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining) [2024-10-11 17:13:43,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining) [2024-10-11 17:13:43,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining) [2024-10-11 17:13:43,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (37 of 54 remaining) [2024-10-11 17:13:43,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining) [2024-10-11 17:13:43,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining) [2024-10-11 17:13:43,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining) [2024-10-11 17:13:43,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining) [2024-10-11 17:13:43,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining) [2024-10-11 17:13:43,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining) [2024-10-11 17:13:43,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining) [2024-10-11 17:13:43,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining) [2024-10-11 17:13:43,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining) [2024-10-11 17:13:43,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining) [2024-10-11 17:13:43,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 54 remaining) [2024-10-11 17:13:43,348 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 54 remaining) [2024-10-11 17:13:43,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining) [2024-10-11 17:13:43,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 54 remaining) [2024-10-11 17:13:43,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 54 remaining) [2024-10-11 17:13:43,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 54 remaining) [2024-10-11 17:13:43,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 54 remaining) [2024-10-11 17:13:43,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 54 remaining) [2024-10-11 17:13:43,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining) [2024-10-11 17:13:43,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining) [2024-10-11 17:13:43,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining) [2024-10-11 17:13:43,349 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining) [2024-10-11 17:13:43,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining) [2024-10-11 17:13:43,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining) [2024-10-11 17:13:43,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining) [2024-10-11 17:13:43,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining) [2024-10-11 17:13:43,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining) [2024-10-11 17:13:43,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining) [2024-10-11 17:13:43,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining) [2024-10-11 17:13:43,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining) [2024-10-11 17:13:43,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining) [2024-10-11 17:13:43,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining) [2024-10-11 17:13:43,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining) [2024-10-11 17:13:43,350 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining) [2024-10-11 17:13:43,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining) [2024-10-11 17:13:43,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining) [2024-10-11 17:13:43,351 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining) [2024-10-11 17:13:43,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:13:43,351 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:13:43,357 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 17:13:43,357 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:13:43,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:13:43 BasicIcfg [2024-10-11 17:13:43,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:13:43,361 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:13:43,361 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:13:43,361 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:13:43,362 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:13:28" (3/4) ... [2024-10-11 17:13:43,363 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:13:43,367 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-11 17:13:43,367 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-11 17:13:43,372 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-10-11 17:13:43,373 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:13:43,373 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 17:13:43,374 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:13:43,474 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:13:43,475 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:13:43,475 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:13:43,475 INFO L158 Benchmark]: Toolchain (without parser) took 15919.83ms. Allocated memory was 159.4MB in the beginning and 499.1MB in the end (delta: 339.7MB). Free memory was 122.7MB in the beginning and 236.9MB in the end (delta: -114.2MB). Peak memory consumption was 226.5MB. Max. memory is 16.1GB. [2024-10-11 17:13:43,475 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:13:43,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.75ms. Allocated memory is still 159.4MB. Free memory was 122.7MB in the beginning and 109.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 17:13:43,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.91ms. Allocated memory is still 159.4MB. Free memory was 109.0MB in the beginning and 105.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:13:43,476 INFO L158 Benchmark]: Boogie Preprocessor took 77.12ms. Allocated memory is still 159.4MB. Free memory was 105.8MB in the beginning and 102.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:13:43,476 INFO L158 Benchmark]: RCFGBuilder took 805.42ms. Allocated memory is still 159.4MB. Free memory was 102.7MB in the beginning and 105.7MB in the end (delta: -3.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 17:13:43,477 INFO L158 Benchmark]: TraceAbstraction took 14558.40ms. Allocated memory was 159.4MB in the beginning and 499.1MB in the end (delta: 339.7MB). Free memory was 105.7MB in the beginning and 243.2MB in the end (delta: -137.5MB). Peak memory consumption was 204.3MB. Max. memory is 16.1GB. [2024-10-11 17:13:43,477 INFO L158 Benchmark]: Witness Printer took 113.78ms. Allocated memory is still 499.1MB. Free memory was 243.2MB in the beginning and 236.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 17:13:43,478 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.14ms. Allocated memory is still 109.1MB. Free memory is still 79.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.75ms. Allocated memory is still 159.4MB. Free memory was 122.7MB in the beginning and 109.0MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.91ms. Allocated memory is still 159.4MB. Free memory was 109.0MB in the beginning and 105.8MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.12ms. Allocated memory is still 159.4MB. Free memory was 105.8MB in the beginning and 102.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 805.42ms. Allocated memory is still 159.4MB. Free memory was 102.7MB in the beginning and 105.7MB in the end (delta: -3.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14558.40ms. Allocated memory was 159.4MB in the beginning and 499.1MB in the end (delta: 339.7MB). Free memory was 105.7MB in the beginning and 243.2MB in the end (delta: -137.5MB). Peak memory consumption was 204.3MB. Max. memory is 16.1GB. * Witness Printer took 113.78ms. Allocated memory is still 499.1MB. Free memory was 243.2MB in the beginning and 236.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: 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: 92]: 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 5 procedures, 488 locations, 54 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: 14.4s, OverallIterations: 20, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2560 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1685 mSDsluCounter, 951 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 702 mSDsCounter, 589 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4299 IncrementalHoareTripleChecker+Invalid, 4888 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 589 mSolverCounterUnsat, 249 mSDtfsCounter, 4299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1053 GetRequests, 947 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=946occurred in iteration=13, InterpolantAutomatonStates: 99, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 4116 NumberOfCodeBlocks, 4026 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 4461 ConstructedInterpolants, 0 QuantifiedInterpolants, 6498 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1091 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 2461/2656 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 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:13:43,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE