./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:52:47,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:52:47,915 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:52:47,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:52:47,923 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:52:47,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:52:47,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:52:47,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:52:47,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:52:47,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:52:47,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:52:47,951 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:52:47,951 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:52:47,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:52:47,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:52:47,954 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:52:47,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:52:47,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:52:47,955 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:52:47,955 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:52:47,955 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:52:47,956 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:52:47,956 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:52:47,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:52:47,957 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:52:47,957 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:52:47,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:52:47,958 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:52:47,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:52:47,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:52:47,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:52:47,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:52:47,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:52:47,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:52:47,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:52:47,961 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:52:47,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:52:47,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:52:47,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:52:47,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:52:47,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:52:47,962 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 [2024-11-19 05:52:48,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:52:48,241 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:52:48,244 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:52:48,245 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:52:48,245 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:52:48,246 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2024-11-19 05:52:49,731 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:52:49,955 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:52:49,955 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2024-11-19 05:52:49,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfcafc2f/1e73ba4ddc1b4e618338071edfa64976/FLAGaf3528f60 [2024-11-19 05:52:50,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfcafc2f/1e73ba4ddc1b4e618338071edfa64976 [2024-11-19 05:52:50,297 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:52:50,298 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:52:50,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:52:50,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:52:50,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:52:50,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:50,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c8a9a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50, skipping insertion in model container [2024-11-19 05:52:50,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:50,343 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:52:50,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:52:50,667 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:52:50,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:52:50,770 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:52:50,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50 WrapperNode [2024-11-19 05:52:50,771 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:52:50,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:52:50,772 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:52:50,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:52:50,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:50,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:50,817 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2024-11-19 05:52:50,817 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:52:50,818 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:52:50,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:52:50,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:52:50,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:50,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:50,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:50,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:50,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:50,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:50,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:50,856 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:50,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:52:50,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:52:50,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:52:50,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:52:50,890 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50" (1/1) ... [2024-11-19 05:52:50,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:52:50,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:52:50,959 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 05:52:50,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 05:52:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:52:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:52:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 05:52:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:52:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 05:52:51,022 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 05:52:51,022 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 05:52:51,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 05:52:51,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:52:51,026 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 05:52:51,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:52:51,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:52:51,028 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:52:51,138 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:52:51,140 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:52:51,334 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:52:51,335 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:52:51,391 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:52:51,392 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-19 05:52:51,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:52:51 BoogieIcfgContainer [2024-11-19 05:52:51,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:52:51,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:52:51,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:52:51,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:52:51,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:52:50" (1/3) ... [2024-11-19 05:52:51,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692204b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:52:51, skipping insertion in model container [2024-11-19 05:52:51,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:52:50" (2/3) ... [2024-11-19 05:52:51,400 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@692204b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:52:51, skipping insertion in model container [2024-11-19 05:52:51,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:52:51" (3/3) ... [2024-11-19 05:52:51,401 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2024-11-19 05:52:51,416 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:52:51,416 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-19 05:52:51,416 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:52:51,471 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-19 05:52:51,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 147 transitions, 301 flow [2024-11-19 05:52:51,567 INFO L124 PetriNetUnfolderBase]: 19/206 cut-off events. [2024-11-19 05:52:51,567 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 05:52:51,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 206 events. 19/206 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 628 event pairs, 0 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. [2024-11-19 05:52:51,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 147 transitions, 301 flow [2024-11-19 05:52:51,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 147 transitions, 301 flow [2024-11-19 05:52:51,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:52:51,600 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;@5d6077ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:52:51,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-19 05:52:51,613 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:52:51,614 INFO L124 PetriNetUnfolderBase]: 2/53 cut-off events. [2024-11-19 05:52:51,614 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:52:51,614 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:51,615 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:52:51,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:51,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:51,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1629330204, now seen corresponding path program 1 times [2024-11-19 05:52:51,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:51,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829165661] [2024-11-19 05:52:51,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:51,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:52,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:52,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829165661] [2024-11-19 05:52:52,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829165661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:52,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:52,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:52:52,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996862802] [2024-11-19 05:52:52,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:52,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:52,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:52,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:52,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:52,179 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 147 [2024-11-19 05:52:52,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 147 transitions, 301 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:52,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:52,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 147 [2024-11-19 05:52:52,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:52,441 INFO L124 PetriNetUnfolderBase]: 48/531 cut-off events. [2024-11-19 05:52:52,444 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:52:52,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 531 events. 48/531 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2501 event pairs, 35 based on Foata normal form. 62/538 useless extension candidates. Maximal degree in co-relation 575. Up to 108 conditions per place. [2024-11-19 05:52:52,455 INFO L140 encePairwiseOnDemand]: 132/147 looper letters, 22 selfloop transitions, 2 changer transitions 0/139 dead transitions. [2024-11-19 05:52:52,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 139 transitions, 333 flow [2024-11-19 05:52:52,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:52,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2024-11-19 05:52:52,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-19 05:52:52,474 INFO L175 Difference]: Start difference. First operand has 137 places, 147 transitions, 301 flow. Second operand 3 states and 392 transitions. [2024-11-19 05:52:52,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 139 transitions, 333 flow [2024-11-19 05:52:52,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 139 transitions, 333 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:52:52,482 INFO L231 Difference]: Finished difference. Result has 138 places, 133 transitions, 281 flow [2024-11-19 05:52:52,484 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=281, PETRI_PLACES=138, PETRI_TRANSITIONS=133} [2024-11-19 05:52:52,487 INFO L277 CegarLoopForPetriNet]: 137 programPoint places, 1 predicate places. [2024-11-19 05:52:52,488 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 133 transitions, 281 flow [2024-11-19 05:52:52,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:52,488 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:52,489 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] [2024-11-19 05:52:52,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:52:52,489 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:52,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:52,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1109750366, now seen corresponding path program 1 times [2024-11-19 05:52:52,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:52,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190790666] [2024-11-19 05:52:52,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:52,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:53,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:53,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:53,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190790666] [2024-11-19 05:52:53,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190790666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:53,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:53,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:52:53,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731273907] [2024-11-19 05:52:53,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:53,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:52:53,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:53,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:52:53,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:52:53,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 147 [2024-11-19 05:52:53,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 133 transitions, 281 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:53,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:53,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 147 [2024-11-19 05:52:53,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:53,324 INFO L124 PetriNetUnfolderBase]: 108/637 cut-off events. [2024-11-19 05:52:53,325 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-19 05:52:53,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 924 conditions, 637 events. 108/637 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3633 event pairs, 7 based on Foata normal form. 0/589 useless extension candidates. Maximal degree in co-relation 831. Up to 181 conditions per place. [2024-11-19 05:52:53,329 INFO L140 encePairwiseOnDemand]: 141/147 looper letters, 48 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2024-11-19 05:52:53,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 156 transitions, 433 flow [2024-11-19 05:52:53,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:52:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:52:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 678 transitions. [2024-11-19 05:52:53,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7687074829931972 [2024-11-19 05:52:53,332 INFO L175 Difference]: Start difference. First operand has 138 places, 133 transitions, 281 flow. Second operand 6 states and 678 transitions. [2024-11-19 05:52:53,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 156 transitions, 433 flow [2024-11-19 05:52:53,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 156 transitions, 429 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:52:53,335 INFO L231 Difference]: Finished difference. Result has 140 places, 132 transitions, 285 flow [2024-11-19 05:52:53,335 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=285, PETRI_PLACES=140, PETRI_TRANSITIONS=132} [2024-11-19 05:52:53,336 INFO L277 CegarLoopForPetriNet]: 137 programPoint places, 3 predicate places. [2024-11-19 05:52:53,336 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 132 transitions, 285 flow [2024-11-19 05:52:53,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:53,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:53,337 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] [2024-11-19 05:52:53,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:52:53,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:53,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:53,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1567470371, now seen corresponding path program 1 times [2024-11-19 05:52:53,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:53,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012344554] [2024-11-19 05:52:53,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:53,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:53,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:53,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012344554] [2024-11-19 05:52:53,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012344554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:53,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:53,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:52:53,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798903972] [2024-11-19 05:52:53,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:53,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:53,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:53,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:53,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:53,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 147 [2024-11-19 05:52:53,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 132 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:53,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:53,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 147 [2024-11-19 05:52:53,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:53,503 INFO L124 PetriNetUnfolderBase]: 91/795 cut-off events. [2024-11-19 05:52:53,504 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-19 05:52:53,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 795 events. 91/795 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4698 event pairs, 30 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 962. Up to 125 conditions per place. [2024-11-19 05:52:53,507 INFO L140 encePairwiseOnDemand]: 138/147 looper letters, 30 selfloop transitions, 6 changer transitions 0/145 dead transitions. [2024-11-19 05:52:53,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 145 transitions, 386 flow [2024-11-19 05:52:53,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:53,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:53,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2024-11-19 05:52:53,509 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8435374149659864 [2024-11-19 05:52:53,509 INFO L175 Difference]: Start difference. First operand has 140 places, 132 transitions, 285 flow. Second operand 3 states and 372 transitions. [2024-11-19 05:52:53,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 145 transitions, 386 flow [2024-11-19 05:52:53,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 145 transitions, 376 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:52:53,512 INFO L231 Difference]: Finished difference. Result has 137 places, 134 transitions, 313 flow [2024-11-19 05:52:53,513 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=137, PETRI_TRANSITIONS=134} [2024-11-19 05:52:53,513 INFO L277 CegarLoopForPetriNet]: 137 programPoint places, 0 predicate places. [2024-11-19 05:52:53,513 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 313 flow [2024-11-19 05:52:53,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:53,514 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:53,514 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:52:53,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:52:53,514 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:53,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:53,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1800401091, now seen corresponding path program 1 times [2024-11-19 05:52:53,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:53,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147813092] [2024-11-19 05:52:53,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:53,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:53,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:53,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:53,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147813092] [2024-11-19 05:52:53,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147813092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:53,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:53,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:52:53,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530936876] [2024-11-19 05:52:53,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:53,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:53,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:53,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:53,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:53,571 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 147 [2024-11-19 05:52:53,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 134 transitions, 313 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:53,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:53,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 147 [2024-11-19 05:52:53,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:53,667 INFO L124 PetriNetUnfolderBase]: 94/797 cut-off events. [2024-11-19 05:52:53,667 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-11-19 05:52:53,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 797 events. 94/797 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4756 event pairs, 60 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 1062. Up to 189 conditions per place. [2024-11-19 05:52:53,671 INFO L140 encePairwiseOnDemand]: 142/147 looper letters, 27 selfloop transitions, 4 changer transitions 0/141 dead transitions. [2024-11-19 05:52:53,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 141 transitions, 393 flow [2024-11-19 05:52:53,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2024-11-19 05:52:53,672 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8344671201814059 [2024-11-19 05:52:53,672 INFO L175 Difference]: Start difference. First operand has 137 places, 134 transitions, 313 flow. Second operand 3 states and 368 transitions. [2024-11-19 05:52:53,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 141 transitions, 393 flow [2024-11-19 05:52:53,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 141 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:52:53,675 INFO L231 Difference]: Finished difference. Result has 139 places, 137 transitions, 333 flow [2024-11-19 05:52:53,676 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=147, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=139, PETRI_TRANSITIONS=137} [2024-11-19 05:52:53,676 INFO L277 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2024-11-19 05:52:53,677 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 137 transitions, 333 flow [2024-11-19 05:52:53,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:53,677 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:53,677 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:52:53,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:52:53,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2024-11-19 05:52:53,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:53,678 INFO L85 PathProgramCache]: Analyzing trace with hash 660933758, now seen corresponding path program 1 times [2024-11-19 05:52:53,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:53,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046218023] [2024-11-19 05:52:53,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:53,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:52:53,695 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:52:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:52:53,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:52:53,737 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:52:53,738 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2024-11-19 05:52:53,739 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2024-11-19 05:52:53,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2024-11-19 05:52:53,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2024-11-19 05:52:53,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2024-11-19 05:52:53,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2024-11-19 05:52:53,740 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2024-11-19 05:52:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2024-11-19 05:52:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2024-11-19 05:52:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2024-11-19 05:52:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2024-11-19 05:52:53,741 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2024-11-19 05:52:53,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:52:53,742 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-19 05:52:53,743 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:52:53,743 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-19 05:52:53,770 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 05:52:53,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 181 places, 196 transitions, 408 flow [2024-11-19 05:52:53,807 INFO L124 PetriNetUnfolderBase]: 34/342 cut-off events. [2024-11-19 05:52:53,808 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-19 05:52:53,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 342 events. 34/342 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1167 event pairs, 0 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 208. Up to 8 conditions per place. [2024-11-19 05:52:53,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 196 transitions, 408 flow [2024-11-19 05:52:53,813 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 196 transitions, 408 flow [2024-11-19 05:52:53,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:52:53,817 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;@5d6077ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:52:53,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-19 05:52:53,832 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:52:53,833 INFO L124 PetriNetUnfolderBase]: 2/53 cut-off events. [2024-11-19 05:52:53,833 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:52:53,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:53,833 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:52:53,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:52:53,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:53,834 INFO L85 PathProgramCache]: Analyzing trace with hash 149931292, now seen corresponding path program 1 times [2024-11-19 05:52:53,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:53,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170007427] [2024-11-19 05:52:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:53,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:53,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:53,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170007427] [2024-11-19 05:52:53,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170007427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:53,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:53,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:52:53,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534833594] [2024-11-19 05:52:53,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:53,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:53,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:53,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:53,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:53,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 196 [2024-11-19 05:52:53,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 196 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:53,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:53,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 196 [2024-11-19 05:52:53,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:54,324 INFO L124 PetriNetUnfolderBase]: 788/4305 cut-off events. [2024-11-19 05:52:54,324 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2024-11-19 05:52:54,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5658 conditions, 4305 events. 788/4305 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 41159 event pairs, 348 based on Foata normal form. 749/4668 useless extension candidates. Maximal degree in co-relation 721. Up to 1303 conditions per place. [2024-11-19 05:52:54,343 INFO L140 encePairwiseOnDemand]: 175/196 looper letters, 31 selfloop transitions, 2 changer transitions 0/183 dead transitions. [2024-11-19 05:52:54,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 183 transitions, 448 flow [2024-11-19 05:52:54,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2024-11-19 05:52:54,344 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8707482993197279 [2024-11-19 05:52:54,344 INFO L175 Difference]: Start difference. First operand has 181 places, 196 transitions, 408 flow. Second operand 3 states and 512 transitions. [2024-11-19 05:52:54,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 183 transitions, 448 flow [2024-11-19 05:52:54,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 183 transitions, 448 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:52:54,347 INFO L231 Difference]: Finished difference. Result has 182 places, 177 transitions, 380 flow [2024-11-19 05:52:54,347 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=380, PETRI_PLACES=182, PETRI_TRANSITIONS=177} [2024-11-19 05:52:54,348 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 1 predicate places. [2024-11-19 05:52:54,348 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 177 transitions, 380 flow [2024-11-19 05:52:54,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:54,348 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:54,349 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] [2024-11-19 05:52:54,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:52:54,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:52:54,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:54,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1177923550, now seen corresponding path program 1 times [2024-11-19 05:52:54,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:54,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824093927] [2024-11-19 05:52:54,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:54,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:54,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:54,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824093927] [2024-11-19 05:52:54,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824093927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:54,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:54,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:52:54,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657001991] [2024-11-19 05:52:54,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:54,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:52:54,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:54,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:52:54,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:52:54,614 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 196 [2024-11-19 05:52:54,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 177 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:54,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:54,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 196 [2024-11-19 05:52:54,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:55,328 INFO L124 PetriNetUnfolderBase]: 1718/5680 cut-off events. [2024-11-19 05:52:55,328 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2024-11-19 05:52:55,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8692 conditions, 5680 events. 1718/5680 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 54009 event pairs, 222 based on Foata normal form. 0/5288 useless extension candidates. Maximal degree in co-relation 1233. Up to 2015 conditions per place. [2024-11-19 05:52:55,365 INFO L140 encePairwiseOnDemand]: 190/196 looper letters, 80 selfloop transitions, 6 changer transitions 0/224 dead transitions. [2024-11-19 05:52:55,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 224 transitions, 646 flow [2024-11-19 05:52:55,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:52:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:52:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 920 transitions. [2024-11-19 05:52:55,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.782312925170068 [2024-11-19 05:52:55,368 INFO L175 Difference]: Start difference. First operand has 182 places, 177 transitions, 380 flow. Second operand 6 states and 920 transitions. [2024-11-19 05:52:55,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 224 transitions, 646 flow [2024-11-19 05:52:55,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 224 transitions, 644 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:52:55,374 INFO L231 Difference]: Finished difference. Result has 185 places, 176 transitions, 388 flow [2024-11-19 05:52:55,374 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=388, PETRI_PLACES=185, PETRI_TRANSITIONS=176} [2024-11-19 05:52:55,375 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 4 predicate places. [2024-11-19 05:52:55,376 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 176 transitions, 388 flow [2024-11-19 05:52:55,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:55,376 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:55,376 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] [2024-11-19 05:52:55,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:52:55,377 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:52:55,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:55,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1892525488, now seen corresponding path program 1 times [2024-11-19 05:52:55,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:55,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300969392] [2024-11-19 05:52:55,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:55,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:55,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:55,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:55,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300969392] [2024-11-19 05:52:55,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300969392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:55,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:55,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:52:55,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408764585] [2024-11-19 05:52:55,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:55,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:55,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:55,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:55,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:55,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 196 [2024-11-19 05:52:55,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 176 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:55,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:55,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 196 [2024-11-19 05:52:55,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:57,092 INFO L124 PetriNetUnfolderBase]: 3893/14603 cut-off events. [2024-11-19 05:52:57,092 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2024-11-19 05:52:57,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21154 conditions, 14603 events. 3893/14603 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 164191 event pairs, 1530 based on Foata normal form. 0/13062 useless extension candidates. Maximal degree in co-relation 20044. Up to 3516 conditions per place. [2024-11-19 05:52:57,176 INFO L140 encePairwiseOnDemand]: 177/196 looper letters, 58 selfloop transitions, 14 changer transitions 0/209 dead transitions. [2024-11-19 05:52:57,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 209 transitions, 609 flow [2024-11-19 05:52:57,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2024-11-19 05:52:57,178 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8350340136054422 [2024-11-19 05:52:57,178 INFO L175 Difference]: Start difference. First operand has 185 places, 176 transitions, 388 flow. Second operand 3 states and 491 transitions. [2024-11-19 05:52:57,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 209 transitions, 609 flow [2024-11-19 05:52:57,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 209 transitions, 597 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:52:57,182 INFO L231 Difference]: Finished difference. Result has 184 places, 190 transitions, 498 flow [2024-11-19 05:52:57,183 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=184, PETRI_TRANSITIONS=190} [2024-11-19 05:52:57,184 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 3 predicate places. [2024-11-19 05:52:57,185 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 190 transitions, 498 flow [2024-11-19 05:52:57,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:57,185 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:57,185 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:52:57,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:52:57,185 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:52:57,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:57,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1628660468, now seen corresponding path program 1 times [2024-11-19 05:52:57,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:57,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842606021] [2024-11-19 05:52:57,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:57,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:57,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:57,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842606021] [2024-11-19 05:52:57,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842606021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:52:57,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:52:57,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:52:57,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362500746] [2024-11-19 05:52:57,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:52:57,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:52:57,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:57,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:52:57,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:52:57,247 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 196 [2024-11-19 05:52:57,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 190 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:57,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:57,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 196 [2024-11-19 05:52:57,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:52:59,338 INFO L124 PetriNetUnfolderBase]: 4020/16456 cut-off events. [2024-11-19 05:52:59,339 INFO L125 PetriNetUnfolderBase]: For 4426/4601 co-relation queries the response was YES. [2024-11-19 05:52:59,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27144 conditions, 16456 events. 4020/16456 cut-off events. For 4426/4601 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 193973 event pairs, 2411 based on Foata normal form. 46/14958 useless extension candidates. Maximal degree in co-relation 13739. Up to 5498 conditions per place. [2024-11-19 05:52:59,427 INFO L140 encePairwiseOnDemand]: 187/196 looper letters, 52 selfloop transitions, 14 changer transitions 0/214 dead transitions. [2024-11-19 05:52:59,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 214 transitions, 716 flow [2024-11-19 05:52:59,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:52:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:52:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2024-11-19 05:52:59,429 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8248299319727891 [2024-11-19 05:52:59,429 INFO L175 Difference]: Start difference. First operand has 184 places, 190 transitions, 498 flow. Second operand 3 states and 485 transitions. [2024-11-19 05:52:59,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 214 transitions, 716 flow [2024-11-19 05:52:59,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 214 transitions, 678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:52:59,440 INFO L231 Difference]: Finished difference. Result has 186 places, 202 transitions, 596 flow [2024-11-19 05:52:59,440 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=186, PETRI_TRANSITIONS=202} [2024-11-19 05:52:59,440 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, 5 predicate places. [2024-11-19 05:52:59,441 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 202 transitions, 596 flow [2024-11-19 05:52:59,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:59,442 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:52:59,442 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] [2024-11-19 05:52:59,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:52:59,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:52:59,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:52:59,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1927464448, now seen corresponding path program 1 times [2024-11-19 05:52:59,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:52:59,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585731810] [2024-11-19 05:52:59,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:59,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:52:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:59,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:52:59,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585731810] [2024-11-19 05:52:59,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585731810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 05:52:59,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734227187] [2024-11-19 05:52:59,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:52:59,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 05:52:59,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:52:59,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 05:52:59,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 05:52:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:52:59,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 05:52:59,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 05:52:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:59,679 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 05:52:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:52:59,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734227187] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 05:52:59,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 05:52:59,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-19 05:52:59,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336167169] [2024-11-19 05:52:59,729 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 05:52:59,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 05:52:59,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:52:59,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 05:52:59,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-19 05:52:59,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 196 [2024-11-19 05:52:59,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 202 transitions, 596 flow. Second operand has 10 states, 10 states have (on average 150.5) internal successors, (1505), 10 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:52:59,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:52:59,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 196 [2024-11-19 05:52:59,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:00,239 INFO L124 PetriNetUnfolderBase]: 675/2887 cut-off events. [2024-11-19 05:53:00,239 INFO L125 PetriNetUnfolderBase]: For 266/283 co-relation queries the response was YES. [2024-11-19 05:53:00,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4500 conditions, 2887 events. 675/2887 cut-off events. For 266/283 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 24860 event pairs, 56 based on Foata normal form. 106/2870 useless extension candidates. Maximal degree in co-relation 2700. Up to 458 conditions per place. [2024-11-19 05:53:00,259 INFO L140 encePairwiseOnDemand]: 191/196 looper letters, 72 selfloop transitions, 7 changer transitions 0/209 dead transitions. [2024-11-19 05:53:00,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 209 transitions, 722 flow [2024-11-19 05:53:00,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 05:53:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 05:53:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1413 transitions. [2024-11-19 05:53:00,263 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8010204081632653 [2024-11-19 05:53:00,263 INFO L175 Difference]: Start difference. First operand has 186 places, 202 transitions, 596 flow. Second operand 9 states and 1413 transitions. [2024-11-19 05:53:00,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 209 transitions, 722 flow [2024-11-19 05:53:00,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 209 transitions, 702 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:00,268 INFO L231 Difference]: Finished difference. Result has 149 places, 153 transitions, 446 flow [2024-11-19 05:53:00,268 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=446, PETRI_PLACES=149, PETRI_TRANSITIONS=153} [2024-11-19 05:53:00,269 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, -32 predicate places. [2024-11-19 05:53:00,269 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 153 transitions, 446 flow [2024-11-19 05:53:00,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 150.5) internal successors, (1505), 10 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:00,270 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:00,270 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:00,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 05:53:00,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-19 05:53:00,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:00,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:00,476 INFO L85 PathProgramCache]: Analyzing trace with hash 573959911, now seen corresponding path program 1 times [2024-11-19 05:53:00,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:00,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807159075] [2024-11-19 05:53:00,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:00,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 05:53:00,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:00,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807159075] [2024-11-19 05:53:00,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807159075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:00,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:00,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:00,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353895877] [2024-11-19 05:53:00,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:00,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:00,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:00,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:00,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:00,544 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 196 [2024-11-19 05:53:00,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 153 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:00,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:00,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 196 [2024-11-19 05:53:00,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:00,691 INFO L124 PetriNetUnfolderBase]: 260/1294 cut-off events. [2024-11-19 05:53:00,692 INFO L125 PetriNetUnfolderBase]: For 451/472 co-relation queries the response was YES. [2024-11-19 05:53:00,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2339 conditions, 1294 events. 260/1294 cut-off events. For 451/472 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 8678 event pairs, 132 based on Foata normal form. 7/1209 useless extension candidates. Maximal degree in co-relation 2262. Up to 459 conditions per place. [2024-11-19 05:53:00,702 INFO L140 encePairwiseOnDemand]: 188/196 looper letters, 42 selfloop transitions, 12 changer transitions 0/167 dead transitions. [2024-11-19 05:53:00,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 167 transitions, 598 flow [2024-11-19 05:53:00,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2024-11-19 05:53:00,704 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8010204081632653 [2024-11-19 05:53:00,704 INFO L175 Difference]: Start difference. First operand has 149 places, 153 transitions, 446 flow. Second operand 3 states and 471 transitions. [2024-11-19 05:53:00,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 167 transitions, 598 flow [2024-11-19 05:53:00,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 167 transitions, 583 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-11-19 05:53:00,708 INFO L231 Difference]: Finished difference. Result has 148 places, 161 transitions, 529 flow [2024-11-19 05:53:00,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=529, PETRI_PLACES=148, PETRI_TRANSITIONS=161} [2024-11-19 05:53:00,709 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, -33 predicate places. [2024-11-19 05:53:00,709 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 161 transitions, 529 flow [2024-11-19 05:53:00,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:00,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:00,710 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] [2024-11-19 05:53:00,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:53:00,710 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:00,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1794930462, now seen corresponding path program 1 times [2024-11-19 05:53:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:00,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550118247] [2024-11-19 05:53:00,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:00,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:00,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:00,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:00,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550118247] [2024-11-19 05:53:00,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550118247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:00,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:00,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:00,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925691493] [2024-11-19 05:53:00,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:00,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:00,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:00,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:00,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:00,778 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 196 [2024-11-19 05:53:00,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 161 transitions, 529 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:00,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:00,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 196 [2024-11-19 05:53:00,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:00,943 INFO L124 PetriNetUnfolderBase]: 291/1366 cut-off events. [2024-11-19 05:53:00,943 INFO L125 PetriNetUnfolderBase]: For 1163/1198 co-relation queries the response was YES. [2024-11-19 05:53:00,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 1366 events. 291/1366 cut-off events. For 1163/1198 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 9336 event pairs, 134 based on Foata normal form. 9/1299 useless extension candidates. Maximal degree in co-relation 2719. Up to 501 conditions per place. [2024-11-19 05:53:00,955 INFO L140 encePairwiseOnDemand]: 188/196 looper letters, 49 selfloop transitions, 12 changer transitions 0/176 dead transitions. [2024-11-19 05:53:00,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 176 transitions, 718 flow [2024-11-19 05:53:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:00,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:00,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2024-11-19 05:53:00,957 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8027210884353742 [2024-11-19 05:53:00,957 INFO L175 Difference]: Start difference. First operand has 148 places, 161 transitions, 529 flow. Second operand 3 states and 472 transitions. [2024-11-19 05:53:00,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 176 transitions, 718 flow [2024-11-19 05:53:00,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 176 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:53:00,961 INFO L231 Difference]: Finished difference. Result has 150 places, 169 transitions, 615 flow [2024-11-19 05:53:00,962 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=196, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=615, PETRI_PLACES=150, PETRI_TRANSITIONS=169} [2024-11-19 05:53:00,962 INFO L277 CegarLoopForPetriNet]: 181 programPoint places, -31 predicate places. [2024-11-19 05:53:00,962 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 169 transitions, 615 flow [2024-11-19 05:53:00,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:00,963 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:00,963 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:00,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:53:00,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-19 05:53:00,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:00,964 INFO L85 PathProgramCache]: Analyzing trace with hash 508953308, now seen corresponding path program 1 times [2024-11-19 05:53:00,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:00,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584063182] [2024-11-19 05:53:00,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:00,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:53:00,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 05:53:01,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 05:53:01,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 05:53:01,034 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 05:53:01,034 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2024-11-19 05:53:01,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-11-19 05:53:01,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-11-19 05:53:01,034 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-11-19 05:53:01,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-11-19 05:53:01,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-11-19 05:53:01,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-11-19 05:53:01,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2024-11-19 05:53:01,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-11-19 05:53:01,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-11-19 05:53:01,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-11-19 05:53:01,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-11-19 05:53:01,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-11-19 05:53:01,035 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-11-19 05:53:01,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-11-19 05:53:01,036 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-11-19 05:53:01,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:53:01,036 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:01,037 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-19 05:53:01,037 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-19 05:53:01,056 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-19 05:53:01,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 245 transitions, 517 flow [2024-11-19 05:53:01,095 INFO L124 PetriNetUnfolderBase]: 54/523 cut-off events. [2024-11-19 05:53:01,096 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-19 05:53:01,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 523 events. 54/523 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1974 event pairs, 1 based on Foata normal form. 0/437 useless extension candidates. Maximal degree in co-relation 350. Up to 16 conditions per place. [2024-11-19 05:53:01,101 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 245 transitions, 517 flow [2024-11-19 05:53:01,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 245 transitions, 517 flow [2024-11-19 05:53:01,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:53:01,105 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;@5d6077ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:53:01,105 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2024-11-19 05:53:01,107 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:53:01,107 INFO L124 PetriNetUnfolderBase]: 2/53 cut-off events. [2024-11-19 05:53:01,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:53:01,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:01,107 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:53:01,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 05:53:01,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:01,108 INFO L85 PathProgramCache]: Analyzing trace with hash -625575524, now seen corresponding path program 1 times [2024-11-19 05:53:01,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:01,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509058801] [2024-11-19 05:53:01,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:01,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:01,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:01,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509058801] [2024-11-19 05:53:01,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509058801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:01,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:01,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 05:53:01,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889406836] [2024-11-19 05:53:01,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:01,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:01,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:01,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:01,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:01,154 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 245 [2024-11-19 05:53:01,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 245 transitions, 517 flow. Second operand has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:01,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:01,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 245 [2024-11-19 05:53:01,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:04,987 INFO L124 PetriNetUnfolderBase]: 8948/35254 cut-off events. [2024-11-19 05:53:04,987 INFO L125 PetriNetUnfolderBase]: For 952/952 co-relation queries the response was YES. [2024-11-19 05:53:05,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48492 conditions, 35254 events. 8948/35254 cut-off events. For 952/952 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 458910 event pairs, 5659 based on Foata normal form. 7668/39699 useless extension candidates. Maximal degree in co-relation 6249. Up to 12802 conditions per place. [2024-11-19 05:53:05,259 INFO L140 encePairwiseOnDemand]: 218/245 looper letters, 39 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2024-11-19 05:53:05,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 226 transitions, 561 flow [2024-11-19 05:53:05,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:53:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:53:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2024-11-19 05:53:05,263 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8585034013605443 [2024-11-19 05:53:05,263 INFO L175 Difference]: Start difference. First operand has 225 places, 245 transitions, 517 flow. Second operand 3 states and 631 transitions. [2024-11-19 05:53:05,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 226 transitions, 561 flow [2024-11-19 05:53:05,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 226 transitions, 561 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 05:53:05,267 INFO L231 Difference]: Finished difference. Result has 226 places, 220 transitions, 477 flow [2024-11-19 05:53:05,267 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=226, PETRI_TRANSITIONS=220} [2024-11-19 05:53:05,269 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, 1 predicate places. [2024-11-19 05:53:05,269 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 220 transitions, 477 flow [2024-11-19 05:53:05,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:05,270 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:05,270 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] [2024-11-19 05:53:05,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:53:05,270 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 05:53:05,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:05,271 INFO L85 PathProgramCache]: Analyzing trace with hash 884343618, now seen corresponding path program 1 times [2024-11-19 05:53:05,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:05,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720744594] [2024-11-19 05:53:05,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:05,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:05,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:05,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720744594] [2024-11-19 05:53:05,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720744594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:05,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:05,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:53:05,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328354104] [2024-11-19 05:53:05,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:05,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:53:05,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:05,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:53:05,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:53:05,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 245 [2024-11-19 05:53:05,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 220 transitions, 477 flow. Second operand has 6 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:05,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:05,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 245 [2024-11-19 05:53:05,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:53:11,176 INFO L124 PetriNetUnfolderBase]: 19555/52048 cut-off events. [2024-11-19 05:53:11,177 INFO L125 PetriNetUnfolderBase]: For 1359/1359 co-relation queries the response was YES. [2024-11-19 05:53:11,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81208 conditions, 52048 events. 19555/52048 cut-off events. For 1359/1359 co-relation queries the response was YES. Maximal size of possible extension queue 1311. Compared 636389 event pairs, 2086 based on Foata normal form. 0/48476 useless extension candidates. Maximal degree in co-relation 76339. Up to 20048 conditions per place. [2024-11-19 05:53:11,573 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 112 selfloop transitions, 6 changer transitions 0/291 dead transitions. [2024-11-19 05:53:11,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 291 transitions, 855 flow [2024-11-19 05:53:11,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:53:11,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:53:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1162 transitions. [2024-11-19 05:53:11,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7904761904761904 [2024-11-19 05:53:11,577 INFO L175 Difference]: Start difference. First operand has 226 places, 220 transitions, 477 flow. Second operand 6 states and 1162 transitions. [2024-11-19 05:53:11,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 291 transitions, 855 flow [2024-11-19 05:53:11,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 291 transitions, 853 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:53:11,582 INFO L231 Difference]: Finished difference. Result has 229 places, 219 transitions, 485 flow [2024-11-19 05:53:11,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=229, PETRI_TRANSITIONS=219} [2024-11-19 05:53:11,583 INFO L277 CegarLoopForPetriNet]: 225 programPoint places, 4 predicate places. [2024-11-19 05:53:11,584 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 219 transitions, 485 flow [2024-11-19 05:53:11,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 175.5) internal successors, (1053), 6 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:11,584 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:53:11,584 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] [2024-11-19 05:53:11,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:53:11,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2024-11-19 05:53:11,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:53:11,585 INFO L85 PathProgramCache]: Analyzing trace with hash 533651924, now seen corresponding path program 1 times [2024-11-19 05:53:11,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:53:11,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124704543] [2024-11-19 05:53:11,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:53:11,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:53:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:53:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 05:53:11,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:53:11,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124704543] [2024-11-19 05:53:11,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124704543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:53:11,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:53:11,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:53:11,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612305739] [2024-11-19 05:53:11,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:53:11,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:53:11,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:53:11,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:53:11,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:53:11,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 245 [2024-11-19 05:53:11,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 219 transitions, 485 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 05:53:11,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:53:11,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 245 [2024-11-19 05:53:11,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand