./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:39:44,034 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:39:44,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:39:44,096 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:39:44,096 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:39:44,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:39:44,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:39:44,123 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:39:44,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:39:44,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:39:44,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:39:44,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:39:44,125 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:39:44,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:39:44,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:39:44,127 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:39:44,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:39:44,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:39:44,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:39:44,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:39:44,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:39:44,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:39:44,131 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:39:44,131 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:39:44,131 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:39:44,131 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:39:44,132 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:39:44,132 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:39:44,132 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:39:44,132 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:39:44,132 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:39:44,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:39:44,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:39:44,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:39:44,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:39:44,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:39:44,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:39:44,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:39:44,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:39:44,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:39:44,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:39:44,143 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 -> 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d [2024-11-10 14:39:44,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:39:44,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:39:44,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:39:44,405 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:39:44,405 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:39:44,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2024-11-10 14:39:45,650 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:39:45,863 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:39:45,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2024-11-10 14:39:45,873 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af1f24e7/128ac145ceec4570af55b8296a14f371/FLAGcbd67b32c [2024-11-10 14:39:45,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3af1f24e7/128ac145ceec4570af55b8296a14f371 [2024-11-10 14:39:45,889 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:39:45,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:39:45,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:39:45,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:39:45,898 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:39:45,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:39:45" (1/1) ... [2024-11-10 14:39:45,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1454436e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:45, skipping insertion in model container [2024-11-10 14:39:45,901 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:39:45" (1/1) ... [2024-11-10 14:39:45,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:39:46,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:39:46,119 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:39:46,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:39:46,156 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:39:46,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:46 WrapperNode [2024-11-10 14:39:46,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:39:46,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:39:46,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:39:46,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:39:46,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:46" (1/1) ... [2024-11-10 14:39:46,171 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:46" (1/1) ... [2024-11-10 14:39:46,194 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 326 [2024-11-10 14:39:46,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:39:46,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:39:46,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:39:46,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:39:46,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:46" (1/1) ... [2024-11-10 14:39:46,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:46" (1/1) ... [2024-11-10 14:39:46,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:46" (1/1) ... [2024-11-10 14:39:46,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:46" (1/1) ... [2024-11-10 14:39:46,214 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:46" (1/1) ... [2024-11-10 14:39:46,215 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:46" (1/1) ... [2024-11-10 14:39:46,216 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:46" (1/1) ... [2024-11-10 14:39:46,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:46" (1/1) ... [2024-11-10 14:39:46,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:39:46,221 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:39:46,221 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:39:46,221 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:39:46,221 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:46" (1/1) ... [2024-11-10 14:39:46,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:39:46,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:39:46,260 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-10 14:39:46,262 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-10 14:39:46,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:39:46,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:39:46,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:39:46,295 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:39:46,295 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:39:46,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:39:46,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:39:46,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 14:39:46,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 14:39:46,296 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:39:46,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:39:46,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:39:46,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:39:46,297 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:39:46,447 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:39:46,449 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:39:47,061 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:39:47,061 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:39:47,283 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:39:47,286 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:39:47,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:39:47 BoogieIcfgContainer [2024-11-10 14:39:47,287 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:39:47,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:39:47,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:39:47,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:39:47,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:39:45" (1/3) ... [2024-11-10 14:39:47,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9bd3fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:39:47, skipping insertion in model container [2024-11-10 14:39:47,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:39:46" (2/3) ... [2024-11-10 14:39:47,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9bd3fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:39:47, skipping insertion in model container [2024-11-10 14:39:47,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:39:47" (3/3) ... [2024-11-10 14:39:47,301 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2024-11-10 14:39:47,329 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:39:47,333 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2024-11-10 14:39:47,334 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:39:47,446 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 14:39:47,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 285 transitions, 584 flow [2024-11-10 14:39:47,540 INFO L124 PetriNetUnfolderBase]: 12/283 cut-off events. [2024-11-10 14:39:47,541 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:39:47,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 292 conditions, 283 events. 12/283 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 480 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 199. Up to 3 conditions per place. [2024-11-10 14:39:47,552 INFO L82 GeneralOperation]: Start removeDead. Operand has 280 places, 285 transitions, 584 flow [2024-11-10 14:39:47,561 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 260 places, 263 transitions, 538 flow [2024-11-10 14:39:47,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:39:47,588 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;@114930e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:39:47,589 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-11-10 14:39:47,596 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:39:47,600 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-10 14:39:47,600 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:39:47,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:47,601 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] [2024-11-10 14:39:47,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:47,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1471099911, now seen corresponding path program 1 times [2024-11-10 14:39:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:47,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665808809] [2024-11-10 14:39:47,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:47,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:47,798 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-10 14:39:47,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665808809] [2024-11-10 14:39:47,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665808809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:47,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:47,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:47,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919428940] [2024-11-10 14:39:47,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:47,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:47,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:47,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:47,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:47,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 285 [2024-11-10 14:39:47,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 263 transitions, 538 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-10 14:39:47,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:47,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 285 [2024-11-10 14:39:47,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:48,020 INFO L124 PetriNetUnfolderBase]: 21/401 cut-off events. [2024-11-10 14:39:48,021 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-11-10 14:39:48,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 401 events. 21/401 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1276 event pairs, 14 based on Foata normal form. 20/362 useless extension candidates. Maximal degree in co-relation 292. Up to 42 conditions per place. [2024-11-10 14:39:48,026 INFO L140 encePairwiseOnDemand]: 249/285 looper letters, 13 selfloop transitions, 2 changer transitions 3/229 dead transitions. [2024-11-10 14:39:48,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 229 transitions, 500 flow [2024-11-10 14:39:48,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:48,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2024-11-10 14:39:48,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8748538011695907 [2024-11-10 14:39:48,045 INFO L175 Difference]: Start difference. First operand has 260 places, 263 transitions, 538 flow. Second operand 3 states and 748 transitions. [2024-11-10 14:39:48,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 229 transitions, 500 flow [2024-11-10 14:39:48,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 229 transitions, 492 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 14:39:48,056 INFO L231 Difference]: Finished difference. Result has 231 places, 226 transitions, 460 flow [2024-11-10 14:39:48,058 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=231, PETRI_TRANSITIONS=226} [2024-11-10 14:39:48,062 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -29 predicate places. [2024-11-10 14:39:48,063 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 226 transitions, 460 flow [2024-11-10 14:39:48,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-10 14:39:48,064 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:48,064 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] [2024-11-10 14:39:48,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:39:48,065 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:48,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:48,066 INFO L85 PathProgramCache]: Analyzing trace with hash -982084865, now seen corresponding path program 1 times [2024-11-10 14:39:48,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:48,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6355539] [2024-11-10 14:39:48,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:48,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:48,132 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-10 14:39:48,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:48,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6355539] [2024-11-10 14:39:48,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6355539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:48,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:48,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:48,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376069403] [2024-11-10 14:39:48,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:48,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:48,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:48,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:48,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:48,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 285 [2024-11-10 14:39:48,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 226 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-10 14:39:48,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:48,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 285 [2024-11-10 14:39:48,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:48,209 INFO L124 PetriNetUnfolderBase]: 12/309 cut-off events. [2024-11-10 14:39:48,209 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:39:48,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 309 events. 12/309 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 743 event pairs, 7 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 318. Up to 30 conditions per place. [2024-11-10 14:39:48,213 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 13 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2024-11-10 14:39:48,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 225 transitions, 488 flow [2024-11-10 14:39:48,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2024-11-10 14:39:48,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8362573099415205 [2024-11-10 14:39:48,219 INFO L175 Difference]: Start difference. First operand has 231 places, 226 transitions, 460 flow. Second operand 3 states and 715 transitions. [2024-11-10 14:39:48,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 225 transitions, 488 flow [2024-11-10 14:39:48,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 225 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:48,238 INFO L231 Difference]: Finished difference. Result has 227 places, 225 transitions, 458 flow [2024-11-10 14:39:48,239 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=227, PETRI_TRANSITIONS=225} [2024-11-10 14:39:48,241 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -33 predicate places. [2024-11-10 14:39:48,242 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 225 transitions, 458 flow [2024-11-10 14:39:48,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 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-10 14:39:48,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:48,242 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-10 14:39:48,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:39:48,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:48,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:48,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1706496593, now seen corresponding path program 1 times [2024-11-10 14:39:48,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:48,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868003947] [2024-11-10 14:39:48,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:48,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:48,295 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-10 14:39:48,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:48,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868003947] [2024-11-10 14:39:48,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868003947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:48,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:48,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:48,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316906077] [2024-11-10 14:39:48,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:48,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:48,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:48,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:48,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:48,314 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 285 [2024-11-10 14:39:48,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 225 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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-10 14:39:48,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:48,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 285 [2024-11-10 14:39:48,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:48,359 INFO L124 PetriNetUnfolderBase]: 11/336 cut-off events. [2024-11-10 14:39:48,360 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-10 14:39:48,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 336 events. 11/336 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 699 event pairs, 5 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 329. Up to 23 conditions per place. [2024-11-10 14:39:48,363 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 11 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2024-11-10 14:39:48,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 224 transitions, 482 flow [2024-11-10 14:39:48,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-11-10 14:39:48,366 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8409356725146199 [2024-11-10 14:39:48,366 INFO L175 Difference]: Start difference. First operand has 227 places, 225 transitions, 458 flow. Second operand 3 states and 719 transitions. [2024-11-10 14:39:48,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 224 transitions, 482 flow [2024-11-10 14:39:48,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 224 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:48,369 INFO L231 Difference]: Finished difference. Result has 226 places, 224 transitions, 456 flow [2024-11-10 14:39:48,369 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=226, PETRI_TRANSITIONS=224} [2024-11-10 14:39:48,370 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -34 predicate places. [2024-11-10 14:39:48,370 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 224 transitions, 456 flow [2024-11-10 14:39:48,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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-10 14:39:48,371 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:48,371 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] [2024-11-10 14:39:48,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:39:48,372 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:48,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:48,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1138928262, now seen corresponding path program 1 times [2024-11-10 14:39:48,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:48,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963643004] [2024-11-10 14:39:48,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:48,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:48,418 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-10 14:39:48,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:48,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963643004] [2024-11-10 14:39:48,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963643004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:48,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:48,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:48,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086186481] [2024-11-10 14:39:48,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:48,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:48,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:48,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:48,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:48,434 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 285 [2024-11-10 14:39:48,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 224 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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-10 14:39:48,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:48,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 285 [2024-11-10 14:39:48,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:48,475 INFO L124 PetriNetUnfolderBase]: 11/335 cut-off events. [2024-11-10 14:39:48,476 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-10 14:39:48,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 368 conditions, 335 events. 11/335 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 699 event pairs, 5 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 320. Up to 23 conditions per place. [2024-11-10 14:39:48,477 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 11 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2024-11-10 14:39:48,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 223 transitions, 480 flow [2024-11-10 14:39:48,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 719 transitions. [2024-11-10 14:39:48,479 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8409356725146199 [2024-11-10 14:39:48,479 INFO L175 Difference]: Start difference. First operand has 226 places, 224 transitions, 456 flow. Second operand 3 states and 719 transitions. [2024-11-10 14:39:48,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 223 transitions, 480 flow [2024-11-10 14:39:48,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 223 transitions, 476 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:48,482 INFO L231 Difference]: Finished difference. Result has 225 places, 223 transitions, 454 flow [2024-11-10 14:39:48,482 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=225, PETRI_TRANSITIONS=223} [2024-11-10 14:39:48,484 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -35 predicate places. [2024-11-10 14:39:48,484 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 223 transitions, 454 flow [2024-11-10 14:39:48,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 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-10 14:39:48,484 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:48,485 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] [2024-11-10 14:39:48,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:39:48,486 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:48,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:48,486 INFO L85 PathProgramCache]: Analyzing trace with hash 459936870, now seen corresponding path program 1 times [2024-11-10 14:39:48,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:48,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633573833] [2024-11-10 14:39:48,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:48,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:48,527 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-10 14:39:48,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:48,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633573833] [2024-11-10 14:39:48,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633573833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:48,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:48,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:48,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591639937] [2024-11-10 14:39:48,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:48,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:48,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:48,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:48,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:48,535 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 285 [2024-11-10 14:39:48,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 223 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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-10 14:39:48,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:48,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 285 [2024-11-10 14:39:48,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:48,575 INFO L124 PetriNetUnfolderBase]: 11/343 cut-off events. [2024-11-10 14:39:48,575 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-10 14:39:48,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 376 conditions, 343 events. 11/343 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 747 event pairs, 2 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 320. Up to 14 conditions per place. [2024-11-10 14:39:48,576 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 12 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2024-11-10 14:39:48,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 226 transitions, 489 flow [2024-11-10 14:39:48,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:48,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:48,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2024-11-10 14:39:48,578 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.856140350877193 [2024-11-10 14:39:48,578 INFO L175 Difference]: Start difference. First operand has 225 places, 223 transitions, 454 flow. Second operand 3 states and 732 transitions. [2024-11-10 14:39:48,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 226 transitions, 489 flow [2024-11-10 14:39:48,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 226 transitions, 485 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:48,581 INFO L231 Difference]: Finished difference. Result has 225 places, 223 transitions, 458 flow [2024-11-10 14:39:48,582 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=225, PETRI_TRANSITIONS=223} [2024-11-10 14:39:48,582 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -35 predicate places. [2024-11-10 14:39:48,582 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 223 transitions, 458 flow [2024-11-10 14:39:48,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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-10 14:39:48,583 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:48,583 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-10 14:39:48,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:39:48,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:48,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:48,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1999632497, now seen corresponding path program 1 times [2024-11-10 14:39:48,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:48,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246760652] [2024-11-10 14:39:48,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:48,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:48,628 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-10 14:39:48,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:48,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246760652] [2024-11-10 14:39:48,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246760652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:48,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:48,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:48,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111856112] [2024-11-10 14:39:48,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:48,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:48,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:48,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:48,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:48,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 285 [2024-11-10 14:39:48,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 223 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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-10 14:39:48,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:48,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 285 [2024-11-10 14:39:48,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:48,684 INFO L124 PetriNetUnfolderBase]: 11/342 cut-off events. [2024-11-10 14:39:48,684 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2024-11-10 14:39:48,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 342 events. 11/342 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 745 event pairs, 5 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 175. Up to 25 conditions per place. [2024-11-10 14:39:48,685 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 11 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2024-11-10 14:39:48,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 482 flow [2024-11-10 14:39:48,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:48,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-11-10 14:39:48,687 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8432748538011696 [2024-11-10 14:39:48,687 INFO L175 Difference]: Start difference. First operand has 225 places, 223 transitions, 458 flow. Second operand 3 states and 721 transitions. [2024-11-10 14:39:48,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 482 flow [2024-11-10 14:39:48,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 222 transitions, 480 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:39:48,690 INFO L231 Difference]: Finished difference. Result has 225 places, 222 transitions, 458 flow [2024-11-10 14:39:48,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=225, PETRI_TRANSITIONS=222} [2024-11-10 14:39:48,691 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -35 predicate places. [2024-11-10 14:39:48,691 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 222 transitions, 458 flow [2024-11-10 14:39:48,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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-10 14:39:48,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:48,691 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] [2024-11-10 14:39:48,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:39:48,692 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:48,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:48,692 INFO L85 PathProgramCache]: Analyzing trace with hash -144062918, now seen corresponding path program 1 times [2024-11-10 14:39:48,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:48,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718831880] [2024-11-10 14:39:48,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:48,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:48,733 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-10 14:39:48,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:48,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718831880] [2024-11-10 14:39:48,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718831880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:48,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:48,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:48,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876648459] [2024-11-10 14:39:48,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:48,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:48,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:48,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:48,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:48,744 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 285 [2024-11-10 14:39:48,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 222 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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-10 14:39:48,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:48,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 285 [2024-11-10 14:39:48,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:48,791 INFO L124 PetriNetUnfolderBase]: 11/341 cut-off events. [2024-11-10 14:39:48,792 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-10 14:39:48,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 341 events. 11/341 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 742 event pairs, 5 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 319. Up to 23 conditions per place. [2024-11-10 14:39:48,793 INFO L140 encePairwiseOnDemand]: 283/285 looper letters, 10 selfloop transitions, 1 changer transitions 0/221 dead transitions. [2024-11-10 14:39:48,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 221 transitions, 478 flow [2024-11-10 14:39:48,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:48,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:48,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 728 transitions. [2024-11-10 14:39:48,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8514619883040936 [2024-11-10 14:39:48,795 INFO L175 Difference]: Start difference. First operand has 225 places, 222 transitions, 458 flow. Second operand 3 states and 728 transitions. [2024-11-10 14:39:48,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 221 transitions, 478 flow [2024-11-10 14:39:48,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 221 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:48,798 INFO L231 Difference]: Finished difference. Result has 224 places, 221 transitions, 454 flow [2024-11-10 14:39:48,798 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=224, PETRI_TRANSITIONS=221} [2024-11-10 14:39:48,799 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -36 predicate places. [2024-11-10 14:39:48,799 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 221 transitions, 454 flow [2024-11-10 14:39:48,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.0) internal successors, (720), 3 states have internal predecessors, (720), 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-10 14:39:48,800 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:48,800 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:48,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:39:48,800 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:48,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:48,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2015411698, now seen corresponding path program 1 times [2024-11-10 14:39:48,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:48,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744610141] [2024-11-10 14:39:48,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:48,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:48,862 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-10 14:39:48,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:48,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744610141] [2024-11-10 14:39:48,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744610141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:48,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:48,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:48,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169937059] [2024-11-10 14:39:48,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:48,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:48,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:48,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:48,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:48,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 285 [2024-11-10 14:39:48,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 221 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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-10 14:39:48,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:48,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 285 [2024-11-10 14:39:48,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:48,908 INFO L124 PetriNetUnfolderBase]: 11/340 cut-off events. [2024-11-10 14:39:48,908 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-10 14:39:48,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 340 events. 11/340 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 737 event pairs, 5 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 319. Up to 25 conditions per place. [2024-11-10 14:39:48,910 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 11 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2024-11-10 14:39:48,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 220 transitions, 478 flow [2024-11-10 14:39:48,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:48,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2024-11-10 14:39:48,911 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8432748538011696 [2024-11-10 14:39:48,911 INFO L175 Difference]: Start difference. First operand has 224 places, 221 transitions, 454 flow. Second operand 3 states and 721 transitions. [2024-11-10 14:39:48,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 220 transitions, 478 flow [2024-11-10 14:39:48,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 220 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:39:48,914 INFO L231 Difference]: Finished difference. Result has 224 places, 220 transitions, 455 flow [2024-11-10 14:39:48,915 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=224, PETRI_TRANSITIONS=220} [2024-11-10 14:39:48,916 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -36 predicate places. [2024-11-10 14:39:48,917 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 220 transitions, 455 flow [2024-11-10 14:39:48,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 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-10 14:39:48,917 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:48,918 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:48,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:39:48,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:48,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:48,921 INFO L85 PathProgramCache]: Analyzing trace with hash -406531619, now seen corresponding path program 1 times [2024-11-10 14:39:48,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:48,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601757224] [2024-11-10 14:39:48,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:48,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:48,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:49,349 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-10 14:39:49,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:49,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601757224] [2024-11-10 14:39:49,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601757224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:49,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:49,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:39:49,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014278871] [2024-11-10 14:39:49,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:49,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:39:49,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:49,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:39:49,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:39:49,413 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 285 [2024-11-10 14:39:49,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 220 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 230.5) internal successors, (1383), 6 states have internal predecessors, (1383), 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-10 14:39:49,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:49,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 285 [2024-11-10 14:39:49,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:49,467 INFO L124 PetriNetUnfolderBase]: 11/339 cut-off events. [2024-11-10 14:39:49,467 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-10 14:39:49,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 339 events. 11/339 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 730 event pairs, 5 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 329. Up to 30 conditions per place. [2024-11-10 14:39:49,469 INFO L140 encePairwiseOnDemand]: 279/285 looper letters, 16 selfloop transitions, 5 changer transitions 0/219 dead transitions. [2024-11-10 14:39:49,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 219 transitions, 495 flow [2024-11-10 14:39:49,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:39:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:39:49,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1395 transitions. [2024-11-10 14:39:49,472 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8157894736842105 [2024-11-10 14:39:49,473 INFO L175 Difference]: Start difference. First operand has 224 places, 220 transitions, 455 flow. Second operand 6 states and 1395 transitions. [2024-11-10 14:39:49,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 219 transitions, 495 flow [2024-11-10 14:39:49,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 219 transitions, 491 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:49,476 INFO L231 Difference]: Finished difference. Result has 226 places, 219 transitions, 459 flow [2024-11-10 14:39:49,476 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=459, PETRI_PLACES=226, PETRI_TRANSITIONS=219} [2024-11-10 14:39:49,479 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -34 predicate places. [2024-11-10 14:39:49,480 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 219 transitions, 459 flow [2024-11-10 14:39:49,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 230.5) internal successors, (1383), 6 states have internal predecessors, (1383), 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-10 14:39:49,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:49,481 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:49,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:39:49,481 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:49,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:49,482 INFO L85 PathProgramCache]: Analyzing trace with hash 611318638, now seen corresponding path program 1 times [2024-11-10 14:39:49,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:49,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781032737] [2024-11-10 14:39:49,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:49,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:49,512 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-10 14:39:49,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:49,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781032737] [2024-11-10 14:39:49,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781032737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:49,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:49,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:49,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977490181] [2024-11-10 14:39:49,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:49,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:49,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:49,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:49,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:49,525 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 285 [2024-11-10 14:39:49,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 219 transitions, 459 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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-10 14:39:49,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:49,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 285 [2024-11-10 14:39:49,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:49,554 INFO L124 PetriNetUnfolderBase]: 19/307 cut-off events. [2024-11-10 14:39:49,554 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-10 14:39:49,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 375 conditions, 307 events. 19/307 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 747 event pairs, 9 based on Foata normal form. 1/266 useless extension candidates. Maximal degree in co-relation 356. Up to 38 conditions per place. [2024-11-10 14:39:49,556 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 12 selfloop transitions, 1 changer transitions 2/216 dead transitions. [2024-11-10 14:39:49,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 216 transitions, 481 flow [2024-11-10 14:39:49,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:49,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:49,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2024-11-10 14:39:49,557 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8362573099415205 [2024-11-10 14:39:49,557 INFO L175 Difference]: Start difference. First operand has 226 places, 219 transitions, 459 flow. Second operand 3 states and 715 transitions. [2024-11-10 14:39:49,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 216 transitions, 481 flow [2024-11-10 14:39:49,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 216 transitions, 471 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:39:49,560 INFO L231 Difference]: Finished difference. Result has 220 places, 214 transitions, 441 flow [2024-11-10 14:39:49,561 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=441, PETRI_PLACES=220, PETRI_TRANSITIONS=214} [2024-11-10 14:39:49,561 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -40 predicate places. [2024-11-10 14:39:49,561 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 214 transitions, 441 flow [2024-11-10 14:39:49,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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-10 14:39:49,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:49,562 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:49,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:39:49,562 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:49,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1474291164, now seen corresponding path program 1 times [2024-11-10 14:39:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:49,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19023084] [2024-11-10 14:39:49,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:49,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:49,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:39:49,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:49,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19023084] [2024-11-10 14:39:49,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19023084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:49,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:49,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:49,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339176348] [2024-11-10 14:39:49,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:49,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:49,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:49,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:49,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:49,605 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 285 [2024-11-10 14:39:49,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 214 transitions, 441 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:39:49,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:49,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 285 [2024-11-10 14:39:49,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:49,644 INFO L124 PetriNetUnfolderBase]: 33/390 cut-off events. [2024-11-10 14:39:49,644 INFO L125 PetriNetUnfolderBase]: For 23/27 co-relation queries the response was YES. [2024-11-10 14:39:49,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 390 events. 33/390 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1262 event pairs, 9 based on Foata normal form. 1/344 useless extension candidates. Maximal degree in co-relation 426. Up to 38 conditions per place. [2024-11-10 14:39:49,646 INFO L140 encePairwiseOnDemand]: 277/285 looper letters, 14 selfloop transitions, 5 changer transitions 0/214 dead transitions. [2024-11-10 14:39:49,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 214 transitions, 484 flow [2024-11-10 14:39:49,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:49,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:49,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2024-11-10 14:39:49,647 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8374269005847953 [2024-11-10 14:39:49,648 INFO L175 Difference]: Start difference. First operand has 220 places, 214 transitions, 441 flow. Second operand 3 states and 716 transitions. [2024-11-10 14:39:49,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 214 transitions, 484 flow [2024-11-10 14:39:49,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 214 transitions, 483 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:39:49,650 INFO L231 Difference]: Finished difference. Result has 216 places, 211 transitions, 444 flow [2024-11-10 14:39:49,651 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=216, PETRI_TRANSITIONS=211} [2024-11-10 14:39:49,651 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -44 predicate places. [2024-11-10 14:39:49,651 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 211 transitions, 444 flow [2024-11-10 14:39:49,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:39:49,652 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:49,652 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:49,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:39:49,652 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:49,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash 545428167, now seen corresponding path program 1 times [2024-11-10 14:39:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:49,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596554772] [2024-11-10 14:39:49,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:49,680 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-10 14:39:49,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:49,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596554772] [2024-11-10 14:39:49,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596554772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:49,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:49,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:49,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199177748] [2024-11-10 14:39:49,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:49,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:49,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:49,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:49,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:49,693 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 285 [2024-11-10 14:39:49,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 211 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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-10 14:39:49,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:49,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 285 [2024-11-10 14:39:49,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:49,757 INFO L124 PetriNetUnfolderBase]: 54/523 cut-off events. [2024-11-10 14:39:49,757 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-10 14:39:49,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 523 events. 54/523 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2080 event pairs, 10 based on Foata normal form. 0/470 useless extension candidates. Maximal degree in co-relation 611. Up to 87 conditions per place. [2024-11-10 14:39:49,759 INFO L140 encePairwiseOnDemand]: 279/285 looper letters, 19 selfloop transitions, 3 changer transitions 0/215 dead transitions. [2024-11-10 14:39:49,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 215 transitions, 499 flow [2024-11-10 14:39:49,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2024-11-10 14:39:49,760 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8456140350877193 [2024-11-10 14:39:49,761 INFO L175 Difference]: Start difference. First operand has 216 places, 211 transitions, 444 flow. Second operand 3 states and 723 transitions. [2024-11-10 14:39:49,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 215 transitions, 499 flow [2024-11-10 14:39:49,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 215 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:49,763 INFO L231 Difference]: Finished difference. Result has 214 places, 211 transitions, 449 flow [2024-11-10 14:39:49,764 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=449, PETRI_PLACES=214, PETRI_TRANSITIONS=211} [2024-11-10 14:39:49,764 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -46 predicate places. [2024-11-10 14:39:49,764 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 211 transitions, 449 flow [2024-11-10 14:39:49,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 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-10 14:39:49,765 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:49,765 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:49,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:39:49,765 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:49,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:49,766 INFO L85 PathProgramCache]: Analyzing trace with hash -284836402, now seen corresponding path program 1 times [2024-11-10 14:39:49,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:49,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167324734] [2024-11-10 14:39:49,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:49,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:49,789 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-10 14:39:49,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:49,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167324734] [2024-11-10 14:39:49,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167324734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:49,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:49,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:49,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623928887] [2024-11-10 14:39:49,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:49,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:49,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:49,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:49,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:49,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 285 [2024-11-10 14:39:49,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 211 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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-10 14:39:49,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:49,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 285 [2024-11-10 14:39:49,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:49,856 INFO L124 PetriNetUnfolderBase]: 67/513 cut-off events. [2024-11-10 14:39:49,857 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-11-10 14:39:49,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 513 events. 67/513 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2144 event pairs, 26 based on Foata normal form. 0/458 useless extension candidates. Maximal degree in co-relation 617. Up to 100 conditions per place. [2024-11-10 14:39:49,859 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 16 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2024-11-10 14:39:49,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 213 transitions, 490 flow [2024-11-10 14:39:49,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2024-11-10 14:39:49,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8456140350877193 [2024-11-10 14:39:49,861 INFO L175 Difference]: Start difference. First operand has 214 places, 211 transitions, 449 flow. Second operand 3 states and 723 transitions. [2024-11-10 14:39:49,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 213 transitions, 490 flow [2024-11-10 14:39:49,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 213 transitions, 490 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:39:49,864 INFO L231 Difference]: Finished difference. Result has 215 places, 210 transitions, 451 flow [2024-11-10 14:39:49,864 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=451, PETRI_PLACES=215, PETRI_TRANSITIONS=210} [2024-11-10 14:39:49,865 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -45 predicate places. [2024-11-10 14:39:49,865 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 210 transitions, 451 flow [2024-11-10 14:39:49,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 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-10 14:39:49,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:49,865 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:49,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:39:49,866 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:49,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:49,866 INFO L85 PathProgramCache]: Analyzing trace with hash 629910540, now seen corresponding path program 1 times [2024-11-10 14:39:49,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:49,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692724634] [2024-11-10 14:39:49,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:49,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:49,893 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-10 14:39:49,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:49,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692724634] [2024-11-10 14:39:49,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692724634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:49,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:49,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:49,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048254495] [2024-11-10 14:39:49,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:49,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:49,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:49,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:49,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:49,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 285 [2024-11-10 14:39:49,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 210 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-10 14:39:49,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:49,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 285 [2024-11-10 14:39:49,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:49,960 INFO L124 PetriNetUnfolderBase]: 57/464 cut-off events. [2024-11-10 14:39:49,960 INFO L125 PetriNetUnfolderBase]: For 35/37 co-relation queries the response was YES. [2024-11-10 14:39:49,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 464 events. 57/464 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1757 event pairs, 23 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 583. Up to 81 conditions per place. [2024-11-10 14:39:49,962 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 17 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2024-11-10 14:39:49,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 212 transitions, 498 flow [2024-11-10 14:39:49,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:49,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2024-11-10 14:39:49,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2024-11-10 14:39:49,964 INFO L175 Difference]: Start difference. First operand has 215 places, 210 transitions, 451 flow. Second operand 3 states and 720 transitions. [2024-11-10 14:39:49,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 212 transitions, 498 flow [2024-11-10 14:39:49,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 212 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:49,967 INFO L231 Difference]: Finished difference. Result has 214 places, 209 transitions, 449 flow [2024-11-10 14:39:49,968 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=449, PETRI_PLACES=214, PETRI_TRANSITIONS=209} [2024-11-10 14:39:49,968 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -46 predicate places. [2024-11-10 14:39:49,968 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 209 transitions, 449 flow [2024-11-10 14:39:49,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-10 14:39:49,969 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:49,969 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:49,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:39:49,969 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:49,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:49,970 INFO L85 PathProgramCache]: Analyzing trace with hash -751276490, now seen corresponding path program 1 times [2024-11-10 14:39:49,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:49,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736072432] [2024-11-10 14:39:49,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:49,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:50,000 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-10 14:39:50,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:50,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736072432] [2024-11-10 14:39:50,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736072432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:50,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:50,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:50,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546146223] [2024-11-10 14:39:50,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:50,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:50,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:50,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:50,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:50,018 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 285 [2024-11-10 14:39:50,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 209 transitions, 449 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-10 14:39:50,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:50,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 285 [2024-11-10 14:39:50,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:50,064 INFO L124 PetriNetUnfolderBase]: 57/461 cut-off events. [2024-11-10 14:39:50,064 INFO L125 PetriNetUnfolderBase]: For 38/43 co-relation queries the response was YES. [2024-11-10 14:39:50,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 461 events. 57/461 cut-off events. For 38/43 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1744 event pairs, 23 based on Foata normal form. 1/416 useless extension candidates. Maximal degree in co-relation 580. Up to 81 conditions per place. [2024-11-10 14:39:50,066 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 17 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-11-10 14:39:50,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 211 transitions, 496 flow [2024-11-10 14:39:50,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 720 transitions. [2024-11-10 14:39:50,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8421052631578947 [2024-11-10 14:39:50,068 INFO L175 Difference]: Start difference. First operand has 214 places, 209 transitions, 449 flow. Second operand 3 states and 720 transitions. [2024-11-10 14:39:50,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 211 transitions, 496 flow [2024-11-10 14:39:50,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 211 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:50,070 INFO L231 Difference]: Finished difference. Result has 213 places, 208 transitions, 447 flow [2024-11-10 14:39:50,071 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=213, PETRI_TRANSITIONS=208} [2024-11-10 14:39:50,071 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -47 predicate places. [2024-11-10 14:39:50,071 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 208 transitions, 447 flow [2024-11-10 14:39:50,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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-10 14:39:50,072 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:50,072 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:50,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:39:50,072 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:50,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:50,073 INFO L85 PathProgramCache]: Analyzing trace with hash -665566628, now seen corresponding path program 1 times [2024-11-10 14:39:50,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:50,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694714395] [2024-11-10 14:39:50,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:50,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:50,100 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-10 14:39:50,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:50,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694714395] [2024-11-10 14:39:50,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694714395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:50,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:50,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:50,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908930800] [2024-11-10 14:39:50,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:50,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:50,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:50,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:50,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:50,117 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 285 [2024-11-10 14:39:50,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 208 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 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-10 14:39:50,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:50,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 285 [2024-11-10 14:39:50,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:50,181 INFO L124 PetriNetUnfolderBase]: 62/495 cut-off events. [2024-11-10 14:39:50,181 INFO L125 PetriNetUnfolderBase]: For 23/24 co-relation queries the response was YES. [2024-11-10 14:39:50,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 495 events. 62/495 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1955 event pairs, 19 based on Foata normal form. 1/456 useless extension candidates. Maximal degree in co-relation 587. Up to 69 conditions per place. [2024-11-10 14:39:50,183 INFO L140 encePairwiseOnDemand]: 280/285 looper letters, 13 selfloop transitions, 2 changer transitions 4/209 dead transitions. [2024-11-10 14:39:50,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 209 transitions, 482 flow [2024-11-10 14:39:50,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2024-11-10 14:39:50,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2024-11-10 14:39:50,185 INFO L175 Difference]: Start difference. First operand has 213 places, 208 transitions, 447 flow. Second operand 3 states and 722 transitions. [2024-11-10 14:39:50,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 209 transitions, 482 flow [2024-11-10 14:39:50,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 209 transitions, 478 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:50,189 INFO L231 Difference]: Finished difference. Result has 211 places, 202 transitions, 435 flow [2024-11-10 14:39:50,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=435, PETRI_PLACES=211, PETRI_TRANSITIONS=202} [2024-11-10 14:39:50,189 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -49 predicate places. [2024-11-10 14:39:50,190 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 202 transitions, 435 flow [2024-11-10 14:39:50,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.0) internal successors, (711), 3 states have internal predecessors, (711), 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-10 14:39:50,191 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:50,191 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:50,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:39:50,191 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:50,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:50,192 INFO L85 PathProgramCache]: Analyzing trace with hash 926298142, now seen corresponding path program 1 times [2024-11-10 14:39:50,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:50,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093461520] [2024-11-10 14:39:50,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:50,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:39:50,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:50,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093461520] [2024-11-10 14:39:50,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093461520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:50,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:50,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:50,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882184448] [2024-11-10 14:39:50,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:50,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:50,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:50,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:50,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:50,241 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 235 out of 285 [2024-11-10 14:39:50,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 202 transitions, 435 flow. Second operand has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 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-10 14:39:50,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:50,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 235 of 285 [2024-11-10 14:39:50,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:50,299 INFO L124 PetriNetUnfolderBase]: 82/502 cut-off events. [2024-11-10 14:39:50,299 INFO L125 PetriNetUnfolderBase]: For 27/28 co-relation queries the response was YES. [2024-11-10 14:39:50,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 502 events. 82/502 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2020 event pairs, 29 based on Foata normal form. 0/472 useless extension candidates. Maximal degree in co-relation 647. Up to 107 conditions per place. [2024-11-10 14:39:50,302 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 15 selfloop transitions, 2 changer transitions 0/204 dead transitions. [2024-11-10 14:39:50,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 204 transitions, 474 flow [2024-11-10 14:39:50,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:50,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:50,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2024-11-10 14:39:50,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8444444444444444 [2024-11-10 14:39:50,304 INFO L175 Difference]: Start difference. First operand has 211 places, 202 transitions, 435 flow. Second operand 3 states and 722 transitions. [2024-11-10 14:39:50,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 204 transitions, 474 flow [2024-11-10 14:39:50,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 204 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:50,306 INFO L231 Difference]: Finished difference. Result has 206 places, 201 transitions, 433 flow [2024-11-10 14:39:50,307 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=433, PETRI_PLACES=206, PETRI_TRANSITIONS=201} [2024-11-10 14:39:50,307 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -54 predicate places. [2024-11-10 14:39:50,307 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 201 transitions, 433 flow [2024-11-10 14:39:50,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 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-10 14:39:50,308 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:50,308 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:50,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:39:50,308 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:50,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:50,308 INFO L85 PathProgramCache]: Analyzing trace with hash 184028807, now seen corresponding path program 1 times [2024-11-10 14:39:50,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:50,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382537444] [2024-11-10 14:39:50,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:50,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:50,423 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-10 14:39:50,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:50,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382537444] [2024-11-10 14:39:50,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382537444] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:50,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:50,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:39:50,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019598184] [2024-11-10 14:39:50,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:50,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:50,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:50,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:50,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:50,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 285 [2024-11-10 14:39:50,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 201 transitions, 433 flow. Second operand has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-10 14:39:50,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:50,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 285 [2024-11-10 14:39:50,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:50,464 INFO L124 PetriNetUnfolderBase]: 24/391 cut-off events. [2024-11-10 14:39:50,464 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-10 14:39:50,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 391 events. 24/391 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1075 event pairs, 3 based on Foata normal form. 1/367 useless extension candidates. Maximal degree in co-relation 421. Up to 34 conditions per place. [2024-11-10 14:39:50,466 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 12 selfloop transitions, 3 changer transitions 0/204 dead transitions. [2024-11-10 14:39:50,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 204 transitions, 470 flow [2024-11-10 14:39:50,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 732 transitions. [2024-11-10 14:39:50,468 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.856140350877193 [2024-11-10 14:39:50,468 INFO L175 Difference]: Start difference. First operand has 206 places, 201 transitions, 433 flow. Second operand 3 states and 732 transitions. [2024-11-10 14:39:50,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 204 transitions, 470 flow [2024-11-10 14:39:50,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 204 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:50,470 INFO L231 Difference]: Finished difference. Result has 207 places, 203 transitions, 448 flow [2024-11-10 14:39:50,471 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2024-11-10 14:39:50,471 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -53 predicate places. [2024-11-10 14:39:50,471 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 448 flow [2024-11-10 14:39:50,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.33333333333334) internal successors, (724), 3 states have internal predecessors, (724), 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-10 14:39:50,472 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:50,472 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:50,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:39:50,472 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:50,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:50,472 INFO L85 PathProgramCache]: Analyzing trace with hash 327269426, now seen corresponding path program 1 times [2024-11-10 14:39:50,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:50,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157895411] [2024-11-10 14:39:50,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:50,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:50,519 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-10 14:39:50,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:50,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157895411] [2024-11-10 14:39:50,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157895411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:50,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:50,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:50,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537756185] [2024-11-10 14:39:50,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:50,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:50,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:50,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:50,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:50,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 285 [2024-11-10 14:39:50,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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-10 14:39:50,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:50,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 285 [2024-11-10 14:39:50,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:50,570 INFO L124 PetriNetUnfolderBase]: 37/408 cut-off events. [2024-11-10 14:39:50,570 INFO L125 PetriNetUnfolderBase]: For 51/55 co-relation queries the response was YES. [2024-11-10 14:39:50,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 408 events. 37/408 cut-off events. For 51/55 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1339 event pairs, 8 based on Foata normal form. 1/393 useless extension candidates. Maximal degree in co-relation 484. Up to 41 conditions per place. [2024-11-10 14:39:50,572 INFO L140 encePairwiseOnDemand]: 280/285 looper letters, 13 selfloop transitions, 2 changer transitions 4/204 dead transitions. [2024-11-10 14:39:50,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 204 transitions, 489 flow [2024-11-10 14:39:50,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:50,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:50,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 724 transitions. [2024-11-10 14:39:50,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8467836257309942 [2024-11-10 14:39:50,573 INFO L175 Difference]: Start difference. First operand has 207 places, 203 transitions, 448 flow. Second operand 3 states and 724 transitions. [2024-11-10 14:39:50,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 204 transitions, 489 flow [2024-11-10 14:39:50,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 204 transitions, 486 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:39:50,576 INFO L231 Difference]: Finished difference. Result has 206 places, 197 transitions, 436 flow [2024-11-10 14:39:50,576 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=436, PETRI_PLACES=206, PETRI_TRANSITIONS=197} [2024-11-10 14:39:50,576 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -54 predicate places. [2024-11-10 14:39:50,577 INFO L471 AbstractCegarLoop]: Abstraction has has 206 places, 197 transitions, 436 flow [2024-11-10 14:39:50,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 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-10 14:39:50,577 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:39:50,577 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:50,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:39:50,577 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2024-11-10 14:39:50,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:39:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash 413546101, now seen corresponding path program 1 times [2024-11-10 14:39:50,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:39:50,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765985371] [2024-11-10 14:39:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:39:50,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:39:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:39:50,611 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-10 14:39:50,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:39:50,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765985371] [2024-11-10 14:39:50,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765985371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:39:50,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:39:50,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:39:50,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184905594] [2024-11-10 14:39:50,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:39:50,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:39:50,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:39:50,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:39:50,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:39:50,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 236 out of 285 [2024-11-10 14:39:50,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 197 transitions, 436 flow. Second operand has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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-10 14:39:50,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:39:50,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 236 of 285 [2024-11-10 14:39:50,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:39:50,663 INFO L124 PetriNetUnfolderBase]: 40/402 cut-off events. [2024-11-10 14:39:50,663 INFO L125 PetriNetUnfolderBase]: For 59/63 co-relation queries the response was YES. [2024-11-10 14:39:50,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 402 events. 40/402 cut-off events. For 59/63 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1291 event pairs, 12 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 497. Up to 61 conditions per place. [2024-11-10 14:39:50,664 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 0 selfloop transitions, 0 changer transitions 199/199 dead transitions. [2024-11-10 14:39:50,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 199 transitions, 479 flow [2024-11-10 14:39:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:39:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:39:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2024-11-10 14:39:50,666 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8456140350877193 [2024-11-10 14:39:50,666 INFO L175 Difference]: Start difference. First operand has 206 places, 197 transitions, 436 flow. Second operand 3 states and 723 transitions. [2024-11-10 14:39:50,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 199 transitions, 479 flow [2024-11-10 14:39:50,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 199 transitions, 475 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:39:50,668 INFO L231 Difference]: Finished difference. Result has 201 places, 0 transitions, 0 flow [2024-11-10 14:39:50,668 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=201, PETRI_TRANSITIONS=0} [2024-11-10 14:39:50,669 INFO L277 CegarLoopForPetriNet]: 260 programPoint places, -59 predicate places. [2024-11-10 14:39:50,669 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 0 transitions, 0 flow [2024-11-10 14:39:50,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 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-10 14:39:50,671 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2024-11-10 14:39:50,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2024-11-10 14:39:50,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2024-11-10 14:39:50,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2024-11-10 14:39:50,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2024-11-10 14:39:50,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2024-11-10 14:39:50,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2024-11-10 14:39:50,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2024-11-10 14:39:50,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2024-11-10 14:39:50,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2024-11-10 14:39:50,672 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2024-11-10 14:39:50,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2024-11-10 14:39:50,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2024-11-10 14:39:50,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2024-11-10 14:39:50,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2024-11-10 14:39:50,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2024-11-10 14:39:50,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2024-11-10 14:39:50,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2024-11-10 14:39:50,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2024-11-10 14:39:50,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2024-11-10 14:39:50,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2024-11-10 14:39:50,673 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2024-11-10 14:39:50,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2024-11-10 14:39:50,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2024-11-10 14:39:50,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2024-11-10 14:39:50,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2024-11-10 14:39:50,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2024-11-10 14:39:50,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2024-11-10 14:39:50,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2024-11-10 14:39:50,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2024-11-10 14:39:50,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2024-11-10 14:39:50,674 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2024-11-10 14:39:50,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2024-11-10 14:39:50,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2024-11-10 14:39:50,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2024-11-10 14:39:50,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2024-11-10 14:39:50,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2024-11-10 14:39:50,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2024-11-10 14:39:50,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2024-11-10 14:39:50,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2024-11-10 14:39:50,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2024-11-10 14:39:50,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2024-11-10 14:39:50,675 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2024-11-10 14:39:50,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2024-11-10 14:39:50,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2024-11-10 14:39:50,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2024-11-10 14:39:50,676 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2024-11-10 14:39:50,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2024-11-10 14:39:50,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2024-11-10 14:39:50,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2024-11-10 14:39:50,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2024-11-10 14:39:50,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2024-11-10 14:39:50,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2024-11-10 14:39:50,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 94 remaining) [2024-11-10 14:39:50,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2024-11-10 14:39:50,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (38 of 94 remaining) [2024-11-10 14:39:50,677 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2024-11-10 14:39:50,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2024-11-10 14:39:50,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2024-11-10 14:39:50,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2024-11-10 14:39:50,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2024-11-10 14:39:50,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2024-11-10 14:39:50,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2024-11-10 14:39:50,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2024-11-10 14:39:50,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2024-11-10 14:39:50,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2024-11-10 14:39:50,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2024-11-10 14:39:50,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2024-11-10 14:39:50,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2024-11-10 14:39:50,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2024-11-10 14:39:50,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2024-11-10 14:39:50,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2024-11-10 14:39:50,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2024-11-10 14:39:50,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2024-11-10 14:39:50,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2024-11-10 14:39:50,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2024-11-10 14:39:50,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2024-11-10 14:39:50,679 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2024-11-10 14:39:50,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2024-11-10 14:39:50,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2024-11-10 14:39:50,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2024-11-10 14:39:50,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2024-11-10 14:39:50,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2024-11-10 14:39:50,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2024-11-10 14:39:50,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2024-11-10 14:39:50,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2024-11-10 14:39:50,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2024-11-10 14:39:50,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2024-11-10 14:39:50,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2024-11-10 14:39:50,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2024-11-10 14:39:50,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2024-11-10 14:39:50,680 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2024-11-10 14:39:50,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2024-11-10 14:39:50,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2024-11-10 14:39:50,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:39:50,681 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:39:50,685 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:39:50,685 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:39:50,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:39:50 BasicIcfg [2024-11-10 14:39:50,689 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:39:50,689 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:39:50,690 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:39:50,690 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:39:50,690 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:39:47" (3/4) ... [2024-11-10 14:39:50,691 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 14:39:50,693 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-10 14:39:50,693 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-10 14:39:50,696 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2024-11-10 14:39:50,697 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 14:39:50,697 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 14:39:50,697 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 14:39:50,772 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:39:50,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 14:39:50,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:39:50,773 INFO L158 Benchmark]: Toolchain (without parser) took 4882.60ms. Allocated memory was 169.9MB in the beginning and 316.7MB in the end (delta: 146.8MB). Free memory was 140.0MB in the beginning and 175.5MB in the end (delta: -35.4MB). Peak memory consumption was 112.4MB. Max. memory is 16.1GB. [2024-11-10 14:39:50,773 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:39:50,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.09ms. Allocated memory is still 169.9MB. Free memory was 139.2MB in the beginning and 125.4MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 14:39:50,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.71ms. Allocated memory is still 169.9MB. Free memory was 125.4MB in the beginning and 122.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:39:50,774 INFO L158 Benchmark]: Boogie Preprocessor took 24.62ms. Allocated memory is still 169.9MB. Free memory was 122.5MB in the beginning and 120.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:39:50,774 INFO L158 Benchmark]: IcfgBuilder took 1066.20ms. Allocated memory is still 169.9MB. Free memory was 120.4MB in the beginning and 78.9MB in the end (delta: 41.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-10 14:39:50,775 INFO L158 Benchmark]: TraceAbstraction took 3400.82ms. Allocated memory was 169.9MB in the beginning and 316.7MB in the end (delta: 146.8MB). Free memory was 77.6MB in the beginning and 181.8MB in the end (delta: -104.2MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2024-11-10 14:39:50,775 INFO L158 Benchmark]: Witness Printer took 83.44ms. Allocated memory is still 316.7MB. Free memory was 181.8MB in the beginning and 175.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 14:39:50,776 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 169.9MB. Free memory is still 138.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.09ms. Allocated memory is still 169.9MB. Free memory was 139.2MB in the beginning and 125.4MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.71ms. Allocated memory is still 169.9MB. Free memory was 125.4MB in the beginning and 122.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.62ms. Allocated memory is still 169.9MB. Free memory was 122.5MB in the beginning and 120.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1066.20ms. Allocated memory is still 169.9MB. Free memory was 120.4MB in the beginning and 78.9MB in the end (delta: 41.5MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3400.82ms. Allocated memory was 169.9MB in the beginning and 316.7MB in the end (delta: 146.8MB). Free memory was 77.6MB in the beginning and 181.8MB in the end (delta: -104.2MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. * Witness Printer took 83.44ms. Allocated memory is still 316.7MB. Free memory was 181.8MB in the beginning and 175.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 377 locations, 94 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.2s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 396 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 153 mSDsluCounter, 70 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 643 IncrementalHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 70 mSDtfsCounter, 643 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=538occurred in iteration=0, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1817 NumberOfCodeBlocks, 1817 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1797 ConstructedInterpolants, 0 QuantifiedInterpolants, 2082 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 53 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 14:39:50,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE